Remove all the pieces from a chess board except for one knight. Then try
to move the knight across all 64 squares of the board, touching each
once. This so-called 'knight's tour' is very difficult to achieve for a
single person, but mathematicians have calculated that there are a
mind-boggling number of ways to pull it off.
Searching for new solutions to the
knight's tour,
University of Nottingham computer scientist Graham Kendall and a
colleague turned to simulated ants. They used the ant colony
optimization algorithm, a swarm intelligence technique based on the
behavior of ants looking to find a path between their colony and a food
source.
No comments:
Post a Comment