Difference between revisions of "Andy Walker"

From Chessprogramming wiki
Jump to: navigation, search
 
Line 7: Line 7:
  
 
=Selected Publications=
 
=Selected Publications=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref>
+
<ref>[[ICGA Journal#RefDB|ICGA Reference Database]]</ref>
 
* [[Andy Walker|Andrew N. Walker]] ('''1984'''). ''Uniqueness in Game Trees''. [[ICGA Journal#7_4|ICCA Journal, Vol. 7, No. 4]]
 
* [[Andy Walker|Andrew N. Walker]] ('''1984'''). ''Uniqueness in Game Trees''. [[ICGA Journal#7_4|ICCA Journal, Vol. 7, No. 4]]
 
* [[Andy Walker|Andrew N. Walker]] ('''1989'''). ''Interactive Solution of King and Pawn Endings''. [[Advances in Computer Chess 5]]
 
* [[Andy Walker|Andrew N. Walker]] ('''1989'''). ''Interactive Solution of King and Pawn Endings''. [[Advances in Computer Chess 5]]

Latest revision as of 16:56, 16 November 2020

Home * People * Andy Walker

Andy Walker [1]

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

[8]

Forum Posts

External Links

References

Up one level