Abstract
Why are n-player games much more complex than two-player games? Is it much more difficult to cooperate or to compete? The game of n-player Shove is the n-player version of Shove, a two-player combinatorial game. In multi-player games, because of the possibility to form alliances, cooperation between players is a key-factor to determine the winning coalition and, as a consequence, n-player Shove played on a set of finite strips is \(\mathcal{PSPACE}\)-complete.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Albert, M.H., Nowakowski, R.J., Wolfe, D.: Lessons in Play: An Introduction to Combinatorial Game Theory. AK Peters, Wellesley (2007)
Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning Way for Your Mathematical Plays. AK Peters, Wellesley (2001)
Cincotti, A.: Three-player partizan games. Theoret. Comput. Sci. 332(1–3), 367–389 (2005)
Cincotti, A.: Three-player Hackenbush played on strings is \(\mathcal{NP}\)-complete. In: Ao, S.I., Castillo, O., Douglas, C., Feng, D.D., Lee, J. (eds.) Lecture Notes in Engineering and Computer Science: Proceedings of the International MultiConference of Engineers and Computer Scientists 2008, IMECS 2008, Hong Kong, 19–21 March 2008, pp. 226–230 (2008). Newswood Limited
Cincotti, A.: On the complexity of n-player Hackenbush. Integers 9, 621–627 (2009)
Cincotti, A.: On the complexity of three-player snort played on complete graphs. In: Li, W., Zhou, J. (eds.) Proceedings of the 2nd IEEE International Conference on Computer Science and Information Technology, Beijing, 8–11 August 2009, pp. 68–70. IEEE Press, New York (2009).
Cincotti, A.: Three-player col played on trees is \(\mathcal{NP}\)-complete. In: Ao, S.I., Castillo, O., Douglas, C., Feng, D.D., Lee, J. (eds.) Lecture Notes in Engineering and Computer Science: Proceedings of the International MultiConference of Engineers and Computer Scientists 2009, IMECS 2009, Hong Kong, 18–20 March 2009, pp. 445–447 (2009). Newswood Limited
Cincotti, A.: On the complexity of some map-coloring multi-player games. In: Ao, S.I., Castillo, O., Huang, H. (eds.) Intelligent Automation and Computer Engineering. LNEE, vol. 52, Springer, Berlin (2010)
Cincotti, A.: On the complexity of n-player toppling dominoes. In: Ao, S.I., Castillo, O., Douglas, C., Feng, D.D., Lee, J. (eds.) Lecture Notes in Engineering and Computer Science: Proceedings of the International MultiConference of Engineers and Computer Scientists 2010, IMECS 2010, Hong Kong, 17–19 March 2010, pp. 461–464 (2010). Newswood Limited
Cincotti, A.: Three-player toppling dominoes is \(\mathcal{NP}\)-complete. In: Mahadevan, V., Zhou, J. (eds.) Proceedings of the 2nd International Conference on Computer Engineering and Technology, Chengdu, 16–18 April 2010, pp. 548–550. IEEE Press, New York (2010)
Conway, J.H.: On Numbers and Games. AK Peters, Wellesley (2001)
Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, New York (1979)
Li, S.Y.R.: n-Person nim and n-person moore’s games. Int. J. Game Theory 7(1), 31–36 (1978)
Loeb, D.E.: Stable winning coalitions. In: Nowakowski, R.J. (ed.) Games of No Chance, pp. 451–471. Cambridge University Press, Cambridge (1996)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
Propp, J.G.: Three-player impartial games. Theoret. Comput. Sci. 233(1–2), 263–278 (2000)
Straffin Jr., P.D.: Three-person winner-take-all games with Mc-Carthy’s revenge rule. Coll. Math. J. 16(5), 386–394 (1985)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media B.V.
About this chapter
Cite this chapter
Cincotti, A. (2011). The Game of n-Player Shove and Its Complexity. In: Ao, SI., Castillo, O., Huang, X. (eds) Intelligent Control and Computer Engineering. Lecture Notes in Electrical Engineering, vol 70. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-0286-8_23
Download citation
DOI: https://doi.org/10.1007/978-94-007-0286-8_23
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-0285-1
Online ISBN: 978-94-007-0286-8
eBook Packages: EngineeringEngineering (R0)