Location of Repository

Chess Endgames and Neural Networks

By Guy McCrossan Haworth and Meel Velliste

Abstract

The existence of endgame databases challenges us to extract higher-grade information and knowledge from their basic data content. Chess players, for example, would like simple and usable endgame theories if such holy grail exists: endgame experts would like to provide such insights and be inspired by computers to do so. Here, we investigate the use of artificial neural networks (NNs) to mine these databases and we report on a first use of NNs on KPK. The results encourage us to suggest further work on chess applications of neural networks and other data-mining techniques

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

Suggested articles

Preview

Citations

  1. (1977). A Quantitative Study of King and Pawn Against King.
  2. (1980). An Optimal Algorithm for King and Pawn against King using Pattern Knowledge.
  3. (1991). Artificial Intelligence. Second Edition.
  4. (1982). Automatic Induction of Classification Rules for a Chess Endgame.
  5. (1980). Chess with Computers.
  6. (1979). Discovering Rules by Induction from Large Collections of Examples.
  7. (1994). Endgame Databases of Optimal Play to Mate. At publication time, this was to be found on the World Wide Web with ftp://chess.onenet.net/pub/chess/TB/ ... KPK.tbs/tbb/tbw F├╝rnkranz,
  8. (1992). Engineering Reliable Neural Networks.
  9. (1966). Experiments in Induction.
  10. (1996). Hybrid Heuristic Search.
  11. (1982). Machine-Aided Refinement of Correct Strategies for the Endgame in Chess.
  12. (1990). Neural Computing: An Introduction.
  13. (1997). Neural Networks.
  14. (1969). Perceptrons, An Introduction to Computational Geometry. doi
  15. (1992). Practical Issues in Temporal Difference Learning. doi
  16. (1986). Retrograde Analysis of Certain Endgames.
  17. (1995). Secrets of Minor-Piece Endings.
  18. (1994). Secrets of Pawnless Endings.
  19. (1992). Secrets of Rook Endings.
  20. (1959). Some Studies in Machine Learning using the Game of Checkers. doi
  21. (1995). Statistical Feature Combination for the Evaluation of Game Positions.
  22. (1994). TD-Gammon, a Self-Teaching Backgammon Program, achieves Master-Level Play. doi
  23. (1995). Temporal Difference Learning and TD-Gammon. doi
  24. (1992). Temporal Difference Learning of Backgammon Strategy. doi
  25. (1980). The Construction of Economical and Correct Algorithms for King and Pawn against King.
  26. (1991). To Make Dumb Endgame Databases Speak.

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