Deepest Chess Win Revisited

Downloads

Barbier, G.E. (1895). The Barbier-Saavedra study. Glasgow Weekly Citizen, 4th & 18th May. Barth, W. (1995a). Combining Knowledge and Search to Yield Infallible Endgame Programs. A Study of Passed Pawns in the KPKP Endgame. ICCA Journal, Vol. 18, No. 3, pp. 149-159. y Barth, W. (1995b). The KPKP Endgame: An Amplification. ICCA Journal, Vol. 18, No. 4, pp. 225-226. Edwards, S.J. (1995). Comments on Barth’s Article “Combining Knowledge and Search to Yield Infallible End-game Programs.” ICCA Journal, Vol. 18, No. 4, p. 219-225. Haworth, G.McC. (2000). Strategies for Constrained Optimisation. ICGA Journal, Vol. 23, No. 1, pp. 9-20. Hyatt, R. (2000). ftp://ftp.cis.uab.edu/pub/hyatt/TB/. Server providing Nalimov’s EG DTM statistics and tables. Lincke, T. (2000). http://nobi.inf.ethz.ch/games/chess. Browser for 3-to-5-man DTC EGTs. Nalimov, E., Wirth, C. and Haworth, G.McC. (1999). KQQKQQ and the Kasparov-World Game. ICCA Journal, Vol. 22, No. 4, pp. 195-212. Pope A. (1733-1734). An Essay on Man, Epistle I. Dover Publications (1994). ISBN 0-4862-8053-5. Roycroft, A.J. (2000). Private communication to the ICGA J editor. Stiller, L.B. (1996). Multilinear Algebra and Chess Endgames. Games of No Chance (ed. R.J. Nowakowski), pp. 151-192. MSRI Publications, Vol. 29, CUP, Cambridge, England. ISBN 0-521-64652-9. Tamplin, J. (2000). http://chess.liveonthenet.com/chess/endings/index.shtml. Position evaluations via Nalimov’s 3-to-6-man DTM EGTs. Thompson, K. (1999). Thompson, K. (2000). http://cm.bell-labs.com/cm/cs/who/ken/chesseg.html. 6-man EGT maximal positions, maximal mutual zugzwangs and endgame statistics. Thompson, K. (2000). The Longest: KRNKNN in 262. ICGA Journal, Vol. 23, No. 1, pp. 35-36.