This site requires JavaScript, please enable it in your browser!
Greenfoot back

Report as inappropriate.

nachocab
nachocab presents ...

2012/11/11

Knight tour

This is a project of my students at ITESM - Campus Puebla in México.
The simulation is based on the Euler's Algorithm. The knight should move over the 64 positions in a chess board without visiting a square more than once. You can initialize the game in any row and column. Turn on your computer's sound to hear the horse ready to make it's movements.

4347 views / 10 in the last 7 days

3 votes | 0 in the last 7 days

Tags: simulation chess algorithms

Your browser is ignoring the <APPLET> tag.
HTML5 version not available | Scenario not running?
A new version of this scenario was uploaded on Sun Nov 11 21:49:58 UTC 2012 New sound added to each Knight's move
MatheMagicianMatheMagician

2012/11/12

Spectacular! Would you mind sharing the code? I would love to see the algorithm that you used to solve it.
edseds

2012/11/14

Me gusto mucho.
nachocabnachocab

2012/11/17

You can find the Algorithm in any serious computer programming book.

Want to leave a comment? You must first log in.

Who likes this?

wesson eds MatheMagician