Andrew N. (Andy) Walker, a British mathematician and computer scientist, affiliated with the School of Mathematical Sciences, University of Nottingham [1], with research interests in game theory and computer chess. He 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 [2][3].
Andy Walker [4]

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 and 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)
• Nottinghamshire Chess Association - Information

References

1. ^ History - The University of Nottingham
2. ^ Don Beal (1993). Report on the QMW 1993 Uniform-Platform Computer Chess Championship. ICCA Journal, Vol. 16, No. 3
3. ^ QMW computer chess by Don Beal, rec.games.chess, August 19, 1993
4. ^ Dr A. N. Walker's Home Page (Wayback Machine)
5. ^ ICGA Reference Database (pdf)

What links here?