Document Type

Conference Proceeding

Publisher

IEEE

Faculty

Computing, Health and Science

School

School of Computer and Information Science

RAS ID

3902

Comments

This conference paper was originally published as: 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. Original article available here

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

 
COinS
 

Link to publisher version (DOI)

10.1109/CEC.2005.1554800