Andy Walker

Home * People * Andy Walker



Andrew N. (Andy) Walker, a British mathematician and computer scientist, affiliated with the School of Mathematical Sciences, University of Nottingham, with research interests in game theory and as a chess player , in computer chess. He published in the ICGA Journal on search algorithms to solve certain chess problems - in particular helpmates and series-helpmates, and on search heuristics in the KQKR endgame , lectured at two Advances in Computer Chess conferences, and is author of the didactic chess program NotChess, written in C and originated as a simple program to help teach university students taking a game theory course.

=Selected Publications=
 * Andrew N. Walker (1984). Uniqueness in Game Trees. ICCA Journal, Vol. 7, No. 4
 * Andrew N. Walker (1989). Interactive Solution of King and Pawn Endings. Advances in Computer Chess 5
 * Andrew N. Walker (1996). Hybrid Heuristic Search. ICCA Journal, Vol. 19, No. 1
 * S. D. Milner, Andrew N. Walker (1997). Heuristics and Loops in KQKR. Advances in Computer Chess 8

=Forum Posts=
 * Re: Computer Chess (LONG) by Andy Walker, rgc, September 16, 1993
 * New(?) search idea by Andrew Walker, CCC, January 21, 1998
 * Re: Whatever happened to Neural Network Chess programs? by Andy Walker, rgcc, March 28, 2000 » Advances in Computer Chess 1, Ron Atkin

=External Links=
 * Dr A. N. Walker's Home Page (Wayback Machine)
 * G13GAM -- Game Theory -- computer chess notes by Andy Walker (Wayback Machine)
 * The chess games of Andrew N Walker from chessgames.com
 * Nottinghamshire Chess Association - Home

=References= Up one level