Advertisement
C_Volume2 Miscellaneous #81868

Knights Tour

Algorithm to demonstrate one of the interesting puzzles of chess. This program demonstrates the problem originaly puprosed by the mathmatician Euler. The puzzle is this, can the chess piece known as the knight move around a empty chess board and touch each of the 64 squares once and only once. This demonstrates a solution to this problem. Press the Space bar to move the knight, and press the enter key to return the board back to normal.

AI

AI Summary: This codebase represents a historical implementation of the logic described in the metadata. Our preservation engine analyzes the structure to provide context for modern developers.

Source Code
original-source
Upload
Original Comments (3)
Recovered from Wayback Machine