Find a route for the chess knight to visit each of the chess board fields once. Initially the board is empty. First click on the board to put the knight on a starting field, then move it from there to the next desired field (or click on it). Try making as many moves as possible. Individual highscores are stored (storage can be reset via the menu). The absolute record is, as you may guess, 64. A...
Find a route for the chess knight to visit each of the chess board fields once. Initially the board is empty. First click on the board to put the knight on a starting field, then move it from there to the next desired field (or click on it). Try making as many moves as possible. Individual highscores are stored (storage can be reset via the menu). The absolute record is, as you may guess, 64. According to the player's choice passed fields are marked with move numbers, lines, or both. Idea / theory: http://en.wikipedia.org/wiki/Knight%27s_tour
