February 3, 2014, by Graham Kendall
How to get ants to solve a chess problem
The article looks at a mathematical problem that asks whether a knight can visit every square on a chess board, exactly once, using legal knoight moves.
The piece starts “Take a set of chess pieces and throw them all away except for one knight. Place the knight on any one of the 64 squares of a chess board.
Can you make 63 legal moves so that you visit every square on the chess board exactly once?” [read more]
No comments yet, fill out a comment to be the first