 |
|
|
Knight's tour (v. 1.0) Разработано Whole Group |
The earliest known references to the Knight's Tour problem date back to the 9th century. The Knight's Tour is a mathematical problem involving a knight on a chessboard. The knight is placed on the empty board and, moving according to the rules of chess, must visit each square exactly once.
|
|
|
[2012-05-06] A Google User: Мило |
|
|
[2011-01-14] A Google User: Nice |
|
|
[2011-01-14] Andrey: Nice |
|
|
[2010-12-28] A Google User: Simple concept, but entertaining. |
 |
|
[2010-12-28] Justin: Simple concept, but entertaining. |
|
|
Android-Online.ru © 2013 |
|
