International Journal of Game Theory

, Volume 47, Issue 2, pp 653–671 | Cite as

Games with guaranteed scores and waiting moves

  • Urban Larsson
  • Richard J. Nowakowski
  • Carlos P. SantosEmail author
Original Paper


Combinatorial scoring games, with the property ‘extra pass moves for a player will do him no harm’, are characterized. The characterization involves an order embedding of Conway’s normal play games, and we call our class the universe of Guaranteed scoring games. Also, we give a theorem for comparing guaranteed games with scores (numbers) which extends Ettinger’s work on Dicot scoring games.


Combinatorial game Normal play Scoring play Waiting move 


  1. Albert MH, Nowakowski RJ, Wolfe D (2007) Lessons in play. A K Peters Ltd, NatickGoogle Scholar
  2. Beck J (2006) Combinatorial games: tic-tac-toe theory. Series: encyclopedia of mathematics and its applications (No. 114). Cambridge University, CambridgeGoogle Scholar
  3. Berlekamp ER, Conway JH, Guy RK (2001) Winning ways for your mathematical plays, volume 1–4. A K Peters, Ltd., 2001–2004. 2nd edition: vols. 1Google Scholar
  4. Calistrate D (1996) The reduced canonical form of a game, games of no chance, vol 29. MSRI Publications, Cambridge University, CambridgeGoogle Scholar
  5. Conway JH (1976) On numbers and games. Academic Press, London, p ix + 238Google Scholar
  6. Ettinger JM (2000) A metric for positional games. Theoret Comput Sci (Math Games) 230:207–219CrossRefGoogle Scholar
  7. Ettinger JM (1996) Topics in combinatorial games. PhD thesis, University of Wisconsin, MadisonGoogle Scholar
  8. Grossman JP, Siegel AN (2009) Reductions of partizan games. Games of no chance 3. Cambridge University, Cambridge, pp 437–456Google Scholar
  9. Hanner O (1959) Mean play of sums of positional games. Pac J Math 9:81–99CrossRefGoogle Scholar
  10. Johnson W (2014) The combinatorial game theory of well-tempered scoring games. Internat J Game Theory 43(2):415–438CrossRefGoogle Scholar
  11. Larsson U, Neto JP, Nowakowski RJ, Santos CP (2016) Guaranteed scoring games. Electron J Combin 23:3.27Google Scholar
  12. Milnor J (1953) Sums of positional games. Ann Math Stud 2(28):291–301 [(Contributions to the Theory of Games, Kuhn HW, Tucker AW (eds.)), Princeton]Google Scholar
  13. Plambeck TE, Siegel AN (2008) Misere quotients for impartial games. J Combin Theory Ser A 115(4):593–622CrossRefGoogle Scholar
  14. Santos CP, Carvalho A (2017) A non-trivial surjective map onto the short Conway’s Group. To appear. In: Larsson U (ed.) Games of no chance 5. In: Proceedings of BIRS workshop on combinatorial games, 2011, Banff, Alberta, CanadaGoogle Scholar
  15. Santos CP, Silva JN (2008) Konane has infinite Nim-dimension. INTEGERS 8(G2):6Google Scholar
  16. Siegel AN (2013) Combinatorial game theory. American Mathematical SocietyGoogle Scholar
  17. Stewart F (2011) Scoring play combinatorial games. PhD thesis, University of Dundee, Also, to appear. In: Larsson U (ed.) Games of no chance 5. In: Proceedings of BIRS workshop on combinatorial games, 2011, Banff, Alberta, CanadaGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany 2017

Authors and Affiliations

  1. 1.Dalhousie UniversityHalifaxCanada
  2. 2.Center for Functional Analysis, Linear Structures and ApplicationsUniversity of LisbonLisbonPortugal

Personalised recommendations