Location of Repository

Deepest Chess Win Revisited

By Guy McCrossan Haworth

Abstract

An examination of the deepest win in KRNKNN in the context of Ken Thompson's results

Publisher: The International Computer Games Association
Year: 2000
OAI identifier: oai:centaur.reading.ac.uk:4567

Suggested articles

Preview

Citations

  1. (1733). An Essay on Man, Epistle I.
  2. (1995). Comments on Barth’s Article “Combining Knowledge and Search to Yield Infallible Endgame Programs.”
  3. (2000). ftp://ftp.cis.uab.edu/pub/hyatt/TB/. Server providing Nalimov’s EG DTM statistics and tables.
  4. (2000). http://chess.liveonthenet.com/chess/endings/index.shtml. Position evaluations via Nalimov’s 3-to-6-man DTM EGTs.
  5. (2000). http://nobi.inf.ethz.ch/games/chess. Browser for 3-to-5-man DTC EGTs.
  6. (1996). Multilinear Algebra and Chess Endgames. Games of No Chance
  7. (2000). Private communication to the ICGA
  8. (2000). Strategies for Constrained Optimisation.
  9. (1995). The Barbier-Saavedra study. Glasgow Weekly Citizen,
  10. (1995). The KPKP Endgame: An Amplification.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.