Chess endgame news

This note defines what it means by the 'chess endgame' and looks at the frequency of sub-n-man and 'FinalGen' positions in games and studies and in the FIDE 2013 World Cup. It includes the exposition of the DTM-minimaxing line from one of the three DTM-deepest known (KQPKRBN) positions. It refines the definitions of 'longest game' and 'bionic game'. The games of the FIDE 2013 World Cup and the longest known decisive game are available here.

Chess endgame records

This dataset is an evolving collection of chess endgame record scenarios illustrating the extremes of the game including the deepest positions in various metrics. Optimal lines in consonant strategies are given and annotated. The two attached files are (a) a pgn file of the chess positions and lines, and (b) an annotated version of the pgn file.

Chess Endgame News

This note includes some endgame reflections on the last World Chess Championship, an update on the search for the longest decisive games between computers, and a brief mention of the sets of endgame table (EGT) statistics recently received from Yakov Konoval (2013) and from Victor Zakharov (2013) for the Lomonosov team.

Chess Endgame News

This paper notes FIDE's 75-move rule (9.6b) and suggests some implications. It reviews two endgame-table initiatives associated with the 50-move rule. One is Huntington's mainly sub-6-man multi-valued DTM50 EGTs implemented in HASKELL. The other is Ronald de Man's WDL' and DTZ50' EGTs which introduce a 5-way evaluation of positions, and ascribe a depth to decisive positions which are not 50-move-rule wins or losses. There is also some first detail about the Lomonosov '7-man DTM EGT' team, and comments on reactions to 'Haworth's Law'.

Chess Endgame News

The DTZ metric indicates the minimaxed 'Depth To Zeroing of the ply-count' for decisive positions. Ronald de Man's DTZ50' metric is a variant of the DTZ metric as moderated by the FIDE 50-move draw-claim rule. DTZ50'-depths are given to '50-move-rule draws' as well as to unconditionally decisive positions. This note defines a two-dimensional taxonomy of positions implicitly defined by DTZ50'. 'Decisive' positions may have values of (wins/losses) v =1/-1 or v = 2/-2. A position's depth in the new DTZ50' metric may be greater than, equal to or less than its DTZ depth. The six parts of the taxonomy are examined in detail, and illustrated by some 40 positions and 16 lines. Positions, lines and the annotation of these lines are supplied in the ancillary data files.

Chess Endgame News

This note investigates the recently revived proposal that the stalemated side should lose, and comments further on the information provided by the FRITZ14 interface to Ronald de Man’s DTZ50' EGTs. The history of stalemate is convoluted, and there is an argument for computing chess endgame tables to revised rules to examine the impact of any change. The FRITZ14 interface to the DTZ50' EGTs exhibits residual 'one-out' and end-of-phase errors. Example positions are provided to illustrate the stalemate and the DTZ50' issues described.

Die Schwalbe Chess Study #16206

This study contains a maxDTM KRRPKQ position, the deepest known underpromotion and an echo of the famous Saavedra theme. The original problem and solution can be found in the attached files here.

Chess Endgame News

Newborn and Hyatt recently tested the chess-engine CRAFTY on two test sets of 16 positions each. The performance of an engine making greater use of endgame tables (EGTs) is compared with that of CRAFTY. Reference is made to three other articles in which composed positions have been used to test a variety of chess engines. Supporting data here comprises two pgn files, an annotated-pgn file and the original data worksheets used.

WCCC 2015: the 21st world computer chess championship

Nine chess programs competed in July 2015 in the ICGA's World Computer Chess Championship at the Computer Science department of Leiden University. This is the official report of the event.

WCSC 2015: the world chess software championship

This is the official report of the ICGA's 2015 World Chess Software Championship held in Leiden, The Netherlands.

Usabilidade de site e tecnologia wiki aplicadas ao jogo de xadrez no ambiente virtual =: Usability of site and wiki technology applied to the chess set in virtual environment

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

The dark side of the board: advances in chess Kriegspiel

While imperfect information games are an excellent model of real-world problems and tasks, they are often difficult for computer programs to play at a high level of proficiency, especially if they involve major uncertainty and a very large state space. Kriegspiel, a variant of chess making it similar to a wargame, is a perfect example: while the game was studied for decades from a game-theoretical viewpoint, it was only very recently that the first practical algorithms for playing it began to appear. This thesis presents, documents and tests a multi-sided effort towards making a strong Kriegspiel player, using heuristic searching, retrograde analysis and Monte Carlo tree search algorithms to achieve increasingly higher levels of play. The resulting program is currently the strongest computer player in the world and plays at an above-average human level.

Molecular computation: RNA solutions to chess problems

We have expanded the field of “DNA computers” to RNA and present a general approach for the solution of satisfiability problems. As an example, we consider a variant of the “Knight problem,” which asks generally what configurations of knights can one place on an n × n chess board such that no knight is attacking any other knight on the board. Using specific ribonuclease digestion to manipulate strands of a 10-bit binary RNA library, we developed a molecular algorithm and applied it to a 3 × 3 chessboard as a 9-bit instance of this problem. Here, the nine spaces on the board correspond to nine “bits” or placeholders in a combinatorial RNA library. We recovered a set of “winning” molecules that describe solutions to this problem.