Reference fallible endgame play

Downloads

Andrist, R. (2002). http://www.geocities.com/rba_schach2000/. Donkers, H.H.L.M., Uiterwijk, J.W.H.M. and Herik, H.J. van den. (2001). Probabilistic opponent-model search. Information Sciences, Vol. 135, Nos. 3-4, pp. 123-149. ISSN 1069-0115. Fenner, C.J. (1979). Computer Chess, News about the North American Computer Chess Championship. The British Chess Magazine, Vol. 99, No. 5, pp. 193-200. ISSN 0007-0440. Haworth, G.McC. (2000). Strategies for Constrained Optimisation. ICGA Journal, Vol. 23, No. 1, pp. 9-20. Haworth, G.McC. (2001). Depth by The Rule. ICGA Journal, Vol. 24, No. 3, p. 160. Jansen, P.J. (1992a). KQKR: Awareness of a Fallible Opponent. ICCA Journal, Vol. 15, No. 3, pp. 111-131. ISSN 1389-6911. Jansen, P.J. (1992b). KQKR: Assessing the Utility of Heuristics. ICCA Journal, Vol. 15, No. 4, pp. 179-191. Jansen, P.J. (1993). KQKR: Speculatively Thwarting a Human Opponent. ICCA Journal, Vol. 16, No. 1, pp. 3-17. Krabbé, T. (2002). http://www.xs4all.nl/~timkr/chess2/resigntxt.htm. “The Ultimate Blunder”. Levy, D.N.L. (1987). Improving the Performance of Endgame Databases. ICCA Journal, Vol. 10, No. 4, pp. 191-192. Levy, D.N.L. (1991). First among equals. ICCA Journal, Vol. 14, No. 3, p. 142. Levy, D. and Newborn, M. (1991). How Computers Play Chess, esp. pp. 144-148. Nunn, J. (2002). Secrets of Pawnless Ending, 2nd Edition, esp. pp. 9, 49, 173, 300 and 330. Gambit. ISBN 1-9019-8365-X. Schaeffer, J. (1991). Checkers: a Preview of What will Happen to Chess? ICCA Journal, Vol. 71, No. 2, pp. 71-78. Schaeffer, J. (1997). One Jump Ahead: Challenging Human Supremacy in Checkers, esp. p. 375. Springer-Verlag, New York, N.Y. ISBN 0-3879-4930-5. Tamplin, J. (2001). Private communication of some pawnless Nalimov-compatible DTC EGTs.