Skip to main content

Incremental Transpositions

  • Conference paper
Computers and Games (CG 2004)

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

Included in the following conference series:

Abstract

We introduce a distinction, in single-agent problems, between transpositions that are due to permutations of commutative moves and transpositions that are not. We show a simple modification of a depth-first search algorithm which can detect the transpositions of the first class without the use of a transposition table. It works by maintaining, for each node, a list of moves that are known to lead to transpositions. This algorithm is applied to two one-player games: a solitary card game called Gaps, and a game called Morpion Solitaire. We analyze, for each domain, how often transpositions are due to commutative moves. In one variant of Gaps, the algorithm enables to search more efficiently with a small transposition table. In Morpion Solitaire, a transposition table is not even needed. The best known sequence for this game is proved optimal for more than one hundred moves.

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. Breuker, D.M.: Memory versus Search in Games. PhD thesis, Maastricht University (1998)

    Google Scholar 

  2. Helmstetter, B., Cazenave, T.: Searching with analysis of dependencies in a solitaire card game. In: van den Herik, H.J., Iida, H., Heinz, E.A. (eds.) Advances in Computer Games 10: Many Games, Many Challenges, pp. 343–360. Kluwer, Dordrecht (2003)

    Google Scholar 

  3. Juillé, H.: Incremental co-evolution of organisms: A new approach for optimization and discovery of strategies. In: Morán, F., Merelo, J.J., Moreno, A., Chacon, P. (eds.) ECAL 1995. LNCS, vol. 929, pp. 246–260. Springer, Heidelberg (1995)

    Google Scholar 

  4. Juillé, H.: Methods for Statistical Inference: Extending the Evolutionary Computation Paradigm. PhD thesis, Brandeis University (1999)

    Google Scholar 

  5. Meyrignac, J.-C.: Morpion solitaire progress, http://euler.free.fr/morpion.htm

  6. Shintani, T.: Consideration about state transition in Superpuzz. In: Information Processing Society of Japan Meeting, Shonan, Japan, pp. 41–48 (2000) (In Japanese)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Helmstetter, B., Cazenave, T. (2006). Incremental Transpositions. In: van den Herik, H.J., Björnsson, Y., Netanyahu, N.S. (eds) Computers and Games. CG 2004. Lecture Notes in Computer Science, vol 3846. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11674399_15

Download citation

  • DOI: https://doi.org/10.1007/11674399_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-32488-1

  • Online ISBN: 978-3-540-32489-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics