Toggle menu
Toggle personal menu
Not logged in
Your IP address will be publicly visible if you make any edits.

Knight's Tour PSP

From GameBrew
Revision as of 13:20, 19 September 2024 by HydeWing (talk | contribs) (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/...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Knight's Tour PSP
Knightstourpsp.png
General
AuthorJared Bruni
TypeDemos
Version2006
LicenseGPL-3.0
Last Updated2006/01/17
Links
Download
Website
Source

An algorithm to demonstrate one of the interesting puzzles of chess. This program demonstrates the problem 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.

External links

Advertising: