Skip to main content
Article thumbnail
Location of Repository

Data assurance in opaque computations

By Joe Hurd and Guy McCrossan Haworth


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

Publisher: Springer
Year: 2010
OAI identifier:

Suggested articles


  1. (2009). A Guide to Endgame Tablebases.
  2. (1988). A Reply to R. Sattler's Remarks on the KRP(a2)-KbBP(a3) Database.
  3. (2003). Building the Checkers 10-piece Endgame Databases. In:
  4. (2003). Care and Handling of CDs and DVDs: A Guide for Librarians and Archivists.
  5. (2007). Checkers is Solved. Science 317-5844,
  6. (1949). Checking a large routine. In: Report of a Conference on High Speed Automatic Calculating Machines,
  7. (2005). Chess Endgames.
  8. (2001). D.F.: Solving Chinese Chess Endgames by Database Construction.
  9. (2000). E.A.: Space-efficient indexing of chess endgame tables.
  10. (2006). EGT-query service extending to 6-man pawnless endgame EGTs
  11. (2007). EGTs Online’.
  12. (1999). Endgame databases and efficient index schemes.
  13. (2006). ENDGAME T3.
  14. (1999). Exhaustive and Heuristic Retrograde Analysis of the KPPKP Endgame.
  15. (2009). FIDE: The Laws of Chess.
  16. (2006). Formal certification of a compiler back-end or: programming a compiler with a proof assistant. In:
  17. (2005). Formal verification of chess endgame databases. In
  18. (1988). Further to the KRP(a2)KbBP(a3) Database.
  19. (2005). G.McC.: 6-man Chess Solved.
  20. (2005). G.McC.: Chess endgames: 6-man data and strategy.
  21. (2005). Generation and compression of endgame tables in chess with fast random access using OBDDs. Master's thesis,
  22. (1995). Inside the Pentium FDIV bug.
  23. (2004). Machines Who Think: A Personal Inquiry into the History and Prospects of Artificial Intelligence. A.K.Peters
  24. (1987). N.: A Six-Men-Endgame Database: KRP(a2)KbBP(a3).
  25. (1974). Ob Analize Ferzevogo Endshpilia pri Pomoshchi EVM.
  26. (1997). One Jump Ahead: Challenging Human Supremacy in Checkers.
  27. (1977). P.G.: An Experiment on Inductive Learning in Chess End Games.
  28. (1989). Parallel Analysis of Certain Endgames.
  29. (2000). Private Communications
  30. (2002). Programming combinations of deduction and BDD-based symbolic calculation.
  31. (1984). Reflections on Trusting Trust.
  32. (2002). Regarding FEG 3.03b – List Found.
  33. (1986). Retrograde Analysis of Certain Endgames.
  34. (1978). S.S.: TEMPO: A Unified Treatment of Binding Time and Parameter Passing Concepts in Programming Languages.
  35. (2002). Secrets of Pawnless Endings. Expanded Edition 2,
  36. (2000). Strategies for Constrained Optimisation.
  37. (1992). Symbolic Boolean manipulation with ordered binary-decision diagrams.
  38. (2002). Symbolic exploration in two-player games: Preliminary results.
  39. (1993). T.F.: Introduction to HOL: A theorem-proving environment for higher order logic.
  40. Tablebase version comparison.
  41. (2002). The
  42. (1994). The Classification of Finite Simple Groups.
  43. (1997). The Computer Section: Correction.
  44. (2006). The Semantic Web Revisited.
  45. (1970). Untersuchungen über kombinatorische Spiele.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.