February 3, 2014, by Graham Kendall

How to get ants to solve a chess problem

We have just had a piece published in TheConversation (other posts featuring TheConversation can be seen here).

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]

Knight's Tour (Link to Wikipedia Commons)

Knight’s Tour (Link to Wikipedia Commons)

 

 

Ant by Samantha Henneke (Link to Samantha Henneke ), CC 2.0

Ant by Samantha Henneke (Link to Samantha Henneke ), CC 2.0

 

Chess Knight  (Photograph by Steve A Johnson [Link to Steve Johnson ], CC 2.0)

Chess Knight (Photograph by Steve A Johnson [Link to Steve Johnson ], CC 2.0)

Posted in DisseminationFoSResearch at UNMC