Skip to main content

A Pedagogical Example: A Family of Stochastic Cellular Automata that Plays Alesia

  • Conference paper
  • First Online:
  • 1105 Accesses

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

Abstract

Alesia is a two-player zero-sum game which is quite similar to the rock-paper-scissors game: the two players simultaneously move and do not know what the opponent plays at a given round. The simultaneity of the moves implies that there is no deterministic good strategy in this game, otherwise one would anticipate the moves of the opponent and easily win the game. We explore how to build a family of one-dimensional stochastic cellular automata to play this game. The rules are built in an iterative way by progressively increasing the complexity of the transitions. We show the possibility to construct a family of rules with interesting results, including a good performance when confronted to the Nash-equilibrium strategy.

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

Buying options

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 EPUB and 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

Learn about institutional subscriptions

References

  1. Cook, M., Larsson, U., Neary, T.: A cellular automaton for blocking queen games. Nat. Comput. 16(3), 397–410 (2017)

    Article  MathSciNet  Google Scholar 

  2. Fraenkel, A.S.: Two-player games on cellular automata. More Games Chance 42, 279–306 (2002)

    MathSciNet  MATH  Google Scholar 

  3. Grilo, C., Correia, L.: Effects of asynchronism on evolutionary games. J. Theor. Biol. 269(1), 109–122 (2011). https://doi.org/10.1016/j.jtbi.2010.022

    Article  MathSciNet  MATH  Google Scholar 

  4. Meyer, C., Ganascia, J.G., Zucker, J.D.: Learning strategies in games by anticipation. In: Proceedings of IJCAI (1), pp. 698–707 (1997)

    Google Scholar 

  5. Perolat, J., Scherrer, B., Piot, B., Pietquin, O.: Approximate dynamic programming for two-player zero-sum Markov games. In: Proceedings of International Conference on Machine Learning 2015, Lille, France, vol. 37, pp. 1321–1329 (2015)

    Google Scholar 

  6. Szabó, G., Fáth, G.: Evolutionary games on graphs. Phys. Rep. 446(4–6), 97–216 (2007). https://doi.org/10.1016/j.physrep.2007.04.004

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

We express our sincere gratitude to Bruno Scherrer for introducing us to the game of Alesia and for providing us with an optimal Nash player program. We thank Irène Marcovici for her valuable comments on the manuscript.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nazim Fatès .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Fatès, N. (2018). A Pedagogical Example: A Family of Stochastic Cellular Automata that Plays Alesia. In: Mauri, G., El Yacoubi, S., Dennunzio, A., Nishinari, K., Manzoni, L. (eds) Cellular Automata. ACRI 2018. Lecture Notes in Computer Science(), vol 11115. Springer, Cham. https://doi.org/10.1007/978-3-319-99813-8_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-99813-8_35

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-99812-1

  • Online ISBN: 978-3-319-99813-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics