A Knight’s Tour is a chess problem where the knight starts at any square and has to visit every square but it can’t visit the same square twice. I was inspired by this problem and made this program so that people may try to solve it for themselves. It’s written in C++/DirectX12.
Source Code: GitHub
The last move made shown with the color green. And the next square you can visit is shown by blue. Already visited squares are shown by grey. You can undo the moves you made by pressing “U” or redo by pressing “R”. And if you want to start from the beginning press “C”.