Using chunks to categorise chess positions
Expert computer performances in domains such as chess are achieved by techniques different from those which can be used by a human expert. The match between Gary Kasparov and Deep Blue shows that human expertise is able to balance an eight-magnitude difference in computational speed. Theories of human expertise, in particular the chunking and template theories, provide detailed computational models of human long-term memory, how it is acquired and retrieved. We extend an implementation of the template theory, CHREST, to support the learning and retrieval of categorisations of chess positions. Our extended model provides equivalent performance to a support-vector machine in categorising chess positions by opening, and reveals how learning for retrieval relates to learning for content.
| Item Type | Chapter |
|---|---|
| Departments | CPNSS |
| DOI | 10.1007/978-1-4471-4739-8_7 |
| Date Deposited | 10 Dec 2019 11:42 |
| URI | https://researchonline.lse.ac.uk/id/eprint/102853 |
Explore Further
- http://www.scopus.com/inward/record.url?scp=84881508812&partnerID=8YFLogxK (Scopus publication)
- https://www.springer.com/gp (Publisher)
- https://www.springer.com/gp/book/9781447147381?wt_... (Official URL)