Skip to main content

Awari Retrograde Analysis

  • Conference paper
  • First Online:
Book cover Computers and Games (CG 2000)

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

Included in the following conference series:

Abstract

This paper introduces an alternative algorithm for Retrograde Analysis in Awari. A parallel version of this algorithm created Awari endgame databases of up to 35 pebbles. Both sequential and parallel versions of the algorithm are compared to sequential and parallel versions of the traditional Retrograde Analysis algorithm.

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

Access this chapter

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. Ströhlein, T.: Untersuchungen über Kombinatorische Spiele. PhD thesis, TH München, Germany (1970)

    Google Scholar 

  2. Thompson, K.: Retrograde Analysis of Certain Endgames. Journal of the International Computer Chess Association 9 (1986) 131–139

    Google Scholar 

  3. Stiller, L.: Group Graphs and Computational Symmetry on Massively Parallel Architecture. Journal of Supercomputing 5 (1991) 99–117

    Article  MATH  Google Scholar 

  4. Lake, R., Schaeffer, J., Lu, P.: Solving Large Retrograde Analysis Problems Using a Network of Workstations. Advances in Computer Chess VII (1994) 135–162

    Google Scholar 

  5. Culberson, J., Schaeffer, J.: Efficiently Searching the 15-Puzzle. Technical Report TR 94-08, Department of Computing Science, University of Alberta (1994)

    Google Scholar 

  6. Gasser, R.: Efficiently Harnessing Computational Resources for Exhaustive Search. PhD thesis, ETH Zürich, Switzerland (1995)

    Google Scholar 

  7. Allis, L., van den Herik, H., Herschberg, I.: Which GamesWill Survive? Heuristic Programming in Artificial Intelligence 2 (1991) 232–243

    Google Scholar 

  8. Allis, L., van der Meulen, M., van den Herik, H.: Databases in Awari. Heuristic Programming in Artificial Intelligence 2 (1991) 73–86

    Google Scholar 

  9. Bal, H., Allis, L.: Parallel Retrograde Analysis on a Distributed System. In: Supercomputing’95, IEEE (1995)

    Google Scholar 

  10. Lincke, T.: Awari Endgame Database. http://wwwjn.inf.ethz.ch/games/awari/ (2000)

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

van der Goot, R. (2001). Awari Retrograde Analysis. 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_6

Download citation

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

  • 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

Publish with us

Policies and ethics