The longest uncrossed knight's path is a puzzle on a chess board, in which your task is to find the longest possible path of a knight (using standard chess knight moves) in such a way that the path does not intersect itself.
The classic longest uncrossed knight's path problem can be extended to any board size (larger than 2). In this small game you can test nine different board size: 5x5, 6x6, 7x7, 8x8, 9x9, 10x10, 11x11, 12x12, 15x15, and also record your progress on each board.
The classic longest uncrossed knight's path problem can be extended to any board size (larger than 2). In this small game you can test nine different board size: 5x5, 6x6, 7x7, 8x8, 9x9, 10x10, 11x11, 12x12, 15x15, and also record your progress on each board.
Other chess problems:
Other chess games: