Gentlemen, stop your engines!
Haworth, G. M. (2007) Gentlemen, stop your engines! ICGA Journal, 30 (3). pp. 150-156. ISSN 1389-6911
For fifty years, computer chess has pursued an original goal of Artificial Intelligence, to produce a chess-engine to compete at the highest level. The goal has arguably been achieved, but that success has made it harder to answer questions about the relative playing strengths of man and machine. The proposal here is to approach such questions in a counter-intuitive way, handicapping or stopping-down chess engines so that they play less well. The intrinsic lack of man-machine games may be side-stepped by analysing existing games to place computer engines as accurately as possible on the FIDE ELO scale of human play. Move-sequences may also be assessed for likelihood if computer-assisted cheating is suspected.
Andrist, R.B. and Haworth, G.McC. (2005). Deeper model endgame analysis. Theoretical Computer Science, Vol. 349 Issue 2, pp. 158-167. ISSN 0304-3975. Beal, D.F. (1999). The Nature of Minimax Search. Ph.D. thesis, University of Maastricht. Bourzutschky, M.S., Tamplin, J.A. and Haworth, G.McC. (2005). Chess endgames: 6-man data and strategy. Theoretical Computer Science, Vol. 349 Issue 2, pp. 140-157. Friedel, F. (2001). Cheating in Chess. Advances in Computer Games 9 (ed. H.J.van den Herik amd B. Monien), pp.327-346. Universiteit Maastricht. Guid M. and Bratko, I. (2006). Computer Analysis of World Chess Champions. ICGA Journal, Vol. 29, No. 2, pp.65-73. ISSN 1389-6911. Guid, M., Pérez, A. and Bratko, I. (2007). How Trustworthy is Crafty’s Analysis of Chess Champions? Computer Games Workshop 2007 (CGW 2007), (eds. H.J. van den Herik, J.W.H.M. Uiterwijk, M.H.M. Winands, and M.P.D. Schadd), pp. 15-26. Haworth, G.McC. (2002). Reference Fallible Endgame Play. ICGA Journal, Vol. 26, No. 2, pp. 81-91. Haworth, G.McC. (2005). Chess Endgame News. ICGA Journal, Vol. 28, No. 4, p.243. Haworth, G.McC. and Andrist, R.B. (2003). Model Endgame Analysis. Advances in Computer Games 10, Graz, Austria (eds. H.J.van den Herik, H. Iida and E.A. Heinz), pp. 65-79. Kluwer Academic Publishers, Norwell, MA. ISBN 1-4020-7709-2. Jansen, P.J. (1992a). KQKR: Awareness of a Fallible Opponent. ICCA Journal, Vol. 15, No. 3, pp. 111-131. Jansen, P.J. (1992b). KQKR: Assessing the Utility of Heuristics. ICCA Journal, Vol. 15, No. 4, pp. 179-191. Jansen, P.J. (1993). KQKR: Speculatively Thwarting a Human Opponent. ICCA Journal, Vol. 16, No. 1, pp. 3- 17. Jeffreys, H. (1961). Theory of Probability. 3rd Edition, esp. Ch. 4, p193. Oxford University Press. Most recently republished (1998) with ISBN 0-1985-0368-7. McKinnon, K. (2007). Private Communication. Moor, J. (2006). http://www.dartmouth.edu/~ai50/homepage.html. The ai@50 Conference. Regan, K.W. (2007). http://www.cse.buffalo.edu/~regan/chess/fidelity/ Measuring Fidelity to a Computer Agent. Riis, S. (2006). http://www.chessbase.com/newsdetail.asp?newsid=3465. Critique of Guid and Bratko (2006). Tamplin, J.A. and Haworth, G.McC. (2003). Chess Endgames: Data and Strategy. Advances in Computer Games 10, Graz, Austria (eds. H.J.van den Herik, H. Iida and E.A. Heinz), pp. 81-96. Kluwer Academic Publishers, Norwell, MA. ISBN 1-4020-7709-2.
Repository Staff Only: item control page