Document Type
Conference Proceeding
Publisher
IEEE
Faculty
Faculty of Computing, Health and Science
School
School of Computer and Information Science
RAS ID
3902
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.
DOI
10.1109/CEC.2005.1554800
Access Rights
free_to_read
Comments
This is an Author's Accepted Manuscript of: Hingston, P. F., & Kendall, G. (2005). Enumerating Knight's Tours using an Ant Colony Algorithm. Proceedings of IEEE Congress on Evolutionary Computation. (pp. 1003-1010). Edinburgh, Scotland. IEEE. Available here
© 2005 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.