This paper compares four current theories of expertise with respect to chess players' memory: Chase and Simon's chunking theory, Holding's SEEK theory, Ericsson and Kintsch's long-term working memory theory, and Gobet and Simon's template theory (Chase, W.G., Simon, H.A., 1973a. Perception in chess. Cognitive Psychology 4, 55-81; Holding, D.H., 1985. The Psychology of Chess Skill. Erlbaum, Hill...

We apply genetic programming to the evolution of strategies for playing chess endgames. Our evolved programs are able to draw or win against an expert human-based strategy, and draw against CRAFTY—a world-class chess program, which finished second in the 2004 Computer Chess Championship.

The increasing strength of chess engines and their fine-tuned ability to evaluate positions provide the opportunity to use computer analysis for assessing the strength of players on a move-by-move basis, as a game is being played. As each player makes a move on the board, a sufficiently strong engine will be able to determine whether that move has contributed to improve or degrade the position....

The complexity of chess matches has attracted broad interest since its invention. This complexity and the availability of large number of recorded matches make chess an ideal model systems for the study of population-level learning of a complex system. We systematically investigate the move-by-move dynamics of the white player's advantage from over seventy thousand high level chess matches span...

Expertise researchers have traditionally shied away from studying the highest levels of achievement in favor of studying basic cognitive processes, such as memory and categorization. In this article, we present a different approach that is focused on capturing superior (expert) performance on representative tasks that reveal the essential characteristics of expertise in a given domain. In domai...

We explain how the prototype automatic chess problem composer, Chesthetica, successfully composed a rare and interesting chess problem using the new Digital Synaptic Neural Substrate (DSNS) computational creativity approach. This problem represents a greater challenge from a creative standpoint because the checkmate is not always clear and the method of winning even less so. Creating a decisive...

Proof-number search (pn-search) has shown its merit in contributing to the solution of Connect-Four, Qubic and Go-Moku. In this contribution we show that pn-search is a highly capable searcher for mates in chess. Pn-search achieves its results without using any heuristic chess knowledge. We present the results of comparing the performances of pn-search and a number of other mate searchers on a ...

Linguistic Geometry (LG) is a type of game theory for extensive discrete games scalable to the level of real life defense systems. LG was developed by generalizing experiences of the advanced chess players. In this paper we summarize experiences of highly successful application of LG to a diverse set of board games and military operations. We believe that LG has a more fundamental nature than s...

The papers that Bill Chase wrote on skill in chess (with Herb Simon) and in the digitspan task (with Anders Ericsson) count among the most influential publications in the literature on expertise. Yet, the data discussed in these papers are based on the results of very few subjects, whose performance is essentially analyzed as case studies. In this chapter, I argue that case studies and individu...

Consider the problem of ranking social alternatives based on the number of voters that prefer one alternative to the other. Or consider the problem of ranking chess players by their past performance. A wide variety of ranking methods have been proposed to deal with these problems. Using six independent axioms, we characterize the fair-bets ranking method proposed by Daniels [4] and Moon and Pul...