Developer-Student-Clubs-VSSUT-Burla/Master-PyAlgo

Knight's Tour

Closed this issue · 0 comments

Aim: To check whether it is possible for a Knight to visit each
cell of the N*N chessboard without visiting any cell
twice starting from (X, Y) position.