Reference Fallible Endgame Play

Haworth, Guy

doi:10.3233/icg-2003-26204

Cited by 21 publications

(31 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We require that {Re} is a spectrum of players, ranging linearly from the metric-infallible player Roo via the random player Ro to the anti-infallible player R __ To ensure this, the function Se(val, d) is required to meet some natural criteria, as described more fully and formally in Haworth (2003) and in Appendix B.…”

Section: The Reference Endgame Player Modelmentioning

confidence: 99%

“…The two famous Browne-BELLE KQKR exhibition games have already been studied using the REP model (Haworth, 2003). Browne's apparent competence c was assessed by an Analyser, and BELLE's moves as Black were compared with the decisions of a Predator using the Analyser' s output.…”

Section: Robustness Of the Modelmentioning

confidence: 99%

“…The initial assumptions differed slightly from those of Haworth (2003): here, WILHELM was set to analyse with candidate c =O (0.01) 50 and K = 1 and the results are listed in Table 2, showing depth conceded by both si des, net progress and apparent c.…”

Section: Apparent Competence Of Playersmentioning

confidence: 99%

“…The two Browne-BELLE games (Fenner, 1979;Haworth, 2003;Jansen, 1992a;Levy and Newbom, 1991) are the famous demonstration that the 'easy' KQKR endgame is not so easy to win. Gelfand-Svidler was a tie-breaker rapid-play game played under extreme time pressure.…”

Section: Apparent Competence Of Playersmentioning

confidence: 99%

“…In Haworth (2003), a reference model of fallible endgame play was defined in terms of a spectrum of Reference Endgame Players (REPs) Re. The REPs are defined as choosing their moves stochastically, using only successar positions' values and depths from an endgame table (EGT).…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Model Endgame Analysis

Haworth¹,

Andrist²

2004

Advances in Computer Games

View full text Add to dashboard Cite

show abstract

Section: The Reference Endgame Player Modelmentioning

confidence: 99%

Section: Robustness Of the Modelmentioning

confidence: 99%

Section: Apparent Competence Of Playersmentioning

confidence: 99%

Section: Apparent Competence Of Playersmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Model Endgame Analysis

Haworth¹,

Andrist²

2004

Advances in Computer Games

View full text Add to dashboard Cite

show abstract

Chess Endgames: Data and Strategy

Tamplin¹,

Haworth²

2004

Advances in Computer Games

View full text Add to dashboard Cite

While Nalimov's endgame tables for Westem Chess are the most used today, their Depth-to-Mate metric is not the only one and not the most effective in use. The authors have developed and used new prograrns to create tables to alternative metrics and recommend better strategies for endgame play.Keywords: chess, conversion, data, depth, endgame, goal, move count, statistics, strategy IntroductionChess endgames tables (EGTs) to the 'DTM' Depth toMate metric are the most commonly used, thanks to cades and production work by Nalimov (Nalimov, Haworth, and Heinz, 2000a,b;Hyatt, 2000). DTM data is of interest in itself, even if conversion, i.e., change of force, is usually adopted as an interim objective in human play. However, more effective endgame strategies using different metrics can be adopted, particularly by computers (Haworth, 2000. A further practica! disadvantage of the DTM EGTs is that, with more men, DTM increases and file-compression becomes less effective.Here, we focus on metrics DTC, DTZ 1 and DTZ50 2 ; the first two were previously used by Thompson (1986Thompson ( , 2000 and Wirth (1999). New programs by Tamplin (2001) and Bourzutschky (2003) have enabled a complete suite of 3-to-5-man DTC/Z/Z50 EGTs to be produced.Section 2 outlines these two new algorithms. Sections 3 to 5 review the new DTC, DTZ and DTZ50 data tabled in the Appendix. Finally, improved endgame strategies are recommended for the 50-move context: New Approaches to EGT GenerationBelow we briefly describe two new approaches to EGT generation. The frrst one is described adequately in the literature; the second so far not. 2.1Tamplin's Wu-Beal Code Tamplin (2001) combined the Wu-Beal (2001a,b) algorithm with Nalimov indexing in a new code whose objectives were primarily Nalimovcompatibility, simplicity, maintainability and portability. Most pawnless 3-to-5-man DTC EGTs were generated, the new code including an inverseindex function mirroring Nalimov's index function. 2.2Bourzutschky's Modified-Nalimov CodeBourzutschky (2003) modified Nalimov's DTM-code to enable it also to generate EGTs to metrics DTCk and DTZk. This involved generalising some DTM-specific aspects of the algorithm, as well as the obvious changes to the iterative formula for deriving depth. For DTC, the code retains the efficiencies ofthe DTM-code while requiring maxDTC rather than maxDTM cycles. Because EGT generation to the DTZ metric has not yet been implemented generically as a sequence of sub-EGT generations, each based on a fixed pawn structure, this is not the case for DTZk computations. These can also require somewhat more than DTC cycles but the difference is insignificant. 3.The DTC Data DTC EGTs are interesting, not only for completeness, but because conversion is an intuitively obvious objective and the DTC EGTs document precisely the phase of play when the material nominated is on the board.The remaining 3-to-5-man DTC EGTs were generated. Table 1 in the Appendix lists for each endgame the number of positions of maxDTC, wtmlbtm and 1-0/0-1. The ICGA ...

show abstract

A Comparative Review of Skill Assessment: Performance, Prediction and Profiling

Haworth

Biswas

Regan

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The assessment of chess players is both an increasingly attractive opportunity and an unfortunate necessity. The chess community needs to limit potential reputational damage by inhibiting cheating and unjustified accusations of cheating: there has been a recent rise in both. A number of counter-intuitive discoveries have been made by benchmarking the intrinsic merit of players' moves: these call for further investigation. Is Capablanca actually, objectively the most accurate World Champion? Has ELO rating inflation not taken place? Stimulated by FIDE/ACP, we revisit the fundamentals of the subject to advance a framework suitable for improved standards of computational experiment and more precise results. Other games and domains look to chess as demonstrator of good practice, including the rating of professionals making high-value decisions under pressure, personnel evaluation by Multichoice Assessment and the organization of crowd-sourcing in citizen science projects. The '3P' themes of performance, prediction and profiling pervade all these domains.

show abstract

Reference Fallible Endgame Play

Cited by 21 publications

References 11 publications

Model Endgame Analysis

Model Endgame Analysis

Chess Endgames: Data and Strategy

A Comparative Review of Skill Assessment: Performance, Prediction and Profiling

Contact Info

Product

Resources

About