No edit summary |
No edit summary |
||
| Line 15: | Line 15: | ||
An algorithm to demonstrate one of the interesting puzzles of chess that was originally purposed by the mathematician Euler. | An algorithm to demonstrate one of the interesting puzzles of chess that was originally purposed by the mathematician Euler. | ||
The puzzle is this, can the chess piece known as the knight move around | The puzzle is this, can the chess piece known as the knight move around an empty chess board and touch each of the 64 squares once and only once. This demonstrates a solution to this problem. | ||
== Controls == | == Controls == | ||
Latest revision as of 00:57, 20 September 2024
| Knight's Tour PSP | |
|---|---|
 | |
| General | |
| Author | Jared Bruni |
| Type | Demos |
| Version | 2006 |
| License | GPL-3.0 |
| Last Updated | 2006/01/17 |
| Links | |
| Download | |
| Website | |
| Source | |
An algorithm to demonstrate one of the interesting puzzles of chess that was originally purposed by the mathematician Euler.
The puzzle is this, can the chess piece known as the knight move around an empty chess board and touch each of the 64 squares once and only once. This demonstrates a solution to this problem.
Controls
Triangle - Move the knight
Circle - Return the board back to normal
Credits
Jared Bruni / Lostjared.