Graham Kendall
Various Images

Professor Graham Kendall

Professor Graham Kendall is the Provost and CEO of The University of Nottingham Malaysia Campus (UNMC). He is also a Pro-Vice Chancellor of the University of Nottingham.

He is a Director of MyResearch Sdn Bhd, Crops for the Future Sdn Bhd. and Nottingham Green Technologies Sdn Bhd. He is a Fellow of the British Computer Society (FBCS) and a Fellow of the Operational Research Society (FORS).

He has published over 230 peer reviewed papers. He is an Associate Editor of 10 journals and the Editor-in-Chief of the IEEE Transactions of Computational Intelligence and AI in Games.

News

I am a member of the Automated Scheduling, Optimisation and Planning Research Group
http://bit.ly/eIQ5XC
I blog occasionally, feel free to take a look.
http://bit.ly/hq6rMK

Latest Blog Post

Snooker: Celebrating 40 years at the Crucible

Random Blog Post

Is typesetting this difficult?

Publication(s)

A Multi-objective Hyper-heuristic based on Choice Function
http://bit.ly/1f8GQgU
Handling diversity in evolutionary multiobjective optimization
http://bit.ly/hN8VPE
A New Approach to Packing Non-Convex Polygons Using the No Fit Polygon and Meta-Heuristic and Evolutionary Algorithms
http://bit.ly/eMYCKs
Collective Behavior and Kin Selection in Evolutionary IPD
http://bit.ly/if34nF

Graham Kendall: Details of Requested Publication


Citation

Hingston, P and Kendall, G Enumerating knight's tours using an ant colony algorithm. In Proceedings of the 2005 IEEE Congress on Evolutionary Computation, pages 1003-1010, 2005.


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 55 and 66 boards, and, while the number of tours on an 88 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.


pdf

You can download the pdf of this publication from here


doi

The doi for this publication is 10.1109/CEC.2005.1554800 You can link directly to the original paper, via the doi, from here

What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information



URL

This pubication does not have a URL associated with it.

The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.


Bibtex

@INPROCEEDINGS{hk2005, author = {P. Hingston and G. Kendall},
title = {Enumerating knight's tours using an ant colony algorithm},
booktitle = {Proceedings of the 2005 IEEE Congress on Evolutionary Computation},
year = {2005},
pages = {1003--1010},
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 55 and 66 boards, and, while the number of tours on an 88 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},
keywords = {games, chess, knight's tour, knights tournament, ACO, ant colony optimisation},
owner = {gxk},
timestamp = {2011.01.02},
webpdf = {http://www.graham-kendall.com/papers/hk2005.pdf} }