Abstract
Combinatorial game theory is the study of two player perfect information games. While work has been done in the past on expanding this field to include n-player games we present a unique method which guarantees a single winner. Specifically our goal is to derive a function which, given an n-player game, is able to determine the winning player (assuming all n players play optimally). Once this is accomplished we use this function in analyzing a certain family of three player subtraction games along with a complete analysis of three player, three row Chomp. Furthermore we make use of our new function in producing alternative proofs to various well known two player Chomp games. Finally the paper presents a possible method of analyzing a two player game where one of the players plays a completely random game. As it turns out this slight twist to the rules of combinatorial game theory produces rather interesting results and is certainly worth the time to study further.
Similar content being viewed by others
References
Berlekamp ER, Conway JH, Guy RK (2004) Winning ways for your mathematical plays. A. K. Peters, Wellesley
Berlekamp ER, et al (1991) In: Guy RK (ed) Combinatorial games. American Mathematical Society, Providence
Cincotti A (2010) N-player partizan games. Theor Comput Sci 411: 3224–3234
Li S-YR (1978) N-person Nim and n-person Moore’s Games. J Int J Game Theory 7(1): 6–31
Loeb DE (1996) Stable winning coalitions, games of no chance. In: Nowakowski RJ (ed) Proc. MSRI workshop on combinatorial games, CA MSRI Publ. vol 29. Cambridge University Press, Cambridge, pp 451–471
Propp J (2000) Three-player impartial games. Theor Comput Sci 233: 263–278
Straffin PD (1985) Three-person winner-take-all games with Mc-Carthy’s revenge rule. Coll J Math 16: 386–394
Sun X (2002) Improvements on Chomp. Integers Electron J Comb Number Theory 2:1–8. http://www.integers-ejcnt.org/vol2.html
Zeilberger D (2001) Three rowed Chomp. Adv Appl Math 26: 168–179
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Krawec, W.O. Analyzing n-player impartial games. Int J Game Theory 41, 345–367 (2012). https://doi.org/10.1007/s00182-011-0289-3
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00182-011-0289-3