1,000 research outputs found
Chess endgame update
This is a review of progress in the Chess Endgame field. It includes news of the promulgation of Endgame Tables, their use, non-use and potential runtime creation. It includes news of data-mining achievements related to 7-man chess and to the field of Chess Studies. It includes news of an algorithm to create Endgame Tables for variants of the normal game of chess
Chess endgame news
The Endgame Tables Online initiative and p2p community have made available all published Nalimov DTM EGTs. It now looks forward to the 16 unpublished EGTs computed by August 9th and presumed to be still in existence, particularly as Marc Bourzutschky’s FEG results independently confirm all Nalimov’s published 3-3p DTM EGT statistics including those for KPPKPP
Chess endgame news
Reports the availability on the web of the entire run of Beasley's 'British Endgame Study News', and reviews a recent report by Bourzutschky and Konoval on their discoveries with 7-man endgame tables
Chess endgame news
The main Chess Endgame news of the last 15 months, including the adoption of de Man's DTZ50' endgame tables and the advent of the 'CQL5' version of the Chess Query Language
Chess endgame news: the world chess championship, 2018
Computer analysis was very much to the fore in this, Carlsen’s most highly contested World Champion¬ship Match. It could be found on the web and in support of the various live commentaries on offer. Here, we focus on game six of the classic phase and game one of the rapid-tempo tie-break. More extensive analysis can be found in the e-repository version of this note
Chess endgame news: an Endgame challenge for neural nets
This article defines the challenge of training neural-networks on specific chess endgames and benchmarking their efficacy against the existing sub-8-man endgame tables. The key tasks are to measure how well they play and to infer higher-order rules and guidelines for play from them
Performance and prediction: Bayesian modelling of fallible choice in chess
Evaluating agents in decision-making applications requires assessing their skill and predicting their behaviour. Both are well developed in Poker-like situations, but less so in
more complex game and model domains. This paper addresses both tasks by using Bayesian inference in a benchmark space of reference agents. The concepts are explained and demonstrated using the game of chess but the model applies generically to any domain with quantifiable options and fallible choice. Demonstration applications address questions frequently asked by the chess community regarding the stability of the rating scale, the comparison of players of different eras and/or leagues, and controversial incidents possibly involving fraud. The last include alleged under-performance, fabrication of tournament results, and clandestine use of computer advice during competition. Beyond the model world of games, the aim is to improve fallible human performance in complex, high-value tasks
Position criticality in chess endgames
Some 50,000 Win Studies in Chess challenge White to find an effectively unique route to a win. Judging the impact of less than absolute uniqueness requires both technical analysis and artistic judgment. Here, for the first time, an algorithm is defined to help analyse uniqueness in endgame positions objectively. The key idea is to examine how critical certain positions are to White in achieving the win. The algorithm uses sub-n-man endgame tables
(EGTs) for both Chess and relevant, adjacent variants of Chess. It challenges authors of EGT generators to generalise them to create EGTs for these chess variants.
It has already proved efficient and effective in an implementation for Starchess, itself a variant of chess. The approach also addresses a number of similar questions arising in endgame theory, games and compositions
Stalemate and 'DTS' depth to stalemate endgame tables
Stalemating the opponent in chess has given rise to various opinions as to the nature of that result and the reward it should properly receive. Here, following Lasker and Reti, we propose that ‘stalemate’ is a secondary goal, superior to a draw by agreement or rule – but inferior to mate. We report the work of ‘Aloril’ who has created endgame tables holding both ‘DTM’ depth to mate and ‘DTS’ depth to stalemate data, and who should be regarded as the prime author of this paper. Further, we look at the classification of ‘Chess Stalemate Studies’ in the context of a ‘Lasker Chess’ which recognises the stalemate goal
- …