You do not have permission to edit this page, for the following reason:
The action you have requested is limited to users in one of the groups: Users, Administrators.
Free text:
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. == External links == * GitHub - https://github.com/lostjared/PSP.Homebrew/tree/master/apps * QuickJump - http://forums.qj.net/f-psp-development-forum-11/t-knights-tour-for-psp-33771.html
Advertising: