The Knight's tour is a traditional chess problem where a lone knight is placed on a chess board and must visit each square only once. You can play this perfectly simple free implementation created by u/psrwo on Reddit. The source code is at github. The knight is randomly placed at the outset.
I can't visit more than fifty-something squares, because I'm terrible at stuff like this.
