Knight’s Tour
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 […]