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 have wriiten a number of articles for TheConversation
http://bit.ly/1yWlOkE
I am the chair of the MISTA (Multidisciplinary International Conference on Scheduling: Theory and Applications)
http://bit.ly/hvZIaN

Latest Blog Post

How Isaac Newton could help you beat the casino at roulette

Random Blog Post

Geocoding: Trials and Tribulations

Publication(s)

The Scalability of Evolved On Line Bin Packing Heuristics
http://bit.ly/eVBJTd
Sports Scheduling: Minimizing Travel for English Football Supporters
http://bit.ly/19JwmYd
General Video Game Playing
http://bit.ly/1a2Vjvz
A Game Theoretic Approach for Taxi Scheduling Problem with Street Hailing
http://bit.ly/1hBsesZ

Graham Kendall: Details of Requested Publication


Citation

Al-Khateeb, B and Kendall, G Effect of Look-Ahead Depth in Evolutionary Checkers. Journal of Computer Science and Technology, 27 (5): 996-1006, 2012.


Abstract

It is intuitive that allowing a deeper search into a game tree will result in a superior player to one that is restricted in the depth of the search that it is allowed to make. Of course, searching deeper into the tree comes at increased computational cost and this is one of the trade-offs that has to be considered in developing a tree-based search algorithm. There has been some discussion as to whether the evaluation function, or the depth of the search, is the main contributory factor in the performance of an evolved checkers player. Some previous research has investigated this question (on Chess and Othello), with differing conclusions. This suggests that different games have different emphases, with respect to these two factors. This paper provides the evidence for evolutionary checkers, and shows that the look-ahead depth (like Chess, perhaps unsurprisingly) is important. This is the first time that such an intensive study has been carried out for evolutionary checkers and given the evidence provided for Chess and Othello this is an important study that provides the evidence for another game. We arrived at our conclusion by evolving various checkers players at different ply depths and by playing them against one another, again at different ply depths. This was combined with the two-move ballot (enabling more games against the evolved players to take place) which provides strong evidence that depth of the look-ahead is important for evolved checkers players.


pdf

You can download the pdf of this publication from here


doi

The doi for this publication is 10.1007/s11390-012-1280-6 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


Journal Rankings


ISI Web of Knowledge Journal Citation Reports

The Web of Knowledge Journal Citation Reports (often known as ISI Impact Factors) help measure how often an article is cited. You can get an introduction to Journal Citation Reports here. Below I have provided the ISI impact factor for the jourrnal in which this article was published. For complete information I have shown the ISI ranking over a number of years, with the latest ranking highlighted.

2014 (0.672), 2013 (0.642), 2012 (0.477), 2011 (0.564), 2010 (0.656)

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

@ARTICLE{ak2012a, author = {B. Al-Khateeb and G. Kendall},
title = {Effect of Look-Ahead Depth in Evolutionary Checkers},
journal = {Journal of Computer Science and Technology},
year = {2012},
volume = {27},
pages = {996--1006},
number = {5},
abstract = {It is intuitive that allowing a deeper search into a game tree will result in a superior player to one that is restricted in the depth of the search that it is allowed to make. Of course, searching deeper into the tree comes at increased computational cost and this is one of the trade-offs that has to be considered in developing a tree-based search algorithm. There has been some discussion as to whether the evaluation function, or the depth of the search, is the main contributory factor in the performance of an evolved checkers player. Some previous research has investigated this question (on Chess and Othello), with differing conclusions. This suggests that different games have different emphases, with respect to these two factors. This paper provides the evidence for evolutionary checkers, and shows that the look-ahead depth (like Chess, perhaps unsurprisingly) is important. This is the first time that such an intensive study has been carried out for evolutionary checkers and given the evidence provided for Chess and Othello this is an important study that provides the evidence for another game. We arrived at our conclusion by evolving various checkers players at different ply depths and by playing them against one another, again at different ply depths. This was combined with the two-move ballot (enabling more games against the evolved players to take place) which provides strong evidence that depth of the look-ahead is important for evolved checkers players.},
doi = {10.1007/s11390-012-1280-6},
issn = {1000-9000},
keywords = {Checkers, Evolutionary Algorithm, Blondie24, Games},
owner = {gxk},
timestamp = {2012.12.17},
webpdf = {http://www.graham-kendall.com/papers/ak2012a.pdf} }