Skip to main content
SpringerLink
Log in

Data Assurance in Opaque Computations

  • Conference paper
Advances in Computer Games (ACG 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6048))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hooper, D., Whyld, K.: The Oxford Companion to Chess, 2nd edn. OUP (1992)

    Google Scholar 

  2. FIDE: The Laws of Chess. FIDE Handbook E.1.01A (2009), http://www.fide.com/component/-handbook/?id=124&view=article

  3. McCorduck, P.: Machines Who Think: A Personal Inquiry into the History and Prospects of Artificial Intelligence. A.K.Peters, Wellesley (2004)

    Google Scholar 

  4. Heinz, E.A.: Endgame databases and efficient index schemes. ICCA J. 22(1), 22–32 (1999)

    MathSciNet  Google Scholar 

  5. Ströhlein, T.: Untersuchungen über kombinatorische Spiele. Ph.D. thesis, Technical University of Munich (1970)

    Google Scholar 

  6. Haworth, G.McC.: 6-man Chess Solved. ICGA J. 28(3), 153 (2005)

    Google Scholar 

  7. Kryukov, K.: EGTs Online (2007), http://kirill-kryukov.com/chess/tablebases-online/

  8. Nalimov, E.V., Haworth, G.McC., Heinz, E.A.: Space-efficient indexing of chess endgame tables. ICGA J. 23(3), 148–162 (2000)

    Google Scholar 

  9. Nalimov, E.V.: Private Communications (2000)

    Google Scholar 

  10. Coe, T.: Inside the Pentium FDIV bug. Dr. Dobb’s Journal 229, 129–135, 148 (1995)

    Google Scholar 

  11. Gorenstein, D., Lyons, R., Solomon, R.: The Classification of Finite Simple Groups. AMS (1994)

    Google Scholar 

  12. Devlin, K.: Last doubts removed about the proof of the Four Color Theorem (2005), http://www.maa.org/devlin/devlin_01_05.html

  13. RIPE: Mediterranean Cable Cut – A RIPE NCC Analysis (2008), http://www.ripe.net/projects/-reports/2008cable-cut/index.html

  14. BBC: Repairs begin on undersea cable (2008), http://news.bbc.co.uk/1/hi/technology/7795320.stm

  15. Pouzzner, D.: Partial failure of Internet root nameservers. The Risks Digest, 19–25 (1997)

    Google Scholar 

  16. BBC: Human error’ hits Google search (2009), http://news.bbc.co.uk/1/hi/technology/7862840-.stm

  17. Hurd, J.: Formal verification of chess endgame databases. In: Hurd, J., Smith, E., Darbari, A. (eds.) Theorem proving in higher order logics: Emerging trends proceedings. Technical Report PRG-RR-05-02, 85-100. Oxford University Computing Laboratory (2005)

    Google Scholar 

  18. Shadbolt, N., Hall, W., Berners-Lee, T.: The Semantic Web Revisited. IEEE Intelligent Systems 21(3), 96–101 (2006)

    Article  Google Scholar 

  19. Herik, H.J., van den Herschberg, I.S., Nakad, N.: A Six-Men-Endgame Database: KRP(a2)KbBP(a3). ICCA J. 10(4), 163–180 (1987)

    Google Scholar 

  20. Michalski, R.S., Negri, P.G.: An Experiment on Inductive Learning in Chess End Games. In: Machine Intelligence, vol. 8, pp. 175–192. Ellis Horwood (1977)

    Google Scholar 

  21. Sattler, R.: Further to the KRP(a2)KbBP(a3) Database. ICCA J. 11(2/3), 82–87 (1988)

    Google Scholar 

  22. Herik, H.J., van den Herschberg, I.S., Nakad, N.: A Reply to R. Sattler’s Remarks on the KRP(a2)-KbBP(a3) Database. ICCA J. 11(2/3), 88–91 (1988)

    Google Scholar 

  23. Bleicher, E.: Freezer (2009), http://www.freezerchess.com/

  24. Andrist, R.B.: Wilhelm (2009), http://www.geocities.com/rba_schach2000/index_english.htm

  25. Wu, R., Beal, D.F.: Solving Chinese Chess Endgames by Database Construction. Information Sciences 135(3/4), 207–228 (2001)

    Article  MATH  Google Scholar 

  26. Wirth, C., Nievergelt, J.: Exhaustive and Heuristic Retrograde Analysis of the KPPKP Endgame. ICCA J. 22(2), 67–80 (1999)

    Google Scholar 

  27. Tay, A.: A Guide to Endgame Tablebases (2009), http://www.horizonchess.com/FAQ/Winboard/-egtb.html

  28. Merlino, J.: Regarding FEG 3.03b – List Found (2002), http://www.horizonchess.com/FAQ/-Winboard/egdbbug.html

  29. Chessbase: FRITZ ENDGAME T3 (2006), http://www.chessbase.com/workshop2.asp?id=3179

  30. Roycroft, A.J.: *C* Correction. EG 7(119), 771 (1996)

    Google Scholar 

  31. Roycroft, A.J.: The Computer Section: Correction. EG 8(123), 47–48 (1997)

    Google Scholar 

  32. Roycroft, A.J.: *C*. EG 8(Suppl. 130), 428 (1998)

    Google Scholar 

  33. Roycroft, A.J.: Snippets. EG 8(131), 476 (1999)

    Google Scholar 

  34. Jones, N.D., Muchnick, S.S. (eds.): TEMPO. LNCS, vol. 66. Springer, Heidelberg (1978)

    MATH  Google Scholar 

  35. Bourzutschky, M.S., Tamplin, J.A., Haworth, G.McC.: Chess endgames: 6-man data and strategy. Theoretical Computer Science 349(2), 140–157 (2005)

    Google Scholar 

  36. Bourzutschky, M.S.: Tablebase version comparison, http://preview.tinyurl.com/d3wny4 (2006-08-10)

  37. Thompson, K.: Reflections on Trusting Trust. CACM 27(8), 761–763 (1984)

    Google Scholar 

  38. Tamplin, J.: EGT-query service extending to 6-man pawnless endgame EGTs in DTC, DTM, DTZ and DTZ50 metrics (2006), http://chess.jaet.org/endings/

  39. Schaeffer, J., Björnsson, Y., Burch, N., Lake, R., Lu, P., Sutphen, S.: Building the Checkers 10-piece Endgame Databases. In: Advances in Computer Games, vol. 10, pp. 193–210 (2003)

    Google Scholar 

  40. Thompson, K.: Retrograde Analysis of Certain Endgames. ICCA J. 9(3), 131–139 (1986)

    Google Scholar 

  41. Stiller, L.B.: Parallel Analysis of Certain Endgames. ICCA J. 12(2), 55–64 (1989)

    Google Scholar 

  42. Nunn, J.: Secrets of Pawnless Endings, 2nd Expanded edn., Gambit (2002)

    Google Scholar 

  43. Krabbé, T.: Private Communication (2008-09-05)

    Google Scholar 

  44. Herbstman, A.O.: Draw Study 172. EG 5, 195 (1967)

    Google Scholar 

  45. Haworth, G.McC.: Strategies for Constrained Optimisation. ICGA J. 23(1), 9–20 (2000)

    Google Scholar 

  46. Byers, F.R.: Care and Handling of CDs and DVDs: A Guide for Librarians and Archivists. CLIR/NIST (2003), http://www.clir.org/pubs/reports/pub121/contents.html

  47. Fierz, M., Cash, M., Gilbert, E.: The 2002 World Computer-Checkers Championship. ICGA J. 25(3), 196–198 (2002)

    Google Scholar 

  48. Schaeffer, J.: One Jump Ahead: Challenging Human Supremacy in Checkers. Springer, New York (1997)

    Google Scholar 

  49. Komissarchik, E.A., Futer, A.L.: Ob Analize Ferzevogo Endshpilia pri Pomoshchi EVM. Problemy Kybernet 29, 211–220 (1974); Reissued in translation by Chr. Posthoff and I.S. Herschberg under the title ‘Computer Analysis of a Queen Endgame. ICCA J. 9(4), 189–198 (1986)

    Google Scholar 

  50. Gordon, M.J.C., Melham, T.F.: Introduction to HOL: A theorem-proving environment for higher order logic. Cambridge University Press, Cambridge (1993)

    MATH  Google Scholar 

  51. Turing, A.M.: Checking a large routine. In: Report of a Conference on High Speed Automatic Calculating Machines, pp. 67–69. Cambridge University Mathematical Laboratory (1949)

    Google Scholar 

  52. Leroy, X.: Formal certification of a compiler back-end or: programming a compiler with a proof assistant. In: Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2006), pp. 42–54. ACM, New York (2006)

    Google Scholar 

  53. Bryant, R.E.: Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys 24(3), 293–318 (1992)

    Article  Google Scholar 

  54. Gordon, M.J.C.: Programming combinations of deduction and BDD-based symbolic calculation. LMS J. of Computation and Mathematics 5, 56–76 (2002)

    MATH  Google Scholar 

  55. Edelkamp, S.: Symbolic exploration in two-player games: Preliminary results. In: The International Conference on AI Planning & Scheduling (AIPS), Workshop on Model Checking, Toulouse, France, pp. 40–48 (2002)

    Google Scholar 

  56. Kristensen, J.T.: Generation and compression of endgame tables in chess with fast random access using OBDDs. Master’s thesis, U. of Aarhus, Dept. of Computer Science (2005)

    Google Scholar 

  57. Hurd, J.: Chess Endgames (2005), http://www.gilith.com/chess/endgames

  58. Schaeffer, J., Burch, N., Björnsson, Y., Kishimoto, A., Müller, M., Lake, R., Lu, P., Sutphen, S.: Checkers is Solved. Science 317(5844), 1518–1522 (2007)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Galois, Inc., 421 SW 6th Ave., Suite 300, Portland, OR 97204, USA

    Joe Hurd

  2. School of Systems Engineering, University of Reading, UK

    Guy Haworth

Authors
  1. Joe Hurd
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guy Haworth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Games and AI Group, MICC, Faculty of Humanities and Sciences, Universiteit Maastricht, Maastricht, The Netherlands

    H. Jaap van den Herik

  2. Institute for Knowledge and Agent Technology, Universiteit Maastricht,  

    Pieter Spronck

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hurd, J., Haworth, G. (2010). Data Assurance in Opaque Computations. In: van den Herik, H.J., Spronck, P. (eds) Advances in Computer Games. ACG 2009. Lecture Notes in Computer Science, vol 6048. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12993-3_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12993-3_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12992-6

  • Online ISBN: 978-3-642-12993-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation