Changes

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>.