Andy Walker
Revision as of 16:16, 12 July 2019 by GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Andy Walker''' FILE:anwalker.jpg|border|right|thumb| Andy Walker <ref>[http://web.archive.org/web/20070123032705/http://www.maths.nott...")
Andrew N. (Andy) Walker,
a British mathematician and computer scientist, affiliated with the School of Mathematical Sciences, University of Nottingham [2], with research interests in game theory and as a chess player [3], in computer chess. He published in the ICGA Journal, 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 [4] [5].
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
References
- ↑ Dr A. N. Walker's Home Page (Wayback Machine)
- ↑ History - The University of Nottingham
- ↑ Nottinghamshire Chess Association - Home
- ↑ Don Beal (1993). Report on the QMW 1993 Uniform-Platform Computer Chess Championship. ICCA Journal, Vol. 16, No. 3
- ↑ QMW computer chess by Don Beal, rgc, August 19, 1993
- ↑ ICGA Reference Database (pdf)