Difference between revisions of "Andy Walker"
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...") |
GerdIsenberg (talk | contribs) |
||
Line 4: | Line 4: | ||
'''Andrew N. (Andy) Walker''',<br/> | '''Andrew N. (Andy) Walker''',<br/> | ||
− | a British mathematician and computer scientist, affiliated with the School of Mathematical Sciences, [https://en.wikipedia.org/wiki/University_of_Nottingham University of Nottingham] <ref>[https://www.nottingham.ac.uk/ComputerScience/About/History.aspx History - The University of Nottingham]</ref>, with research interests in game theory and as a chess player <ref>[https://www.nottschess.org/ Nottinghamshire Chess Association - Home]</ref>, in computer chess. He published in the [[ICGA Journal]], lectured at two [[Conferences#AdvancesinComputerChess|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 <ref>[[Don Beal]] ('''1993'''). ''Report on the [[UPCCC 1993|QMW 1993 Uniform-Platform Computer Chess Championship]]''. [[ICGA Journal#16_3|ICCA Journal, Vol. 16, No. 3]]</ref> <ref>[https://groups.google.com/d/msg/rec.games.chess/USZ-JlNvqRI/Yn68mNr08xAJ QMW computer chess] by [[Don Beal]], [[Computer Chess Forums|rgc]], August 19, 1993</ref>. | + | a British mathematician and computer scientist, affiliated with the School of Mathematical Sciences, [https://en.wikipedia.org/wiki/University_of_Nottingham University of Nottingham] <ref>[https://www.nottingham.ac.uk/ComputerScience/About/History.aspx History - The University of Nottingham]</ref>, with research interests in game theory and as a chess player <ref>[https://www.nottschess.org/ Nottinghamshire Chess Association - Home]</ref>, in computer chess. He published in the [[ICGA Journal]] on [[Search|search algorithms]] to [[Chess Problems, Compositions and Studies|solve certain chess problems]] - in particular [https://en.wikipedia.org/wiki/Helpmate helpmates] and series-helpmates <ref>[[Andy Walker|Andrew N. Walker]] ('''1984'''). ''Uniqueness in Game Trees''. [[ICGA Journal#7_4|ICCA Journal, Vol. 7, No. 4]]</ref>, and on search heuristics in the KQKR endgame <ref>[[Andy Walker|Andrew N. Walker]] ('''1996'''). ''Hybrid Heuristic Search''. [[ICGA Journal#19_1|ICCA Journal, Vol. 19, No. 1]]</ref>, lectured at two [[Conferences#AdvancesinComputerChess|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 <ref>[[Don Beal]] ('''1993'''). ''Report on the [[UPCCC 1993|QMW 1993 Uniform-Platform Computer Chess Championship]]''. [[ICGA Journal#16_3|ICCA Journal, Vol. 16, No. 3]]</ref> <ref>[https://groups.google.com/d/msg/rec.games.chess/USZ-JlNvqRI/Yn68mNr08xAJ QMW computer chess] by [[Don Beal]], [[Computer Chess Forums|rgc]], August 19, 1993</ref>. |
=Selected Publications= | =Selected Publications= |
Revision as of 16:37, 12 July 2019
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 on search algorithms to solve certain chess problems - in particular helpmates and series-helpmates [4], and on search heuristics in the KQKR endgame [5], 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 [6] [7].
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
- ↑ Dr A. N. Walker's Home Page (Wayback Machine)
- ↑ History - The University of Nottingham
- ↑ Nottinghamshire Chess Association - Home
- ↑ Andrew N. Walker (1984). Uniqueness in Game Trees. ICCA Journal, Vol. 7, No. 4
- ↑ Andrew N. Walker (1996). Hybrid Heuristic Search. ICCA Journal, Vol. 19, No. 1
- ↑ 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)