Data assurance in opaque computations

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

Rook versus Bishop

The focus here is on the influence of the endgame KRPKBP on endgames featuring duels between rook and bishop. We take advantage of the range of endgame tablebases and tools now available to ratify and extend previous analyses of five examples, including the conclusion of the justly famous 1979 Rio Interzonal game, Timman-Velimirović. The tablebases show that they can help us understand the hidden depths of the chess endgame, that the path to the draw here is narrower than expected, that chess engines without tablebases still do not find all the wins, and that there are further surprises in store when more pawns are added