Knight's Tour - Githubissues

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

36 stars 84 forks source link

Knight's Tour #584

Closed Manasi2001 closed 3 years ago

Manasi2001 commented 3 years ago

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.