Skip to content

A program that determines the minimum number of knight's steps needed to get from the starting field to the ending field on chess board.

Notifications You must be signed in to change notification settings

BaneTrifa/KnightsMinMoves

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

14 Commits
 
 
 
 
 
 
 
 

Repository files navigation

KNIGHTS MIN MOVES

Description

A program that, based on the entered starting and ending coordinates of the knight, determines the minimum number of steps needed to get from the starting field to the ending field and prints each field over which the knight crossed (the path).

Running

To run the program, follow these commands:

  1. Open the terminal in the where src files are.
  2. Run command: g++ main.cpp minMoves.cpp minMoves.h -o main
  3. Run: main.exe

Demonstration of functionalities

INPUT (valid):

12

OUTPUT:

13

INPUT (invalid):

14

Author

About

A program that determines the minimum number of knight's steps needed to get from the starting field to the ending field on chess board.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages