Skip to main content

Solving Chainmail Jousting

  • Conference paper
  • First Online:
Computers and Games (CG 2022)

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

Included in the following conference series:

  • 175 Accesses

Abstract

We consider the Chainmail Jousting game by Gygax and Perren (1971), a symmetric game of pure skill for two players. Preliminary analysis produces a payoff matrix with only zero and unit values. We find that this matrix is too large to be solved by existing software tools, such that IEDS of weakly-dominated strategies is needed to find solutions. We then apply the lrs solver by Avis et. al. (2010), and find a trio of critical mixed strategies which form the Nash equilibria for the game, including one composed of a simple coin flip between two of the permitted moves. We further consider ways to distinguish the various Nash equilibria, and also some variants of the game.

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 44.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.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

Similar content being viewed by others

References

  1. Gygax, G., Perren, J.: Chainmail: Rules for Medieval Miniatures. 2nd edn. Guidon Games, Belfast Maine (1972)

    Google Scholar 

  2. Gygax, G., Arneson, D.: Dungeons & Dragons. Tactical Studies Rules, USA (1974)

    Google Scholar 

  3. The Order of the Boar: Rules of Jousting. https://www.jousting.co.nz/jousting/rules-of-jousting. Accessed 30 Aug 2022

  4. Avis, D., Rosenberg, G., Savani, R., von Stengel, B.: Enumeration of nash equilibria for two-player games. Econ. Theory 42, 9–37 (2010). https://doi.org/10.1007/s00199-009-0449-x

  5. Solve a Bimatrix Game. https://cgi.csc.liv.ac.uk/~rahul/bimatrix_solver. Accessed 30 Aug 2022

  6. OD&D Discussion. https://odd74.proboards.com/post/206676/thread. Accessed 30 Aug 2022

Download references

Acknowledgments

The author wishes to thank Nataniel Greene and Stephen Wendell for encouragement in writing this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Daniel R. Collins .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Collins, D.R. (2023). Solving Chainmail Jousting. In: Browne, C., Kishimoto, A., Schaeffer, J. (eds) Computers and Games. CG 2022. Lecture Notes in Computer Science, vol 13865. Springer, Cham. https://doi.org/10.1007/978-3-031-34017-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-34017-8_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-34016-1

  • Online ISBN: 978-3-031-34017-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics