Counting the Number of Three-Player Partizan Cold Games
Conference paper
Abstract
We give upper and lower bounds on S 3[n] equal to the number of three-player partizan cold games born by day n. In particular, we give an upper bound of \(O(S_2[n]^3)\) and a lower bound of Ω(S 2[n]) where S 2[n] is the number of surreal numbers born by day n.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning Ways For Your Mathematical Plays. Academic Press, San Diego (1982)MATHGoogle Scholar
- 2.Cincotti, A.: Three-Player Partizan Games. Theoretical Computer Science 332, 367–389 (2005)MATHCrossRefMathSciNetGoogle Scholar
- 3.Conway, J.H.: On Numbers and Games. Academic Press, San Diego (1976)MATHGoogle Scholar
- 4.Knuth, D.: Surreal Numbers. Addison-Wesley, London, UK (1974)MATHGoogle Scholar
- 5.Li, S.Y.R.: N-Person Nim and N-Person Moore’s Games. Game Theory 7, 31–36 (1978)MATHCrossRefGoogle Scholar
- 6.Loeb, D.E.: Stable Winning Coalitions. In: Nowakowski, R.J. (ed.) Games of No Chance, vol. 29, pp. 451–471. MSRI Publ. Cambridge University Press (1994)Google Scholar
- 7.Propp, J.: Three-player Impartial games. Theoretical Computer Science 233, 263–278 (2000)MATHCrossRefMathSciNetGoogle Scholar
- 8.Straffin Jr., P.D.: Three-Person Winner-Take-All Games with Mc-Carthy’s Revenge Rule. College Journal of Mathetmatics 16, 386–394 (1985)MATHCrossRefMathSciNetGoogle Scholar
- 9.Wolfe, D., Fraser, W.: Counting the Number of Games. Theoretical Computer Science 313, 527–532 (2004)MATHCrossRefMathSciNetGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2007