In this paper, we quantify the non-transitivity in chess using human game data. Specifically, perform quantification two ways—Nash clustering and counting number of rock–paper–scissor cycles—on over one billion matches from Lichess FICS databases. Our findings indicate that strategy space real-world strategies has a spinning top geometry there exists strong connection between degree progression...

Automatically recognizing and analyzing visual activities in complex environments is a challenging and open-ended problem. In this thesis this problem domain is visited in a chess game scenario where the rules, actions and the environment are well defined. The purpose here is to detect and observe a FIDE (Fédération International des Échecs) compatible chess board and to generate a log file of ...

There is a crucial debate concerning the nature of chess chunks: One current possibility states that chunks are built by encoding particular combinations of pieces-on-squares (POSs), and that chunks are formed mostly by "close" pieces (in a "Euclidean" sense). A complementary hypothesis is that chunks are encoded by abstract, semantic information. This article extends recent experiments and sho...

A popular explanation for the small number of women at the top level of intellectually demanding activities from chess to science appeals to biological differences in the intellectual abilities of men and women. An alternative explanation is that the extreme values in a large sample are likely to be greater than those in a small one. Although the performance of the 100 best German male chess pl...

We describe a preliminary investigation into learning a Chess player’s style from game records. The method is based on attempting to learn features of a player’s individual evaluation function using the method of temporal differences, with the aid of a conventional Chess engine architecture. Some encouraging results were obtained in learning the styles of two recent Chess world champions, and w...

Novice, intermediate, and expert chess players of various ages, playing with two chess pieces on a quarter-section of a chessboard, performed a simple task to detect that the king is in check or is threatened with being in check. Age slowed response for both tasks. An interaction of task and skill revealed differences in diminishing response time between check and threat tasks as skill increase...

Qualitative approaches to cognitive rigor and depth and complexity are broadly represented by Webb’s Depth of Knowledge and Bloom’s Taxonomy. Quantitative approaches have been relatively scant, and some have been based on ancillary measures such as the thinking time expended to answer test items. In competitive chess and other games amenable to incremental search and expert evaluation of option...

In this article, we explain a new chess variant that is more challenging for humans than the standard version of the game. A new rule states that either player has the right to switch sides if a ‘chain’ or link of pieces is created on the board. This appears to increase significantly the complexity of chess, as perceived by players, but not the actual size of its game tree. ‘Search’ therefore b...

In this paper we describe game-independent strategies, capable of learning explanation patterns (XPs) for evaluation of any basic game pattern. A basic game pattern is defined as a minimal configuration of a small number of pieces and squares which describes only one salient game feature. Each basic pattern can be evaluated by a suitable XP. We have developed five gameindependent strategies (re...

Consider the chess game: When faced with a complex scenario, how does understanding arise in one’s mind? How does one integrate disparate cues into a global, meaningful whole? How do players avoid the combinatorial explosion? How are abstract ideas represented? The purpose of this paper is to propose a new computational model of human chess cognition. We suggest that analogies and abstract role...