GitHub repository: Govindskatyura/Chess_board_problem
Primary language: Python
Created: 2019-02-16T13:35:20Z
Description: On a chess board go from [0, 0] to [8, 8] to find the shortest Path for your color pawn.  If you find any pawn on the way, choose the next shortest path.  Starting position will always be [0,0]  When user runs the program, it must prompt for the location of the pawn. After entering the location, program must find the next shortest path.  There may or may not be more than one pawn on the chess board.