(Created page with "{{Infobox PSP Homebrews |title=Knight's Tour PSP |image=knightstourpsp.png |description=A demonstration of the Knight's Tour Problem posed by mathematician Leonhard Euler. |author=Jared Bruni |lastupdated=2006/01/17 |type=Demos |format= |version=2006 |license=GPL-3.0 |download=https://dlhb.gamebrew.org/psphomebrew/knightstourpsp.7z |website=http://forums.qj.net/f-psp-development-forum-11/t-knights-tour-for-psp-33771.html |source=https://github.com/lostjared/PSP.Homebrew/...") |
No edit summary |
||
| Line 13: | Line 13: | ||
|source=https://github.com/lostjared/PSP.Homebrew/tree/master/apps | |source=https://github.com/lostjared/PSP.Homebrew/tree/master/apps | ||
}} | }} | ||
An algorithm to demonstrate one of the interesting puzzles of chess | 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 a empty chess board and touch each of the 64 squares once and only once. This demonstrates a solution to this problem. | 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. | ||
Revision as of 13:20, 19 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 a 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.