Data Structure Project done by Sandesh Pokhrel, Santosh Pangeni and Subodh Baral.
Download/Clone the project and open it in Qt creator, to play.
- The goal is to move the knight through the whole 8 by 8 chess board without revisiting any square twice.
- Click on any square to place the knight on the square.
- Click on the active square to undo the last move.
- The game is over once the knight has no place to move or all 64 squares have been completed.
- The score(number of moves) is shown on left-top of the square.
- Recap button traverses a binary tree representation of an m-ary tree to review the last game played.
- Auto-solve button uses Wansdroff algorithm(implemented using BST) to solve the board.
- Reset button resets the board for new game.
