Using chunks to categorise chess positions

Lane, P. C. & Gobet, F.ORCID logo (2012). Using chunks to categorise chess positions. In Bramer, M. & Petridis, M. (Eds.), Research and Development in Intelligent Systems XXIX: Incorporating Applications and Innovations in Intelligent Systems XX Proceedings of AI-2012, The Thirty-second SGAI International Conference on Innovative Techniques and Applications of Artificial Inte (pp. 93 - 106). Springer Berlin / Heidelberg. https://doi.org/10.1007/978-1-4471-4739-8_7
Copy

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.

Full text not available from this repository.

Export as

EndNote BibTeX Reference Manager Refer Atom Dublin Core JSON Multiline CSV
Export