A Chess Program That Chunks

Campbell, Murray; Berliner, Hans J.

A Chess Program That Chunks

AAAI 1983 pp. 49-53

/aaai/1983/campbell1983aaai-chess/

Abstract

CHUNKHR is a chess program that uses chunked knowledge to achieve success. Its domain is a subset of king and pawn endings in chess that has been studied for over 300 years. CHUNKHR has a large library of chunk instances where each chunk type has a property list and each instance has a set of values for these properties. This allows CHUNKHR to reason about positions that come up in the search that would otherwise have to handled by means of additional search. Thus the program is able to solve die most difficult problem of its present domain (a problem that would require 45 ply of search and on the order of 10l3 years of CPU time to be solved by the best of present day chess programs) in 18 ply and one minute of CPU time. Further, CHLINKER is undoubtedly the world's foremost expert in its domain, and has discovered 2 mistakes in the literature and has been instrumental in discovering a new theorem about the domain that allows the assessing of positions with a new degree of ease and confidence. In this paper we describe CHUNKER's structure and performance, and discuss our plans for extending it to play the whole domain of king and pawn endings.1

PDF AAAI Semantic Scholar

Cite

Text

Campbell and Berliner. "A Chess Program That Chunks." AAAI Conference on Artificial Intelligence, 1983.

Markdown

[Campbell and Berliner. "A Chess Program That Chunks." AAAI Conference on Artificial Intelligence, 1983.](https://mlanthology.org/aaai/1983/campbell1983aaai-chess/)

BibTeX

@inproceedings{campbell1983aaai-chess,
  title     = {{A Chess Program That Chunks}},
  author    = {Campbell, Murray and Berliner, Hans J.},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {1983},
  pages     = {49-53},
  url       = {https://mlanthology.org/aaai/1983/campbell1983aaai-chess/}
}