DocumentCode
2728119
Title
Enumerating knight´s tours using an ant colony algorithm
Author
Hingston, Philip ; Kendall, Graham
Author_Institution
Edith Cowan Univ., Australia
Volume
2
fYear
2005
fDate
2-5 Sept. 2005
Firstpage
1003
Abstract
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 all tours on 5×5 and 6×6 boards, and, while the number of tours on an 8×8 board is too large for a full enumeration, our experiments suggest that the algorithm is able to uniformly sample tours at a constant, fast rate for as long as is desired.
Keywords
game theory; optimisation; ant colony optimisation; chessboard; knight tours; Ant colony optimization; Australia; Circuits; Genetic algorithms; History; Lagrangian functions; Law; Legal factors; Mathematical analysis; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2005. The 2005 IEEE Congress on
Print_ISBN
0-7803-9363-5
Type
conf
DOI
10.1109/CEC.2005.1554800
Filename
1554800
Link To Document