Complexity, appeal and challenges of combinatorial games

Theoretical Computer Science

Volumn 313, Issue 3, 2004, Pages 393-415

  Fraenkel, Aviezri S ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Complexity of combinatorial games; MathGames; PlayGames

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; DECISION THEORY; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

COMPLEXITY OF COMBINATORIAL GAMES; MATHGAMES; PLAYGAMES;

GAME THEORY;

EID: 0842329856     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2002.11.001     Document Type: Conference Paper

References (91)

1. k) time J. Assoc. Comput. Mach. 31:1984;361-376.
2. E.R. Berlekamp, Some recent results on the combinatorial game called Welter's Nim, Proc. Sixth Ann. Princeton Conf. Information Science and Systems, 1972, pp. 203-204.
3. Berlekamp E.R. Blockbusting and domineering. J. Combin. Theory (Ser. A). 49:1988;67-116.
4. Berlekamp E.R. Introductory overview of mathematical Go endgames. Guy R.K. Combinatorial games. Proc. Symp. Appl. Math. Vol. 43:1991;73-100 American Mathematical Society, Providence, RI.
5. E.R. Berlekamp, Sums of N × 2 Amazons, in: F.T. Bruss, L.M. Le Cam (Eds.), Institute of Mathematical Statistics Lecture Notes - Monograph Series, Vol. 35, Institute of Mathematical Statistics, Beechwood, OH, 2000, pp. 1-34.
6. Berlekamp E.R. The Dots-and-Boxes Game: Sophisticated Child's Play. 2000;AK Peters, Natick, MA.
7. E.R. Berlekamp, J.H. Conway, R.K. Guy, Winning Ways for your Mathematical Plays, Vol. I & II, Academic Press, London, 1982; Vol. 1 (of four volumes) 2nd Edition, A K Peters, Natick, MA, 2001.
8. E.R. Berlekamp, Y. Kim, Where is the "Thousand-Dollar Ko?", in: R.J. Nowakowski (Ed.), Games of No Chance, Proc. MSRI Workshop on Combinatorial Games, July, 1994, Vol. 29, MSRI Publ., Berkeley, CA, Cambridge University Press, Cambridge, 1996, pp. 203-226.
9. Berlekamp E., Wolfe D. Mathematical Go - Chilling Gets the Last Point. 1994;A K Peters, Natick, MA.
10. T.C. Biedl, E.D. Demaine, M.L. Demaine, R. Fleischer, L. Jacobsen, I. Munro, The complexity of clickomania, in: R.J. Nowakowski (Ed.), More Games of No Chance, Proc. MSRI Workshop on Combinatorial Games, July, 2000, Vol. 42, MSRI Publ., Berkeley, CA, Cambridge University Press, Cambridge, 2002, pp. 389-404.
11. Blass U., Fraenkel A.S. The Sprague-Grundy function for Wythoff's game. Theoret. Comput. Sci. Math. Games. 75:1990;311-333.
12. Blass U., Fraenkel A.S., Guelman R. How far can Nim in disguise be stretched? J. Combin. Theory Ser. A. 84:1998;145-156.
13. Breuker D.M., Uiterwijk J.W.H.M., van den Herik H.J. Solving. 8 × 8 Domineering Theoret. Comput. Sci. (Math. Games). 230:2000;195-206.
14. S. Byrnes, Poset game periodicity, INTEGERS, Electr. J. Combin. Number Theory 3 (2003) 16pp, Combinatorial Games section, Paper G3.
15. J.H. Conway, On Numbers and Games, Academic Press, London, 1976; 2nd Edition, A K Peters, Natick, MA, 2001.
16. Conway J.H. Integral lexicographic codes. Discrete Math. 83:1990;219-235.
17. Conway J.H., Sloane N.J.A. Lexicographic codes. error-correcting codes from game theory IEEE Trans. Inform. Theory. IT-32:1986;337-348.
18. Coxeter H.S.M. The golden section, phyllotaxis and Wythoff's game. Scripta Math. 19:1953;135-143.
19. J. Culberson, Sokoban is PSPACE complete, in: Fun With Algorithms, Proc. in Informatics, Vol. 4, Carleton Scientific, University of Waterloo, Waterloo, Ont., 1999, pp. 65-76.
20. E.D. Demaine, M.L. Demaine, D. Eppstein, Phutball endgames are hard, in: R.J. Nowakowski (Ed.), More Games of No Chance, Proc. MSRI Workshop on Combinatorial Games, July 2000, Vol. 42, MSRI Publ., Berkeley, CA, Cambridge University Press, Cambridge, 2002, pp. 351-360.
21. Dress A., Flammenkamp A., Pink N. Additive periodicity of the Sprague-Grundy function of certain Nim games. Adv. Appl. Math. 22:1999;249-270.
22. Duvdevani N., Fraenkel A.S. Properties of. k -Welter's game Discrete Math. 76:1989;197-221.
23. S.P. Fekete, R. Fleischer, A.S. Fraenkel, M. Schmitt, Traveling salesmen in the age of competition, Theoret. Comput. Sci., to appear.
24. Ferguson T.S. Misère annihilation games. J. Combin. Theory Ser. A. 37:1984;205-230.
25. A.S. Fraenkel, Combinatorial games with an annihilation rule, in: J.P. LaSalle (Ed.), The Influence of Computing on Mathematical Research and Education, August 1973, Proc. Symp. Appl. Math., Vol. 20, Missoula, MT, American Mathematical Society, Providence, RI, 1974, pp. 87-91.
26. Fraenkel A.S. How to beat your Wythoff games' opponent on three fronts. Amer. Math. Monthly. 89:1982;353-361.
27. A.S. Fraenkel, Error-correcting codes derived from combinatorial games, in: R.J. Nowakowski (Ed.), Games of No Chance, Proc. MSRI Workshop on Combinatorial Games, Vol. 29, MSRI Publ., Berkeley, CA, Cambridge University Press, Cambridge, 1994, pp. 417-431.
28. A.S. Fraenkel, Scenic trails ascending from sea-level Nim to alpine chess, in: R.J. Nowakowski (Ed.), Games of No Chance, Proc. MSRI Workshop on Combinatorial Games, July 1994, Vol. 29, MSRI Publ., Berkeley, CA, Cambridge University Press, Cambridge, 1996, pp. 13-42.
29. A.S. Fraenkel, Virus versus mankind, Proc. Second Internat. Conf. on Computers and Games CG'2000, Hamamatsu, Japan, October 2000, Lecture Notes in Computer Science, Vol. 2063, Springer, Berlin, 2002, pp. 204-213.
30. Fraenkel A.S. Mathematical chats between two physicists. Wolfe D., Rodgers T. Puzzler's Tribute: a Feast for the Mind, honoring Martin Gardner. 2002;383-386 A K Peters, Natick, MA.
31. A.S. Fraenkel, Two-player games on cellular automata, in: R.J. Nowakowski (Ed.), More Games of No Chance, Proc. MSRI Workshop on Combinatorial Games, July 2000, Vol. 42, MSRI Publ., Berkeley, CA, Cambridge University Press, Cambridge, 2002, pp. 279-305.
32. Fraenkel A.S., Borosh I. A generalization of Wythoff's game. J. Combin. Theory Ser. A. 15:1973;175-191.
33. A.S. Fraenkel, M.R. Garey, D.S. Johnson, T. Schaefer, Y. Yesha, The complexity of checkers on an n×n board - preliminary report, Proc. 19th Ann. Symp. Foundations of Computer Science, Ann Arbor, MI, October 1978, IEEE Computer Society, Long Beach, CA, 1978, pp. 55-64.
34. Fraenkel A.S., Goldschmidt E. Pspace-hardness of some combinatorial games. J. Combin. Theory Ser. A. 46:1987;21-38.
35. Fraenkel A.S., Jaffray A., Kotzig A., Sabidussi G. Modular Nim. Theoret. Comput. Sci. (Math. Games). 143:1995;319-333.
36. Fraenkel A.S., Lichtenstein D. Computing a perfect strategy for. n×n chess requires time exponential in n J. Combin. Theory Ser. A. 31:1981;199-214.
37. Fraenkel A.S., Loebl M., Nešetřil J. Epidemiography II. Games with a dozing yet winning player. J. Combin. Theory A. 49:1988;129-144.
38. Fraenkel A.S., Lorberbom M. Epidemiography with various growth functions. Discrete Appl. Math. 25:1989;53-71.
39. Fraenkel A.S., Nešetřil J. Epidemiography. Pacific J. Math. 118:1985;369-381.
40. Fraenkel A.S., Ozery M. Adjoining to Wythoff's game its. P -positions as moves Theoret. Comput. Sci. 205:1998;283-296.
41. A.S. Fraenkel, O. Rahat, Complexity of error-correcting codes derived from combinatorial games, Proc. Internat. Conf. on Computers and Games CG'2002, Lecture Notes in Computer Science, Vol. 288, Springer, Berlin, 2003, pp. 201-221.
42. Fraenkel A.S., Scheinerman E. A deletion game on hypergraphs. Discrete Appl. Math. 30:1991;155-162.
43. Fraenkel A.S., Scheinerman E.R., Ullman D. Undirected edge geography. Theoret. Comput. Sci. (Math. Games). 112:1993;371-381.
44. Fraenkel A.S., Yesha Y. Theory of annihilation games. Bull. Amer. Math. Soc. 82:1976;775-777.
45. Fraenkel A.S., Yesha Y. Complexity of problems in games, graphs and algebraic equations. Discrete Appl. Math. 1:1979;15-30.
46. Fraenkel A.S., Yesha Y. Theory of annihilation games - I. J. Combin. Theory Ser. B. 33:1982;60-86.
47. Fraenkel A.S., Yesha Y. The generalized Sprague-Grundy function and its invariance under certain mappings. J. Combin. Theory Ser. A. 43:1986;165-177.
48. Fraenkel A.S., Zusman D. A new heap game. Theoret. Comput. Sci. 252:2001;5-12. (special "Computers and Games" issue).
49. Gale D. A curious Nim-type game. Amer. Math. Monthly. 81:1974;876-879.
50. Gale D., Neyman A. Nim-type games. Internat. J. Game Theory. 11:1982;17-20.
51. Galperin H., Wigderson A. Succinct representations of graphs. Inform. and Control. 56:1983;183-198.
52. M. Gardner, Games Column, Scientific American, January 1973, February 1973.
53. Gardner M. New Mathematical Diversions from Scientific American. 1983;University of Chicago Press, Chicago. (appeared before in 1971, Simon and Schuster, New York, NY. First appeared in 1966.).
54. M.R. Garey, D.S. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979, Appendix A8: Games and Puzzles, pp. 254-258.
55. Gilbert J.R., Lengauer T., Tarjan R.E. The pebbling problem is complete in polynomial space. SIAM J. Comput. 9:1980;513-524.
56. Goldstein A.S., Reingold E.M. The complexity of pursuit on a graph. Theoret. Comput. Sci. Math. Games. 143:1995;93-112.
57. R.K. Guy, R.J. Nowakowski, Unsolved problems in combinatorial games, in: R.J. Nowakowski (Ed.), More Games of No Chance, Proc. MSRI Workshop on Combinatorial Games, July 2000, Vol. 42, MSRI Publ., Berkeley, CA, Cambridge University Press, Cambridge, 2002, pp. 457-473.
58. Guy R.K., Smith C.A.B. The. G -values of various games Proc. Cambridge Philos. Soc. 52:1956;514-526.
59. Johnson D.S. The NP-completeness column. an ongoing guide J. Algorithms. 4:1983;397-411. (column dedicated to the complexity of games).
60. Jones J.P. Some undecidable determined games. Internat. J. Game Theory. 11:1982;63-70.
61. Jones J.P., Fraenkel A.S. Complexities of winning strategies in diophantine games. J. Complexity. 11:1995;435-455.
62. Kahane J., Fraenkel A.S. k -Welter - a generalization of Welter's game J. Combin. Theory Ser. A. 46:1987;1-20.
63. J. Kahane, A.J. Ryba, The Hexad game, Electron. J. Combin. 8 (2) (2001) 9pp, #R11, http://www.combinatorics.org/.
64. Kalmár L. Zur Theorie der abstrakten Spiele. Acta Sci. Math. Univ. Szeged. 4:1928;65-85.
65. Kim Y. New values in domineering. Theoret. Comput. Sci. Math. Games. 156:1996;263-280.
66. H. Landman, A simple FSM-based proof of the additive periodicity of the Sprague-Grundy function of Wythoff's game, in: R.J. Nowakowski (Ed.), More Games of No Chance, Proc. MSRI Workshop on Combinatorial Games, July 2000, Vol. 42, MSRI Publ., Berkeley, CA, Cambridge University Press, Cambridge, 2002, pp. 383-386.
67. Lichtenstein D., Sipser M. Go is Polynomial-space hard. J. Assoc. Comput. Mach. 27:1980;393-401.
68. Moews D. Coin-sliding and Go. Theoret. Comput. Sci. Math. Games. 164:1996;253-276.
69. D. Moews, Loopy games and Go, in: R.J. Nowakowski (Ed.), Games of No Chance, Proc. MSRI Workshop on Combinatorial Games, July 1994, Vol. 29, MSRI Publ., Berkeley, CA, Cambridge University Press, Cambridge, 1996, pp. 259-272.
70. Moore E.H. A generalization of the game called nim. Ann. Math. Ser. 2(11):1909-1910;93-94.
71. Morris F.L. Playing disjunctive sums is polynomial space complete. Internat. J. Game Theory. 10:1981;195-205.
72. R.J. Nowakowski,..., Welter's game, Sylver coinage, dots-and-boxes,..., in: R.K. Guy (Ed.), Combinatorial Games, Proc. Symp. Appl. Math., Vol. 43, American Mathematical Society, Providence, RI, 1991, pp. 155-182.
73. M.O. Rabin, Effective computability of winning strategies, Annals of Mathematical Studies (Contributions to the Theory of Games), Princeton, Vol. 3, No. 39, 1957, pp. 147-157.
74. Robertson E., Munro I. NP-completeness, puzzles and games. Utilitas Math. 13:1978;99-116.
75. Schaefer T.J. On the complexity of some two-person perfect-information games. J. Comput. System Sci. 16:1978;185-225.
76. Smith C.A.B. Graphs and composite games. J. Combin. Theory. 1:1966;51-81. (reprinted in slightly modified form, in: F. Harary (Ed.), A Seminar on Graph Theory, Holt, Rinehart and Winston, New York, NY, 1967).
77. Smith C.A.B. Graphs and composite games. J. Combin. Theory. 1:1966;51-81. (reprinted in slightly modified form, in: F. Harary (Ed.), A Seminar on Graph Theory, Holt, Rinehart and Winston, New York, NY, 1967).
78. Spight W.L. Extended thermography for multile kos in go. Theoret. Comput. Sci. 252:2001;23-43. (special "Computers and Games" issue).
79. Stockmeyer L.J., Chandra A.K. Provably difficult combinatorial games. SIAM J. Comput. 8:1979;151-174.
80. T. Takizawa, An application of mathematical game theory to Go endgames: some width-two-entrance rooms with and without kos, in: R.J. Nowakowski (Ed.), More Games of No Chance, Proc. MSRI Workshop on Combinatorial Games, July 2000, Vol. 42, MSRI Publ., Berkeley, CA, Cambridge University Press, Cambridge, 2002, pp. 108-124.
81. Úlehla J. A complete analysis of von Neumann's Hackendot. Internat. J. Game Theory. 9:1980;107-113.
82. C.P. Welter, The advancing operation in a special abelian group, Nederl. Akad. Wetensch. Proc. Ser. A 55 =Indag. Math. 14 (1952) 304-314.
83. C.P. Welter, The theory of a class of games on a sequence of squares, in terms of the advancing operation in a special group, Nederl. Akad. Wetensch. Proc. Ser. A 57 =Indag. Math. 16 (1954) 194-200.
84. J. West, Champion-level play of domineering, in: R.J. Nowakowski (Ed.), Games of No Chance, Proc. MSRI Workshop on Combinatorial Games, July 1994, Vol. 29, MSRI Publ., Berkeley, CA, Cambridge University Press, Cambridge, 1996, pp. 85-91.
85. Winkler P. Games people do not play. Wolfe D., Rodgers T. Puzzler's Tribute: a Feast for the Mind honoring Martin Gardner. 2002;301-313 A K Peters, Natick, MA.
86. Wolfe D. Snakes in domineering games. Theoret. Comput. Sci. Math. Games. 119:1993;323-329.
87. D. Wolfe, Go endgames are hard, in: R.J. Nowakowski (Ed.), More Games of No Chance, Proc. MSRI Workshop on Combinatorial Games, July 2000, Vol. 42, MSRI Publ., Berkeley, CA, Cambridge University Press, Cambridge, 2002, pp. 125-136.
88. D. Wolfe, T. Rodgers (Eds.), Puzzler's Tribute: a Feast for the Mind, Honoring Martin Gardner, A K Peters, Natick, MA, 2002.
89. Wythoff W.A. A modification of the game of Nim. Nieuw Arch. Wisk. 7:1907;199-202.
90. A.M. Yaglom, I.M. Yaglom, Challenging Mathematical Problems with Elementary Solutions, Vol. II, Holden-Day, San Francisco (Translated by J. McCawley Jr., revised and edited by B. Gordon, 1967).
91. L.J. Yedwab, On playing well in a sum of games, M.Sc. Thesis, MIT, Cambridge, MA, MIT/LCS/TR-348, 1985.