Monday, 3 February 2014

How to Get Ants to Solve a Chess Problem (Op-Ed)

By Graham Kendall, University of Nottingham | January 31, 2014 02:14pm ET

This article was originally published at The Conversation.The publication contributed the article to LiveScience's Expert Voices: Op-Ed & Insights.

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? As a reminder, a knight can move two squares in a straight line, followed by a ninety degree turn and a move of one further square. It might seem like a hard task, but this set of moves, called the knight’s tour, can be achieved in too many ways to count.

No comments:

Post a Comment

You only need to enter your comment once! Comments will appear once they have been moderated. This is so as to stop the would-be comedian who has been spamming the comments here with inane and often offensive remarks. You know who you are!

Related Posts with Thumbnails