Downloads

[1] R. Andrist. http://www.geocities.com/rba_schach2000/. WILHELM download, 2004. [2] M. Bourzutschky. Private communication of generalized EGT-management code, 2003. [3] D.M. Breuker, L.V. Allis, H.J. van den Herik, I.S.Herschberg. A Database as a Second., ICCA Journal 15 (1) (1992) 28-39. [4] W. Feller. An Introduction to Probability Theory and its Applications, Vol. 1. Wiley, 1968. ISBN 0-4712-5708-7. [5] C.J. Fenner. Computer Chess, News about the North American Computer Chess Championship, The British Chess Magazine 99 (5) (1979) 193-200. [6] G.McC Haworth. Reference Fallible Endgame Play, in: J.W.H.M. Uiterwijk (Ed.), Proceedings of the Seventh Computer Olympiad Computer-Games Workshop, Maastricht, Report CS-02-03, 2003. [7] G.McC Haworth. Reference Fallible Endgame Play, ICGA Journal 26 (2) (2003) 81-91. [8] G.McC Haworth, R.B. Andrist. Model Endgame Analysis, in: H.J. van den Herik, H. Iida, and E.A. Heinz (Eds.), Advances in Computer Games 10, Kluwer Academic Publishers, Norwell, MA, 2003, pp. 65-79. ISBN 1-4020-7709-2. [9] P.J. Jansen. KQKR: Awareness of a Fallible Opponent, ICCA Journal 15 (3) (1992) 111-131. [10] D. Levy, M. Newborn. How Computers Play Chess, esp. pp. 144-148, 1991. [11] A.J. Roycroft. Expert against the Oracle, in: J.E. Hayes, D. Michie and J. Richards (Eds), Machine Intelligence 11, Oxford University Press, Oxford, 1988, pp. 347-373. [12] J. Tamplin, J. Private communication of some pawnless Nalimov-compatible DTC EGTs, 2001.