Knight Route is a game based on the classical knight’s tour problem (a.k.a. Polish solitary), involving both the rules of Chess and the mathematical Theory of Graphs.
The aim of the game is to make a knight to visit each single cell in the chessboard exactly once.
According to the rules of Chess, the knight moves to any of the closest squares that are not on the same rank, file, or diagonal, thus the move forms an L-shape: two squares vertically and one square horizontally, or two squares horizontally and one square vertically; the knight is the only piece that can leap over other pieces.
If the knight ends in a square from which no moves are allowed, the game is over.
Knight Route provides several levels, with increasing difficulty, characterized by different chessboard size, time penalties a limited possibility to undo wrong moves. The score assigned to the player is based on the moves done, on the time between one move and another and on the use of the "undo" function.