2 search results - page 1 / 1 » Ant Colonies Discover Knight's Tours |
AUSAI
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we introduce an Ant Colony Optimisation (ACO) algorithm to find solutions for the well-known Knight’s Tour problem. The algorithm utilizes the implicit parallelism ...
CEC
2005
IEEE
13 years 10 months ago
2005
IEEE
In this paper we show how an ant colony optimisation algorithm may be used to enumerate knight’s tours for variously sized chessboards. We have used the algorithm to enumerate al...