Skip to main content

Abstract Proof Search

Part of the Lecture Notes in Computer Science book series (LNCS,volume 2063)

Abstract

In complex games with a large branching factor such as Go, programs usually use highly selective search methods, heuristically expanding just a few plausible moves in each position. As in early Chess programs, these methods have shortcomings, they often neglect good moves or overlook a refutation. We propose a safe method to select the interesting moves using game definition functions. This method has multiple advantages over basic alphabeta search: it solves more problems, the answers it finds are always correct, it solves problems faster and with less nodes, and it is more simple to program than usual heuristic methods. The only small drawback is the requirement for an abstract analysis of the game. This could be avoided by keeping track of the intersections tested during the search, maybe with a loss of efficacy but with a gain in generality. We give examples and experimental results for the capture game, an important sub-game of the game of Go. The principles underlying the method are not specific to the capture game. The method can also be used with different search algorithms. This algorithm is important for every Go programmer, and is likely to interest other game programmers.

keywords

  • Computer Go
  • search
  • theorem proving
  • capture game

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/3-540-45579-5_3
  • Chapter length: 16 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   99.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-45579-0
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   129.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cazenave T.: Metaprogramming Forced Moves. Proceedings ECAI98 (ed. H. Prade), pp. 645–649. John Wiley & Sons Ltd., Chichester, England. ISBN 0-471-98431-0. 1998.

    Google Scholar 

  2. Cazenave T.: Generating Search Knowledge in a Class of Games. submitted. http://www.ai.univ-paris8.fr/~cazenave/papers.html. 2000.

  3. Frank I.: Search and Planning under Incomplete Information: a Study using Bridge Card Play. PhD Thesis, Department of Artificial Intelligence, University of Edinburgh. 1996.

    Google Scholar 

  4. Kano Y.: Graded Go Problems For Beginners. Volume One. The Nihon Ki-in. ISBN 4-8182-0228-2 C2376. 1985.

    Google Scholar 

  5. Kano Y.: Graded Go Problems For Beginners. Volume Two. The Nihon Ki-in. ISBN 4-906574-47-5. 1985.

    Google Scholar 

  6. Kano Y.: Graded Go Problems For Beginners. Volume Three. The Nihon Ki-in. ISBN 4-8182-0230-4. 1987.

    Google Scholar 

  7. Marsland T. A., Björnsson Y.: From Minimax to Manhattan. Games in AI Research, pp. 5–17. Edited by H.J. van den Herik and H. Iida, Universiteit Maastricht. ISBN 90-621-6416-1. 2000.

    Google Scholar 

  8. Thomsen T.: Lambda-search in game trees — with application to go. CG 2000. This volume.

    Google Scholar 

  9. Willmott S., Richardson J. D. C., Bundy A., Levine J. M.: Applying Adversarial Techniques to Go. Journal of Theoretical Computer Science. 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cazenave, T. (2001). Abstract Proof Search. In: Marsland, T., Frank, I. (eds) Computers and Games. CG 2000. Lecture Notes in Computer Science, vol 2063. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45579-5_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-45579-5_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43080-3

  • Online ISBN: 978-3-540-45579-0

  • eBook Packages: Springer Book Archive