Abstract
The game of N-player White-Black Cutthroat is an n-player version of White-Black Cutthroat, a two-player combinatorial game played on graphs. Because of queer games, i.e., games where no player has a winning strategy, cooperation is a key-factor in n-player games and, as a consequence, n-player White-Black Cutthroat played on stars is PSPACE-complete.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Albert MH, Nowakowski RJ, Wolfe D (2007) Lessons in play: an introduction to combinatorial game theory. AK Peters, USA
Berlekamp ER, Conway JH, Guy RK (2001) Winning way for your mathematical plays. AK Peters, USA
Cincotti A (2005) Three-player partizan games. Theor Comput Sci 332(1–3):367–389
Cincotti A (2009) On the complexity of n-player Hackenbush. Integers 9:621–627
Cincotti A (2010) N-player partizan games. Theor Comput Sci 411(34–36):3224–3234
Cincotti A (2010) On the complexity of n-player Toppling Dominoes. In: Ao SI, Castillo O, Douglas C, Feng DD, Lee J (eds) Lecture notes in engineering and computer science: Proceedings of the international MultiConference of engineers and computer scientists 2010, IMECS 2010, 17–19 March, 2010, Hong Kong. Newswood Limited, pp 461–464
Cincotti A (2010) On the complexity of n-player cherries. In: Hang Y, Desheng W, Sandhu PS (eds) Proceedings of the 2010 3rd IEEE international conference on computer science and information technology, 9-11 July, 2010, Chengdu. IEEE Press, pp 481–483
Cincotti A (2010) On the complexity of some map-coloring multi-player games. In: Ao SI, Castillo O, Huang H (eds) Intelligent automation and computer engineering, vol 52 of LNEE. Springer, pp 271–278
Cincotti A (2010) The game of n-player Shove and its complexity. In: Ao SI, Castillo O, Huang H (eds) Intelligent control and computer engineering, vol 70 of LNEE. Springer, pp 285–292
Cincotti A (2011) N-player Cutthroat played on stars is PSPACE-complete. In: Ao SI, Castillo O, Douglas C, Feng DD, Lee J (eds) Lecture notes in engineering and computer science: Proceedings of the international MultiConference of engineers and computer scientists 2011, IMECS 2011, 16–18 March, 2011, Hong Kong. Newswood Limited, pp 269–271
Conway JH (2001) On numbers and games. A K Peters, USA
Li SYR (1978) n-person nim and n-person moore’s games. Intl J Game Theor 7(1):31–36
Loeb DE (1996) Stable winning coalitions. In: Nowakowski RJ (ed) Games of no chance. Cambridge University Press, Cambridge, pp 451–471
McCurdy SK (2003) Cherries and cutthroat: two games on graphs. Master’s thesis, Dalhousie University
McCurdy SK (2005) Cutthroat, an all-small game on graphs. INTEGERS: Electron J Combin Number Theor 5(2):#A13
Papadimitriou CH (1994) Computational complexity. Addison-Wesley, MA
Propp JG (2000) Three-player impartial games. Theor Comput Sci 233(1–2):263–278
Straffin Jr PD (1985) Three-person winner-take-all games with mc-carthy’s revenge rule. Coll Math J 16(5):386–394
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Cincotti, A. (2012). The Game of n-Player White-Black Cutthroat and Its Complexity. In: Ao, S., Castillo, O., Huang, X. (eds) Intelligent Control and Innovative Computing. Lecture Notes in Electrical Engineering, vol 110. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-1695-1_24
Download citation
DOI: https://doi.org/10.1007/978-1-4614-1695-1_24
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-1694-4
Online ISBN: 978-1-4614-1695-1
eBook Packages: EngineeringEngineering (R0)