![]() Home | Message Board | Awards | Puzzles | Text Chat | Links | Book Store | FAQ | SubscriberZone Games | Players | Subscribers | Top-100 | Challenge Central | Assoc. Tourneys | Site Tourneys | ![]() |
| View this page in... | ||||
El español |
Français |
Deutsch |
L'italiano |
O português |
| Language translation service provided by FreeTranslation.com | ||||
|
This puzzle (and solution) requires that you have a JavaScript-enabled browser.
The JavaScript implementation of the puzzle was written by Alexandre Varioukhine.
He has a cool web page. Check it out. The JavaScript solution to this puzzle was written by Stan Steliga. The goal of the puzzle is to cover the entire board moving the knight from field to field. You win when each field was visited once. I found the solution to this puzzle on another page somewhere on the net. I wish I could give credit, but I can't find it anymore. It turns out that the solution is fairly simple (for a computer). You can start from any square on the board. What you do after the first step is:
To solve this puzzle, just click on any one button below. JavaScript code will take off and number the buttons as it fills the board using the logic above. You can look at the Page Source to see the JavaScript. I'm an experienced programmer, but JavaScript is new to me, so I know that I probably could have done a few things more efficiently, but I'm learning. I'd appreciate any comments about how the code could be different. |