63 resultados para chess
Resumo:
Three topics are discussed. First, an issue in the epistemology of computer simulation - that of the chess endgame 'becoming' what computer-generated data says it is. Secondly, the endgames of the longest known games are discussed, and the concept of a Bionic Game is defined. Lastly, the set of record-depth positions published by Bourzutschky and Konoval are evaluated by the new MVL tables in Moscow - alongside the deepest known mate of 549 moves.
Resumo:
The 20th World Computer Chess Championship took place in Yokohama, Japan during August 2013. It was narrowly won by JUNIOR from JONNY with HIARCS, PANDIX, SHREDDER and MERLIN occupying the remaining positions. There are references to the detailed chess biographies of the engines and engine-authors in the Chessprogramming Wiki. The games, occasionally annotated, are available here.
Resumo:
The 3rd World Chess Software Championship took place in Yokohama, Japan during August 2013. It pits chess engines against each other on a common hardware platform - in this instance, the Intel i7 2740 Ivy Bridge with 16GB RAM supporting a potential eight processing threads. It was narrowly won by HIARCS from JUNIOR and PANDIX with JONNY, SHREDDER and MERLIN taking the remaining places. Games, occasionally annotated, are available here.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
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'.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
This is the official report of the ICGA's 2015 World Chess Software Championship held in Leiden, The Netherlands.
Resumo:
Systems Engineering often involves computer modelling the behaviour of proposed systems and their components. Where a component is human, fallibility must be modelled by a stochastic agent. The identification of a model of decision-making over quantifiable options is investigated using the game-domain of Chess. Bayesian methods are used to infer the distribution of players’ skill levels from the moves they play rather than from their competitive results. The approach is used on large sets of games by players across a broad FIDE Elo range, and is in principle applicable to any scenario where high-value decisions are being made under pressure.
Resumo:
The chess endgame is increasingly being seen through the lens of, and therefore effectively defined by, a data ‘model’ of itself. It is vital that such models are clearly faithful to the reality they purport to represent. This paper examines that issue and systems engineering responses to it, using the chess endgame as the exemplar scenario. A structured survey has been carried out of the intrinsic challenges and complexity of creating endgame data by reviewing the past pattern of errors during work in progress, surfacing in publications and occurring after the data was generated. Specific measures are proposed to counter observed classes of error-risk, including a preliminary survey of techniques for using state-of-the-art verification tools to generate EGTs that are correct by construction. The approach may be applied generically beyond the game domain.
