Parallel Chip Firing Game Associated with n- cube Edges Orientations
暂无分享,去创建一个
[1] I. Althöfer. Nim games with arbitrary periodic moving orders , 1988 .
[2] Elwyn R. Berlekamp,et al. The Hackenbush Number System for Compression of Numerical Data , 1974, Inf. Control..
[3] Thomas Ströhlein,et al. On Kernels of Graphs and Solutions of Games: A Synopsis Based on Relations and Fixpoints , 1985 .
[4] Philip D. Straffin,et al. Game theory and strategy , 1993 .
[5] John H. Reif,et al. Multiple-person alternation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[6] Alfred Lehman,et al. A Solution of the Shannon Switching Game , 1964 .
[7] Hal A. Kierstead,et al. Very Asymmetric Marking Games , 2005, Order.
[8] Markus Holzer,et al. Assembling molecules in ATOMIX is hard , 2004, Theor. Comput. Sci..
[9] Jordan Carlson,et al. The correct solution to Berlekamp's switching game , 2004, Discret. Math..
[10] Edward W. Packel,et al. The algorithm designer versus nature: A game-theoretic approach to information-based complexity , 1987, J. Complex..
[11] Gordon T. Wilfong. Motion planning in the presence of movable obstacles , 1988, SCG '88.
[12] Scott P. Nudelman,et al. The modular n-queens problem in higher dimensions , 1995, Discret. Math..
[13] Aviezri S. Fraenkel,et al. Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N , 1981, ICALP.
[14] Joan Feigenbaum,et al. Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions , 1993, STOC.
[15] Gary William Flake,et al. Rush Hour is PSPACE-complete, or "Why you should generously tip parking lot attendants" , 2002, Theoretical Computer Science.
[16] Heiko Harborth,et al. King independence on triangle boards , 2003, Discret. Math..
[17] Suzanne M. Seager,et al. The chip firing game onn-cycles , 1995, Graphs Comb..
[18] Patrick J. Hayes,et al. Discussion and correspondence A note on the Towers of Hanoi problem , 1977 .
[19] P. Stockmeyer. The Average Distance between Nodes in the Cyclic Tower of Hanoi Digraph , 1996 .
[20] Aviezri S. Fraenkel,et al. Complexity of problems in games, graphs and algebraic equations , 1979, Discret. Appl. Math..
[21] Jeffrey C. Lagarias,et al. Single-Suit Two-Person Card Play III. The Misère Game , 1989, SIAM J. Discret. Math..
[22] Paul Erdös,et al. On a Combinatorial Game , 1973, J. Comb. Theory A.
[23] Osamu Watanabe,et al. Games with Uniqueness Properties , 2003, Theory of Computing Systems.
[24] Philip D. Straffin,et al. Position Graphs for Pong Hau K'i and Mu Torere , 1995 .
[25] R. Banerji,et al. PERIODICITY OF SPRAGUE-GRUNDY FUNCTION IN GRAPHS WITH DECOMPOSABLE NODES , 1982 .
[26] Joseph W. Creely. THE LENGTH OF A THREE-NUMBER GAME , 1988 .
[27] Thomas J. Schaefer,et al. On the Complexity of Some Two-Person Perfect-Information Games , 1978, J. Comput. Syst. Sci..
[28] John Michael Robson,et al. The Complexity of Go , 1983, IFIP Congress.
[29] Xinyu Sun,et al. On Fraenkel’s N-Heap Wythoff’s Conjectures , 2004 .
[30] D. Gale. The Game of Hex and the Brouwer Fixed-Point Theorem , 1979 .
[31] Xiaoyun Lu,et al. A Hamiltonian game on Kn, n , 1995, Discret. Math..
[32] G. Cairns. Pillow Chess , 2002 .
[33] Eric Goles Ch.,et al. Games on Line Graphs and Sand Piles , 1993, Theor. Comput. Sci..
[34] Eric Goles Ch.,et al. The structure of a linear chip firing game and related models , 2002, Theor. Comput. Sci..
[35] Ivor P. Page,et al. On the towers of Hanoi problem with multiple spare pegs , 1994 .
[36] Sampath Kannan,et al. Randomized Pursuit-Evasion with Local Visibility , 2006, SIAM J. Discret. Math..
[37] Catherine H. Yan,et al. The Rényi-Ulam pathological liar game with a fixed number of lies , 2005, J. Comb. Theory, Ser. A.
[38] Judea Pearl,et al. Asymptotic Properties of Minimax Trees and Game-Searching Procedures , 1980, Artif. Intell..
[39] William S. Zwicker,et al. Playing games with games: the hypergame paradox , 1987 .
[40] Martin Gardner,et al. Fractal music, hypercards and more , 1995, The Mathematical Gazette.
[41] Aviezri S. Fraenkel. Nim is Easy, Chess is Hard - But Why?? , 2006, J. Int. Comput. Games Assoc..
[42] C. Smith,et al. Some Binary Games , 1944, The Mathematical Gazette.
[43] E. Berlekamp. The Economist's View of Combinatorial Games , 1996 .
[44] Kimmo Eriksson,et al. The numbers game and coxeter groups , 1995, Discret. Math..
[45] Iain A. Stewart,et al. A note on first-order projections and games , 2003, Theor. Comput. Sci..
[46] Michael D. Ernst. Playing Konane Mathematically: A Combinatorial Game-Theoretic Analysis , 1995 .
[47] Thi Ha Duong Phan,et al. Characterization of Lattices Induced by (extended) Chip Firing Games , 2001, DM-CCG.
[48] Jayme Luiz Szwarcfiter,et al. Enumerating the Kernels of a Directed Graph with no Odd Circuits , 1994, Inf. Process. Lett..
[49] David S. Johnson,et al. The complexity of checkers on an N × N board , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[50] P. A. Macmahon,et al. New Mathematical Pastimes , 1922, Nature.
[51] C. P. Welter,et al. The Theory of a Class of Games on a Sequence of Squares, in Terms of the Advancing Operation in a Special Group , 1954 .
[52] Jennifer Ryan,et al. Probabilities Within optimal Strategies for Tournament Games , 1995, Discret. Appl. Math..
[53] Aviezri S. Fraenkel,et al. The Sprague-Grundy Function for Wythoff's Game , 1990, Theor. Comput. Sci..
[54] Hortensia Galeana-Sánchez,et al. Some sufficient conditions on odd directed cycles of bounded length for the existence of a kernel , 2004, Discuss. Math. Graph Theory.
[55] H. T. Croft. “Lion and Man”: A Postscript , 1964 .
[56] Ingo Althöfer,et al. Superlinear Period Lengths in Some Subtraction Games , 1995, Theor. Comput. Sci..
[57] Richard Ehrenborg,et al. Playing Nim on a Simplicial Complex , 1996, Electron. J. Comb..
[58] Dieter Kratsch,et al. Kayles and Nimbers , 2002, J. Algorithms.
[59] Aviezri S. Fraenkel,et al. The generalized Sprague-Grundy function and its invariance under certain mappings , 1986, J. Comb. Theory, Ser. A.
[60] Anne L. Ludington. LENGTH OF THE 7-NUMBER GAME , 1988 .
[61] Markus Holzer,et al. TantrixTM rotation puzzles are intractable , 2004, Discret. Appl. Math..
[62] Allen J. Schwenk,et al. What Is the Correct Way to Seed a Knockout Tournament? , 2000, Am. Math. Mon..
[63] Andrzej Czygrinow,et al. A Note on Graph Pebbling , 2002, Graphs Comb..
[64] Andrzej Pelc,et al. Lie Patterns in Search Procedures , 1986, Theor. Comput. Sci..
[65] Fan Chung Graham,et al. Pebbling in Hypercubes , 1989, SIAM J. Discret. Math..
[66] Christian Deppe,et al. Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes , 2000, Discret. Math..
[67] Yahya Ould Hamidoune,et al. On a Pursuit Game on Cayley Digraphs , 1987, Eur. J. Comb..
[68] David Wolfe,et al. Counting the number of games , 2004, Theor. Comput. Sci..
[69] Ian Stewart,et al. Concentration: A Winning Strategy , 1991 .
[70] Robert E. Tarjan,et al. Asymptotically tight bounds on time-space trade-offs in a pebble game , 1982, JACM.
[71] J. A. Flanigan. A complete analysis of Black-White Hackendot , 1982 .
[72] Walter Stromquist,et al. Sequential Compounds of Combinatorial Games , 1993, Theor. Comput. Sci..
[73] Martin Gardner,et al. Codes, ciphers, and secret writing , 1972 .
[74] M. Gardner. Order and Surprise , 1950, Philosophy of Science.
[75] Ian G. Connell,et al. Some Properties of Beatty Sequences I* , 1959, Canadian Mathematical Bulletin.
[76] Zoltán Füredi,et al. Maximal triangle-free graphs with restrictions on the degrees , 1994 .
[77] Martin Gardner,et al. New Mathematical Diversions from "Scientific American" , 1971, The Mathematical Gazette.
[78] Cameron Browne,et al. Fractal board games , 2006, Comput. Graph..
[79] Alberto Pedrotti. Playing by searching: two strategies against a linearly bounded liar , 2002, Theor. Comput. Sci..
[80] Uri Zwick,et al. SOKOBAN and other motion planning problems , 1999, Comput. Geom..
[81] V. Stepanenko. Grundy games under conditions of semidefiniteness , 1975 .
[82] Daniel Berend,et al. On a question of Leiss regarding the Hanoi Tower problem , 2006, Theor. Comput. Sci..
[83] Hortensia Galeana-Sánchez,et al. On claw-free M-oriented critical kernel-imperfect digraphs , 1996, J. Graph Theory.
[84] Martin Gardner,et al. Hexaflexagons And Other Mathematical Diversions , 1989, The Mathematical Gazette.
[85] C. P. Welter,et al. The advancing operation in a special abelian group , 1952 .
[86] Richard H. Schelp,et al. A New Game Chromatic Number , 1997, Eur. J. Comb..
[87] John C. Harsanyi,et al. Games with Incomplete Information , 1994 .
[88] Andrzej Pelc,et al. Searching games with errors - fifty years of coping with liars , 2002, Theor. Comput. Sci..
[89] Alberto Trombetta,et al. Optimal Comparison Strategies in Ulam's Searching Game with Two Errors , 1997, Theor. Comput. Sci..
[90] Xue-Miao Lu,et al. An Iterative Solution for the 4-Peg Towers of Hanoi , 1989, Comput. J..
[91] 山崎 洋平. Theory of connexes , 1985 .
[92] H. Jaap van den Herik,et al. GO‐MOKU SOLVED BY NEW SEARCH TECHNIQUES , 1996, Comput. Intell..
[93] Kimmo Eriksson,et al. Strong Convergence and a Game of Numbers , 1996, Eur. J. Comb..
[94] A. Cincotti. Three-player partizan games , 2005, Theor. Comput. Sci..
[95] K. Stolarsky. From Wythoff's Nim to Chebyshev's inequality , 1991 .
[96] Harold Reiter,et al. Dynamic One-Pile Blocking Nim , 2003, Electron. J. Comb..
[97] Pantelimon Stănică,et al. COMPLY/CONSTRAIN GAMES OR GAMES WITH A MULLER TWIST , 2002 .
[98] Norman Biggs,et al. Chip-Firing and the Critical Group of a Graph , 1999 .
[99] B. L. Schwartz. Some Extensions of Nim , 1971 .
[100] O. Hanner. Mean play of sums of positional games , 1959 .
[101] Hal A. Kierstead,et al. Planar Graph Coloring with an Uncooperative Partner , 1994, Planar Graphs.
[102] F. L. Morris. Playing disjunctive sums is polynomial space complete , 1981 .
[103] Edward R. Scheinerman,et al. A deletion game on hypergraphs , 1991, Discret. Appl. Math..
[104] Fedor V. Fomin. Note on a Helicopter Search Problem on Graphs , 1999, Discret. Appl. Math..
[105] R. Silver. The Group of Automorphisms of the Game of 3-Dimensional Ticktacktoe , 1967 .
[106] Greg Simmons. The Game of SIM , 2019, Mathematical Solitaires & Games.
[107] Yohei Yamasaki,et al. The Arithmetic of Reversed Positional Games , 1997, Theor. Comput. Sci..
[108] James Gary Propp. Three-player impartial games , 2000, Theor. Comput. Sci..
[109] J. Flanigan. GENERALIZED TWO-PILE FIBONACCI NIM , 1978 .
[110] Rudolf Fleischer,et al. Kayles on the Way to the Stars , 2004, Computers and Games.
[111] Alewyn P. Burger,et al. An upper bound for the minimum number of queens covering the n x n chessboard , 2002, Discret. Appl. Math..
[112] Hans L. Bodlaender,et al. Complexity of Path-Forming Games , 1993, Theor. Comput. Sci..
[113] M. C. Er,et al. The Complexity of the Generalised Cyclic Towers of Hanoi Problem , 1985, J. Algorithms.
[114] R Efer Ence,et al. The Game of Quatrainment , 1988 .
[115] Eric Goles,et al. Sand Piles, Combinatorial Games and Cellular Automata , 1991 .
[116] Hortensia Galeana-Sánchez,et al. Kernels in quasi-transitive digraphs , 2006, Discret. Math..
[117] Aviezri S. Fraenkel. Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches , 1983, ICALP.
[118] Ioan Tomescu,et al. Almost all digraphs have a kernel , 1990, Discret. Math..
[119] Stefan Reisch,et al. Hex ist PSPACE-vollständig , 1981, Acta Informatica.
[120] Michael J. Fischer,et al. An Application of Game-Theoretic Techniques to Cryptography , 1990, Advances In Computational Complexity Theory.
[121] Klaus Sutner,et al. On the Computational Complexity of Finite Cellular Automata , 1995, J. Comput. Syst. Sci..
[122] R. D. Ringeisen,et al. Isolation, a Game on a Graph , 1974 .
[123] James Flynn,et al. Lion and Man: The General Case , 1974 .
[124] Elwyn R. Berlekamp,et al. Analysis of Composite Corridors , 2002, Computers and Games.
[125] Shigeki Iwata,et al. Low level complexity for combinatorial games , 1981, STOC '81.
[126] Cristóbal Pareja-Flores,et al. Two Reflected Analyses of Lights Out , 2001 .
[127] G. A. Hedlund,et al. Unending chess, symbolic dynamics and a problem in semigroups , 1944 .
[128] Cameron Browne,et al. Connection Games - Variations on a Theme , 2005 .
[129] Ronald L. Graham,et al. Pebbling a Chessboard , 1995 .
[130] Edward R. Scheinerman,et al. Undirected Edge Geography , 1993, Theor. Comput. Sci..
[131] G. E. Farr,et al. The Go polynomials of a graph , 2003, Theor. Comput. Sci..
[132] Martin Aigner,et al. Searching with Lies , 1996, J. Comb. Theory, Ser. A.
[133] Aviezri S. Fraenkel,et al. Complexity of Error-Correcting Codes Derived from Combinatorial Games , 2002, Computers and Games.
[134] Judea Pearl,et al. A Minimax Algorithm Better Than Alpha-Beta? Yes and No , 1983, Artif. Intell..
[135] Stephan Dominique Andres. Game-perfect Graphs with Clique Number 2 , 2006, Electron. Notes Discret. Math..
[136] M. C. Er,et al. The Cyclic Towers of Hanoi: A Representation Approach , 1984, Comput. J..
[137] P. Hinman. Finite termination games with tie , 1972 .
[138] Christian Deppe. Strategies for the Renyi-Ulam Game with fixed number of lies , 2004, Theor. Comput. Sci..
[139] Richard J. Nowakowski,et al. Copnumber Of Graphs With Strong Isometric Dimension Two , 2001, Ars Comb..
[140] J. Shallit,et al. Morphisms, Squarefree Strings, and the Tower of Hanoi Puzzle , 1994 .
[141] Steven J. Brams,et al. The Box Problem: To Switch or Not to Switch , 1995 .
[142] Paul W. Rendell,et al. Turing Universality of the Game of Life , 2002, Collision-Based Computing.
[143] A. M. Hinz,et al. Pascal's triangle and the tower of Hanoi , 1992 .
[144] Rong-Jaye Chen,et al. The Towers of Hanoi Problem with Cyclic Parallel Moves , 1993, Inf. Process. Lett..
[145] Nathan Reading. Nim-Regularity of Graphs , 1999, Electron. J. Comb..
[146] Somenath Biswas,et al. The generalized towers of Hanoi , 1979, SIGA.
[147] William D. Weakley. Upper bounds for domination numbers of the queen's graph , 2002, Discret. Math..
[148] Xuding Zhu,et al. Relaxed game chromatic number of outer planar graphs , 2006, Ars Comb..
[149] Pierre Duchet,et al. A sufficient condition for a digraph to be kernel-perfect , 1987, J. Graph Theory.
[150] Eric Goles Ch.,et al. Universality of the Chip-Firing Game , 1997, Theor. Comput. Sci..
[151] Shuo-Yen Robert Li,et al. Sums of Zuchswang Games , 1976, J. Comb. Theory, Ser. A.
[152] Joel H. Spencer,et al. Balancing vectors in the max norm , 1986, Comb..
[153] Nándor Sieben,et al. Polyomino weak achievement games on 3-dimensional rectangular boards , 2005, Discret. Math..
[154] Aviezri S. Fraenkel,et al. Planar kernel and grundy with d≤3, dout≤2, din≤2 are NP-complete , 1981, Discret. Appl. Math..
[155] George C. Stockman,et al. A Minimax Algorithm Better than Alpha-Beta? , 1979, Artif. Intell..
[156] H. Jaap van den Herik,et al. Solving 8×8 Domineering , 1999, Theor. Comput. Sci..
[157] Moti Yung,et al. Divide and Conquer under Global Constraints: A Solution to the N-Queens Problem , 1989, J. Parallel Distributed Comput..
[158] Takenobu Takizawa. An Application of Mathematical Game Theory to Go Endgames: some Width-Two-Entrance Rooms With and Without Kos , 2002 .
[159] Joel H. Spencer,et al. Ulam's Searching Game with a Fixed Number of Lies , 1992, Theor. Comput. Sci..
[160] M. C. Er,et al. A Representation Approach to the Tower of Hanoi Problem , 1982, Comput. J..
[161] F. A. Bostock,et al. Infinite deterministic graphical games , 1993 .
[162] Fred Galvin,et al. An ideal game , 1978, Journal of Symbolic Logic.
[163] Aviezri S. Fraenkel,et al. Adjoining to Wythoff's Game its P-Positions as Moves , 1998, Theor. Comput. Sci..
[164] Norihide Tokushige,et al. The game of n-times nim , 2003, Discret. Math..
[165] Shigeki Iwata,et al. Classes of pebble games and complete problems , 1979, ACM '78.
[166] U. Faigle,et al. On the game chromatic number of some classes of graphs , 1991 .
[167] Manouchehr Zaker,et al. Results on the Grundy chromatic number of graphs , 2006, Discret. Math..
[168] Aviezri S. Fraenkel,et al. Complexity, appeal and challenges of combinatorial games , 2004, Theor. Comput. Sci..
[169] T. R. Walsh,et al. Iteration Strikes Back - at the Cyclic Towers of Hanoi , 1983, Inf. Process. Lett..
[170] Michael Tarsi,et al. Optimal Search on Some Game Trees , 1983, JACM.
[171] Daniel Berend,et al. The diameter of Hanoi graphs , 2006, Inf. Process. Lett..
[172] Eric Goles Ch.,et al. Sandpile models and lattices: a comprehensive survey , 2004, Theor. Comput. Sci..
[173] Erik D. Demaine,et al. The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications , 2002, ICALP.
[174] Paul Cull,et al. Error-correcting codes on the towers of Hanoi graphs , 1999, Discret. Math..
[175] Chris Cannings,et al. Montreal Solitaire , 1992, J. Comb. Theory, Ser. A.
[176] Hortensia Galeana-Sánchez,et al. New Extensions of Kernel Perfect Digraphs to Kernel Imperfect Critical Digraphs , 1994, Graphs Comb..
[177] J. Spencer,et al. Disks, balls, and walls: analysis of a combinatorial game , 1989 .
[178] Kimmo Eriksson,et al. Strong convergence and the polygon property of 1-player games , 1996, Discret. Math..
[179] Aviezri S. Fraenkel. Heap games, numeration systems and sequences , 1998 .
[180] John Michael Robson,et al. N by N Checkers is Exptime Complete , 1984, SIAM J. Comput..
[181] Bala Ravikumar,et al. Coping with Known Patterns of Lies in a Search Game , 1984, Theor. Comput. Sci..
[182] John H. Reif,et al. The Complexity of Two-Player Games of Incomplete Information , 1984, J. Comput. Syst. Sci..
[183] T. R. Walsh,et al. The Towers of Hanoi Revisited: Moving the Rings by Counting the Moves , 1982, Inf. Process. Lett..
[184] Peter B. Gibbons,et al. Some new results for the queens domination problem , 1997, Australas. J Comb..
[185] Ivan Bratko,et al. Ideas on Knowledge Synthesis Stemming from the KBBKN Endgame , 1987, J. Int. Comput. Games Assoc..
[186] A. Negro,et al. Ulam's searching game with three lies , 1992 .
[187] P. Stockmeyer. The Tower of Hanoi: A Bibliography , 2005 .
[188] David Gale,et al. Further Travels with My Ant , 1998 .
[189] Olof Heden,et al. On the modular n-queen problem , 1992, Discret. Math..
[190] Imre Bárány,et al. On a Class of Balancing Games , 1979, J. Comb. Theory A.
[191] Allen J. Schwenk,et al. Which Rectangular Chessboards Have a Knight's Tour? , 1991 .
[192] Klaus Sutner,et al. On σ-Automata , 1988, Complex Syst..
[193] E. Berlekamp,et al. Winning Ways for Your Mathematical Plays , 1983 .
[194] J. L. Walsh,et al. The Name of the Game of Nim , 1953, The Mathematical Gazette.
[195] Kurt Mehlhorn,et al. On the complexity of a game related to the dictionary problem , 1989, 30th Annual Symposium on Foundations of Computer Science.
[196] Sandi Klavzar,et al. On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem , 2002, Discret. Appl. Math..
[197] Aviezri S. Fraenkel,et al. Properties of K-Welter's game , 1989, Discret. Math..
[198] Xuding Zhu,et al. Edge‐partitions of planar graphs and their game coloring numbers , 2002, J. Graph Theory.
[199] Ahiezer S. Shaki,et al. Algebraic solutions of partizan games with cycles , 1979, Mathematical Proceedings of the Cambridge Philosophical Society.
[200] Ratislav Telegársky. Topological games: On the 50th anniversary of the Banach Mazur game , 1987 .
[201] Juan E. Tapiador,et al. Steganography in games: A general methodology and its application to the game of Go , 2006, Comput. Secur..
[202] Oliver Pretzel,et al. Characterization of simple edge-firing games , 2002, Inf. Process. Lett..
[203] Rüdeger Baumann,et al. Games of Strategy , 1982 .
[204] A. Ehrenfeucht,et al. Positional strategies for mean payoff games , 1979 .
[205] Ingo Althöfer,et al. On the Complexity of Searching Game Trees and Other Recursion Trees , 1988, J. Algorithms.
[206] Hal A. Kierstead. Weak acyclic coloring and asymmetric coloring games , 2006, Discret. Math..
[207] Andrzej Pelc,et al. Searching with a Forbidden Lie Pattern in Responses , 1991, Inf. Process. Lett..
[208] James A. Flanigan,et al. Slow Joins of Loopy Games , 1983, J. Comb. Theory, Ser. A.
[209] Eric Goles Ch.,et al. Source reversal and chip firing on graphs , 2000, Theor. Comput. Sci..
[210] Robbie Bell,et al. Board games round the world : a resource book for mathematical investigations / Robbie Bell, Michael Cornelius , 1989 .
[211] Richard J. Nowakowski,et al. Cops, Robber and traps. , 2001 .
[212] Martin Gardner,et al. Perplexing puzzles and tantalizing teasers , 1969 .
[213] Ervin Y. Rodin,et al. A Pursuit-evasion bibliography—Version 2 , 1989 .
[214] Edward Hordern,et al. Sliding Piece Puzzles , 1987 .
[215] Aviezri S. Fraenkel,et al. Even Kernels , 1994, Electron. J. Comb..
[216] B. Gebhard. Fads and Fallacies in the Name of Science , 1958 .
[217] M. Tchuente,et al. Comportement dynamique d'un réseau d'automates associés aux orientations d'un graphe , 1994 .
[218] Robert E. Tarjan,et al. Space bounds for a game on graphs , 1976, STOC '76.
[219] Torleiv Kløve,et al. The modular n-queen problem , 1977, Discret. Math..
[220] Lewis Stiller. Group graphs and computational symmetry on massively parallel architecture , 1990, Supercomputing '90.
[221] Lionel Levine. Fractal Sequences and Restricted Nim , 2006, Ars Comb..
[222] Vladimir Gurvich,et al. Perfect graphs are kernel solvable , 1996, Discret. Math..
[223] Joel H. Spencer,et al. Randomization, Derandomization and Antirandomization: Three Games , 1994, Theor. Comput. Sci..
[224] C. Kimberling. Complementary Equations , 2006 .
[225] Andreas W. M. Dress,et al. Additive Periodicity of the Sprague-Grundy Function of Certain Nim Games , 1999 .
[226] D. Mundici. Logic and Algebra in Ulam's Searching Game with Lies , 2005 .
[227] Shigeki Iwata,et al. Some combinatorial game problems require Ω(nk) time , 1984, JACM.
[228] Thomas Andreae,et al. On a pursuit game played on graphs for which a minor is excluded , 1986, J. Comb. Theory, Ser. B.
[229] A. Fraenkel. Iterated floor function, algebraic numbers, discrete chaos, Beatty subsequences, semigroups , 1994 .
[230] Elwyn R. Berlekamp,et al. Blockbusting and domineering , 1988, J. Comb. Theory, Ser. A.
[231] Gábor Tardos,et al. Polynomial Bound for a Chip Firing Game on Graphs , 1988, SIAM J. Discret. Math..
[232] O. Itzinger. The South American Game , 1977 .
[233] E. J. COCKAYNE,et al. Chessboard domination problems , 1991, Discret. Math..
[234] Erik D. Demaine,et al. PushPush and Push-1 are NP-hard in 2D , 2000, CCCG.
[235] de Ng Dick Bruijn. Pretzel solitaire as a pastime for the lonely mathematician , 1981 .
[236] I. M. Asel'derova. On a certain discrete pursuit game on graphs , 1974, Cybernetics.
[237] E. Berkove,et al. AN ANALYSIS OF THE ( COLORED CUBES ) 3 PUZZLE , 2022 .
[238] Amir Sapir,et al. The Tower of Hanoi with Forbidden Moves , 2004, Comput. J..
[239] U. Krengel,et al. On the game of googol , 1992 .
[240] Ichiro Suzuki,et al. Optimal Algorithms for a Pursuit-Evasion Problem in Grids , 1989, SIAM J. Discret. Math..
[241] Ferdinando Cicalese,et al. Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness , 1999, ESA.
[242] K. Stolarsky,et al. A SET OF GENERALIZED FIBONACCI SEQUENCES SUCH THAT EACH NATURAL NUMBER BELONGS TO EXACTLY ONE , 1971 .
[243] David Eugene Smith,et al. Rithmomachia, the Great Medieval Number Game , 1911 .
[244] Theodore P. Hill,et al. Minimax-Optimal Stop Rules and Distributions in Secretary Problems , 1991 .
[245] E. J.,et al. ON THE COMPLEXITY OF MOTION PLANNING FOR MULTIPLE INDEPENDENT OBJECTS ; PSPACE HARDNESS OF THE " WAREHOUSEMAN ' S PROBLEM " . * * ) , 2022 .
[246] Sandi Klavzar,et al. Combinatorics of topmost discs of multi-peg Tower of Hanoi problem , 2001, Ars Comb..
[247] Klaus Sutner,et al. Linear cellular automata and the garden-of-eden , 1989 .
[248] Ilan Vardi,et al. Computational recreations in Mathematica , 1991 .
[249] Harold N. Gabow,et al. Forests, frames, and games: algorithms for matroid sums and applications , 1988, STOC '88.
[250] Hortensia Galeana-Sánchez,et al. A sufficient condition for the existence of k-kernels in digraphs , 1998, Discuss. Math. Graph Theory.
[251] Edward M. Reingold,et al. The Complexity of Pursuit on a Graph , 1995, Theor. Comput. Sci..
[252] D. Crowe. The n-Dimensional Cube and the Tower of Hanoi , 1956 .
[253] Jaroslav Nesetril,et al. On the Oriented Game Chromatic Number , 2001, Electron. J. Comb..
[254] J. Neumann,et al. The Theory of Games and Economic Behaviour , 1944 .
[255] Daniel Berend,et al. The cyclic multi-peg Tower of Hanoi , 2006, TALG.
[256] Martin Gardner,et al. Wheels, life, and other mathematical amusements , 1983 .
[257] Xuding Zhu,et al. Game chromatic number of outerplanar graphs , 1999, J. Graph Theory.
[258] Paul Erdös,et al. On the equality of the grundy and ochromatic numbers of a graph , 1987, J. Graph Theory.
[259] Fan Chung Graham,et al. A chip-firing game and Dirichlet eigenvalues , 2002, Discret. Math..
[260] J. Propp,et al. Combinatorial Games under Auction Play , 1999 .
[261] A. K. K. Dewdney,et al. Turing Omnibus: 61 Excursions in Computer Science , 1989 .
[262] Ken Thompson,et al. Retrograde Analysis of Certain Endgames , 1986, J. Int. Comput. Games Assoc..
[263] D. Hensley. A WINNING STRATEGY AT TAXMAN® , 1986 .
[264] D. Wood. Adjudicating a towers of hanoi contest , 1983 .
[265] Bernard A. Nadel,et al. Representation selection for constraint satisfaction: a case study using n-queens , 1990, IEEE Expert.
[266] Larry J. Stockmeyer,et al. Provably Difficult Combinatorial Games , 1979, SIAM J. Comput..
[267] Maria M. Klawe,et al. A tight bound for black and white pebbles on the pyramid , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[268] Fedor V. Fomin,et al. Helicopter Search Problems, Bandwidth and Pathwidth , 1998, Discret. Appl. Math..
[269] Aviezri S. Fraenkel,et al. Three Annihilation Games , 1978 .
[270] Xiaoyun Lu,et al. A characterization on n-critical economical generalized tic-tac-toe games , 1992, Discret. Math..
[271] Yahya Ould Hamidoune,et al. A solution to the Misère Shannon switching Game , 1988, Discret. Math..
[272] Martin Kutz,et al. Conway's Angel in three dimensions , 2005, Theor. Comput. Sci..
[273] Wolfgang J. Paul,et al. On alternation , 1980, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[274] Peter Hegarty,et al. Permutations of the natural numbers with prescribed difference multisets. , 2006 .
[275] Kimmo Eriksson,et al. Chip-Firing Games on Mutating Graphs , 1996, SIAM J. Discret. Math..
[276] Aviezri S. Fraenkel,et al. How to Beat Your Wythoff Games' Opponent on Three Fronts , 1982 .
[277] L. Yedwab. ON PLAYING WELL IN A SUM OF GAMES , 1985 .
[278] Anne Condon,et al. On Algorithms for Simple Stochastic Games , 1990, Advances In Computational Complexity Theory.
[279] Heiko Harborth,et al. Hexagonal polyomino achievement , 2000, Discret. Math..
[280] Bogdan S. Chlebus. Domino-Tiling Games , 1986, J. Comput. Syst. Sci..
[281] M. Reiss. Beiträge zur Theorie des Solitär-Spiels. , 1857 .
[282] Judea Pearl,et al. Heuristics : intelligent search strategies for computer problem solving , 1984 .
[283] A. Gangolli,et al. A note on periodicity in some octal games , 1989 .
[284] T. Dillon,et al. Parallelism for multipeg towers of Hanoi , 1995 .
[285] Tamás D. Gedeon,et al. The Reve's Puzzle , 1986, Comput. J..
[286] Michael E. Saks,et al. Probabilistic Boolean decision trees and the complexity of evaluating game trees , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[287] Bruce Rothschild,et al. A generalization of Kaplansky's game , 1972, Discret. Math..
[288] H. S. M. Coxeter,et al. Triangulated polygons and frieze patterns , 1973, The Mathematical Gazette.
[289] Richard A. Brualdi,et al. Greedy Codes , 1993, J. Comb. Theory, Ser. A.
[290] M. Gardner. Science Fiction Puzzle Tales , 1981 .
[291] G. Heuer. Odds versus evens in Silverman-type games , 1982 .
[292] Nándor Sieben. SNAKY IS A 41-DIMENSIONAL WINNER , 2004 .
[293] Dean T. Allemang. Generalized genus sequences for misère octal games , 2002, Int. J. Game Theory.
[294] Ranan B. Banerji,et al. Artificial Intelligence: A Theoretical Approach , 1980 .
[295] Erik D. Demaine,et al. Solitaire Clobber , 2002, Theor. Comput. Sci..
[296] Hortensia Galeana-Sánchez,et al. On the dichromatic number in kernel theory , 1998 .
[297] Hortensia Galeana-Sánchez,et al. New classes of critical kernel-imperfect digraphs , 1998, Discuss. Math. Graph Theory.
[298] Xueliang Li,et al. Kernels in a special class of digraphs , 1998, Discret. Math..
[299] David Gale,et al. A Curious Nim-Type Game , 1974 .
[300] Noam D. Elkies. Higher Nimbers in Pawn Endgames on Large Chessboards , 2000 .
[301] Zsolt Tuza,et al. The cover pebbling number of graphs , 2005, Discret. Math..
[302] Aviezri S. Fraenkel,et al. k-welter - a generalization of Welter's game , 1987, J. Comb. Theory, Ser. A.
[303] Elliot Mendelson. Introducing Game Theory and its Applications , 2004 .
[304] Ian M. Wanless,et al. On the periodicity of graph games , 1997, Australas. J Comb..
[305] Cedric A. B. Smith. Graphs and composite games , 1966 .
[306] Noga Alon,et al. Discrepancy Games , 2005, Electron. J. Comb..
[307] C. W. Henson,et al. Winning Strategies for the Ideal Game , 1970 .
[308] Chi-Kwong Li,et al. Perfect codes on the towers of Hanoi graph , 1998, Bulletin of the Australian Mathematical Society.
[309] Thane E. Plambeck,et al. or Advances in Losing , 2006, math/0603027.
[310] Yahya Ould Hamidoune,et al. A solution to the Box Game , 1987, Discret. Math..
[311] Aviezri S. Fraenkel,et al. Strategy for a class of games with dynamic ties , 1975 .
[312] Ray Hill,et al. Searching with lies: the Ulam problem , 1992, Discret. Math..
[313] Fred Galvin,et al. Stationary strategies in topological games , 1986 .
[314] Madhu Sudan,et al. Motion Planning on a Graph (Extended Abstract) , 1994, FOCS 1994.
[315] M. Gardner. Knotted doughnuts and other mathematical entertainments , 1986 .
[316] Christian Deppe,et al. Q-Ary Ulam-Rényi Game with Weighted Constrained Lies , 2004, COCOON.
[317] Henry Ernest Dudeney. The Canterbury puzzles : and other curious problems , 1958 .
[318] Doron Zeilberger. Chomp, Recurrences and Chaos(?) , 2003 .
[319] Stephen T. Hedetniemi,et al. On the diagonal queens domination problem , 1986, J. Comb. Theory, Ser. A.
[320] Ugo Vaccaro,et al. Binary search with delayed and missing answers , 2003, Inf. Process. Lett..
[321] H. Reiter,et al. A Generalization of Beatty ’ s Theorem September 4 , 2003 , 2001 .
[322] Walter L. Ruzzo,et al. Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..
[323] William D. Weakley,et al. Values of Domination Numbers of the Queen's Graph , 2001, Electron. J. Comb..
[324] Shih Ping Tung,et al. Computational Complexities of Diophantine Equations with Parameters , 1987, J. Algorithms.
[325] János Barát,et al. A contribution to queens graphs: A substitution method , 2006, Discret. Math..
[326] S. B. Grantham,et al. Galvin's "racing pawns" game and a well-ordering of trees , 1985 .
[327] Harold W. Kuhn,et al. Definitions for a theory of games and pursuit , 1960 .
[328] Victor Klee,et al. The Connectedness Game and the c-Complexity of Certain Graphs , 1977 .
[329] Vladimir Gurvich,et al. A corrected version of the Duchet kernel conjecture , 1998, Discret. Math..
[330] D. Singmaster,et al. Almost all games are first person games , 1981 .
[331] Catherine H. Yan,et al. Balancing Game with a Buffer , 1998 .
[332] U. Leopold-Wildburger,et al. Silverman's Game: A Special Class of Two-Person Zero-Sum Games , 1995 .
[333] R. Sprague. Über mathematische Kampfspiele , 1935 .
[334] Thomas S. Ferguson,et al. Mate with Bishop and Knight in Kriegspiel , 1992, Theor. Comput. Sci..
[335] Xuding Zhu,et al. Game chromatic index of k-degenerate graphs , 2001, J. Graph Theory.
[336] S. Klavžar,et al. Graphs S(n, k) and a Variant of the Tower of Hanoi Problem , 1997 .
[337] Heiko Harborth,et al. Independence for knights on hexagon and triangle boards , 2003, Discret. Math..
[338] Keith Devlin,et al. All numbers great and small , 1984 .
[339] M. Kidwell,et al. A King's Tour of the Chessboard , 1985 .
[340] Aviezri S. Fraenkel,et al. Strategies for compounds of partizan games , 1982, Mathematical Proceedings of the Cambridge Philosophical Society.
[341] José Felipe Voloch,et al. Blet: A Mathematical Puzzle , 2002, Am. Math. Mon..
[342] Claude E. Shannon,et al. Programming a computer for playing chess , 1950 .
[343] Mikio Kano,et al. Edge-removing games of star type , 1996, Discret. Math..
[344] Ian Stewart,et al. Hex Marks the Spot. , 2000 .
[345] Zekeriya Aliyazicioglu,et al. Linear Congruence Equations for the Solutions of the N-Queens Problem , 1992, Inf. Process. Lett..
[346] Sylvain Gravier,et al. On a modular domination game , 2003, Theor. Comput. Sci..
[347] Jim Boyce,et al. A Kriegspiel Endgame , 1981 .
[348] L. V. Allis,et al. Searching for solutions in games and artificial intelligence , 1994 .
[349] L Brooks,et al. The matching game. , 1978, The New physician.
[350] A. Roth. A note concerning asymmetric games on graphs , 1978 .
[351] Cameron Browne,et al. Hex strategy - making the right connections , 2000 .
[352] R. Dixon,et al. The n-queens problem , 1975, Discret. Math..
[353] The Canterbury Puzzles and other Curious Problem , 1908, Nature.
[354] S. Li. Generalized impartial games , 1974 .
[355] Stefan Reisch,et al. Gobang ist PSPACE-vollständig , 2004, Acta Informatica.
[356] Richard J. Nowakowski,et al. A game of cops and robbers played on products of graphs , 1998, Discret. Math..
[357] Michael Krivelevich,et al. The Game of JumbleG , 2005, Combinatorics, Probability and Computing.
[358] J. A. Flanigan. On the distribution of winning moves in random game trees , 1981, Bulletin of the Australian Mathematical Society.
[359] David Collins,et al. Variations on a Theme of Euclid , 2003 .
[360] Andrzej Pelc,et al. Solution of Ulam's problem on searching with a lie , 1987, J. Comb. Theory, Ser. A.
[361] M. Gardner. The Magic Numbers Of Dr. Matrix , 1985 .
[362] A. Fraenkel,et al. Theory of annihilation games—I☆ , 1982 .
[363] Erik D. Demaine,et al. Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory , 2004, Theor. Comput. Sci..
[364] Bert Hartnell,et al. A game based on vertex-magic total labelings , 2004, Australas. J Comb..
[365] Erich Prisner. Parallel Chip Firing on Digraphs , 1994, Complex Syst..
[366] Multivision: An Intractable Impartial Game With a Linear Winning Strategy , 1998, math/9809095.
[367] Mark Kac,et al. Hugo Steinhaus — A Reminiscence and a Tribute , 1974 .
[368] A. J. van Zanten,et al. An iterative optimal algorithm for the generalized tower of hanoi problem , 1991, Int. J. Comput. Math..
[369] Richard E. Ladner,et al. Probabilistic Game Automata , 1986, J. Comput. Syst. Sci..
[370] László Babai,et al. Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes , 1988, J. Comput. Syst. Sci..
[371] Thomas S. Ferguson,et al. Misère Annihilation Games , 1984, J. Comb. Theory, Ser. A.
[372] Vadim V. Anshelevich,et al. The Game of Hex: the Hierarchical Approach , 2002 .
[373] Uri Zwick,et al. The Memory Game , 1993, Theor. Comput. Sci..
[374] Edward Falkener,et al. Games Ancient and Oriental and How to Play Them , 1982 .
[375] C. Berge,et al. Théorie générale des jeux à $n$ personnes , 1957 .
[376] François Laviolette,et al. On constructible graphs, infinite bridged graphs and weakly cop-win graphs , 2000, Discret. Math..
[377] James Flynn,et al. Some Results on Max-Min Pursuit. , 1974 .
[378] D. Gale,et al. Nim-type games , 1982 .
[379] M. C. Er,et al. A General Algorithm for Finding a Shortest Path between two n-Configurations , 1987, Inf. Sci..
[380] Stephen M. Chase,et al. An implemented graph algorithm for winning Shannon Switching Games , 1972, CACM.
[381] A. Bakst,et al. The Second Scientific American Book of Mathematical Puzzles and Diversions. , 1962 .
[382] A. Papaioannou. A Hamiltonian Game , 1982 .
[384] David Wolfe,et al. Snakes in Domineering Games , 1993, Theor. Comput. Sci..
[385] Jerome L. Paul,et al. Tic-Tac-Toe in n-Dimensions , 1978 .
[386] D. Schleicher,et al. An introduction to Conway’s games and numbers , 2004, math/0410026.
[387] Joel H. Spencer,et al. A Halfliar's game , 2004, Theor. Comput. Sci..
[388] A. S. Fraenkel,et al. Complexities of Winning Strategies in Diophantine Games , 1995, J. Complex..
[389] R. Guy,et al. The Lighter Side of Mathematics , 1994 .
[390] Roland Carl Backhouse,et al. Fixed-Point Characterisation of Winning Strategies in Impartial Games , 2003, RelMiCS.
[391] Robert McNaughton,et al. Infinite Games Played on Finite Graphs , 1993, Ann. Pure Appl. Logic.
[392] K. Koyama,et al. An Optimal Mastermind Strategy , 1993 .
[393] P. Stockmeyer. Variations on the Four-Post Tower of Hanoi Puzzle , 1994 .
[394] S. Klavžar,et al. Simple Explicit Formulas for the Frame-Stewart Numbers , 2002 .
[395] I. Niven. Coding Theory Applied to a Problem of Ulam , 1988 .
[396] R. Guy. A Guessing Game of Bill Sands, and Bernardo Recamán's Barranca , 1990 .
[397] Pontus Strimling,et al. Nim with a modular Muller twist , 2004 .
[398] P. Lin. Principal partition of graphs and connectivity games , 1982 .
[399] W. F. D. Theron,et al. Domination by queens on a square beehive , 1998, Discret. Math..
[400] Christos H. Papadimitriou,et al. Games against nature , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[401] Mark Ettinger. A Metric for Positional Games , 2000, Theor. Comput. Sci..
[402] Noam D. Elkies. On Numbers and Endgames: combinatorial Game Theory in Chess Endgames , 1996 .
[403] Steven Vajda,et al. Mathematical Games and How to Play Them , 1992 .
[404] László Lovász,et al. Chip-firing Games on Graphs , 1991, Eur. J. Comb..
[405] László Lovász,et al. Chip-Firing Games on Directed Graphs , 1992 .
[406] H. Gonshor. An Introduction to the Theory of Surreal Numbers , 1986 .
[407] Jonas Sjöstrand. The Cover Pebbling Theorem , 2005, Electron. J. Comb..
[408] Vladimir Gurvich,et al. A circular graph - counterexample to the Duchet kernel conjecture , 1996, Discret. Math..
[409] Aviezri S. Fraenkel,et al. How Far Can Nim in Disguise Be Stretched? , 1998, J. Comb. Theory, Ser. A.
[410] Y. Kawano. Using Similar Positions to Search Game Trees , 1996 .
[411] L. Landau,et al. PARTICLES AND ANTIPARTICLES , 1974 .
[412] Mark L. Copper. Graph Theory and the Game of Sprouts , 1993 .
[413] D. Viaud,et al. Une stratégie générale pour jouer au Master-Mind , 1987 .
[414] Hal A. Kierstead,et al. Asymmetric graph coloring games , 2005, J. Graph Theory.
[415] Ernest J. Cockayne,et al. Properties of Queens graphs and the irredundance number of Q7 , 2001, Australas. J Comb..
[416] Yonghoan Kim,et al. New Values in Domineering , 1996, Theor. Comput. Sci..
[417] Fan Chung Graham,et al. Pursuit - Evasion games on graphs , 1988, J. Graph Theory.
[418] R. Guy. Twenty Questions Concerning Conway's Sylver Coinage , 1976 .
[419] Eric Goles Ch.,et al. Parallel Chip Firing Games on Graphs , 1992, Theor. Comput. Sci..
[420] Béla Bollobás,et al. The oriented cycle game , 1998, Discret. Math..
[421] Lewis Stiller,et al. Parallel Analysis of Certain Endgames , 1989, J. Int. Comput. Games Assoc..
[422] Aviezri S. Fraenkel,et al. Combinatorial game theory foundations applied to digraph kernels , 1996, Electron. J. Comb..
[423] J. J. Watkins,et al. Knight's Tours on a Torus , 1997 .
[424] Frank Harary,et al. On Degree Achievement and Avoidance Games for Graphs , 1987 .
[425] Jan van den Heuvel,et al. Algorithmic Aspects of a Chip-Firing Game , 2001, Combinatorics, Probability and Computing.
[426] Shigeki Iwata,et al. The Othello game on an n*n board is PSPACE-complete , 1994, Theor. Comput. Sci..
[427] Alvin E. Roth,et al. Two-person games on graphs , 1978, J. Comb. Theory, Ser. B.
[428] Tomáš Tichý,et al. It is tough to be a plumber , 2004, Theor. Comput. Sci..
[429] Yohei Yamasaki,et al. Shannon switching games without terminals II , 1989, Graphs Comb..
[430] Murat M. Tanik,et al. Different perspectives of the N-Queens problem , 1992, CSC '92.
[431] Paul Cull,et al. Towers of Hanoi and Analysis of Algorithms , 1985 .
[432] Daniel H. Ullman,et al. On the cookie game , 1992 .
[433] G. Parlati,et al. Some results on searching with liesV , 1992 .
[434] Brunella Gerla. Conditioning a State by a Lukasiewicz Event: A Probabilistic Approach to Ulam Games , 2000, Theor. Comput. Sci..
[435] Aviezri S. Fraenkel,et al. Partizan octal games: Partizan subtraction games , 1987 .
[436] Carrie Gates,et al. Periods in Taking and Splitting Games , 1999 .
[437] Criel Merino López. Chip firing and the tutte polynomial , 1997 .
[438] Richard E. Ladner,et al. Solitaire Automata , 1985, J. Comput. Syst. Sci..
[439] JOEL SPENCER,et al. Balancing games , 1977, J. Comb. Theory B.
[440] Henry Meyniel,et al. Une generalisation du theoreme de Richardson sur l'existence de noyaux dans les graphes orientes , 1983, Discret. Math..
[441] M. C. Er,et al. An analysis of the generalized Towers of Hanoi problem , 1983, BIT.
[442] S. Golomb. Polyominoes: Puzzles, Patterns, Problems, and Packings , 1994 .
[443] Mathias Schulze,et al. CRASH! Mathematik und kombinatorisches Chaos prallen aufeinander , 1999, Informatik-Spektrum.
[444] Xuding Zhu,et al. Relaxed game chromatic number of trees and outerplanar graphs , 2004, Discret. Math..
[445] James Flynn,et al. Lion and Man: The Boundary Constraint , 1973 .
[446] Michael Hoffmann,et al. Push-2-f is pspace-complete , 2002, CCCG.
[447] Loren C. Larson,et al. A Theorem about Primes Proved on a Chessboard , 1977 .
[448] John Michael Robson,et al. Alternation with Restrictions on Looping , 1986, Inf. Control..
[449] Reuven Bar-Yehuda,et al. Rotating-Table Games and Derivatives of Words , 1993, Theor. Comput. Sci..
[450] M. Er. A Minimal Space Algorithm for Solving the Towers of Hanoi Problem , 1988 .
[451] Garikai Campbell,et al. On optimal play in the game of Hex. , 2004 .
[452] Paul Erdös,et al. On the equality of the partial Grundy and upper ochromatic numbers of graphs , 2003, Discret. Math..
[453] Leonidas J. Guibas,et al. String Overlaps, Pattern Matching, and Nontransitive Games , 1981, J. Comb. Theory A.
[454] Leonidas J. Guibas,et al. A Visibility-Based Pursuit-Evasion Problem , 1999, Int. J. Comput. Geom. Appl..
[455] Wolfgang Slany,et al. The Complexity of Graph Ramsey Games , 2000, Computers and Games.
[456] Masahiko Fukuyama. A Nim game played on graphs II , 2003, Theor. Comput. Sci..
[457] Steven Minsker,et al. The super towers of Hanoi problem: large rings on small rings , 1993, Discret. Math..
[458] Stephan Dominique Andres,et al. The Game Chromatic Index of Forests of Maximum Degree 5 , 2003, Electron. Notes Discret. Math..
[459] H. S. Witsenhausen,et al. Single-suit two-person card play , 1987 .
[460] Yohei Yamasaki,et al. Shannon-like games are difficult , 1993, Discret. Math..
[461] M. C. Er,et al. A Time and Space Efficient Algorithm for the Cyclic Towers of Hanoi Problem , 1987 .
[462] Clark Kimberling,et al. Generalized Wythoff arrays, shuffles and interspersions , 1994, Discret. Math..
[463] Yahya Ould Hamidoune,et al. Directed Switching Games on graphs and matroids , 1986, J. Comb. Theory, Ser. B.
[464] Y. Yeh,et al. A Nim‐like Game and Dynamic Recurrence Relations , 1995 .
[465] Hortensia Galeana-Sánchez,et al. On the existence of (k, l)-kernels in digraphs , 1990, Discret. Math..
[466] Sang-Gu Lee,et al. Linear algebraic approach on real σ-game , 2006 .
[467] R. Guy. Anyone for Twopins , 1981 .
[468] Bala Ravikumar,et al. Peg-solitaire, string rewriting systems and finite automata , 1997, Theor. Comput. Sci..
[469] Torleiv Kløve,et al. The modular n-queen problem II , 1981, Discret. Math..
[470] Gerald A. Heuer,et al. Three-part partition games on rectangles , 2001, Theor. Comput. Sci..
[471] Curtis Clark,et al. On achieving channels in a bipolar game , 1996, African Americans in Mathematics.
[472] Pierre Duchet,et al. Parity graphs are kernel-M-solvable , 1987, J. Comb. Theory, Ser. B.
[473] Richard J. Nowakowski,et al. A Vertex-To-Vertex Pursuit Game Played with Disjoint Sets of Edges , 1993 .
[474] H. Reiter,et al. Pilesize dynamic one-pile Nim and Beatty's theorem. , 2004 .
[475] J. Úlehla,et al. A complete analysis of Von Neumann's hackendot , 1980 .
[476] Olof Heden,et al. Maximal partial spreads and the modular n-queen problem II , 1995, Discret. Math..
[477] Rudolf Fleischer,et al. Traveling salesmen in the presence of competition , 2002, Theor. Comput. Sci..
[478] Todd Feil,et al. Turning Lights Out with Linear Algebra , 1998 .
[479] F. Scarioni,et al. A Probabilistic Analysis of an Error-Correcting Algorithm for the Towers of Hanoi Puzzle , 1984, Inf. Process. Lett..
[480] Joel H. Spencer,et al. Threshold spectra via the Ehrenfeucht game , 1991, Discret. Appl. Math..
[481] Klaus Sutner,et al. The σ-game and cellular automata , 1990 .
[482] John H. Conway,et al. Integral lexicographic codes , 1990, Discret. Math..
[483] K. Stolarsky,et al. Beatty Sequences, Continued Fractions, and Certain Shift Operators , 1976, Canadian Mathematical Bulletin.
[484] Stephen Willard,et al. The Rotating Table , 1980 .
[485] Gabriel C. Drummond-Cole. POSITIONS OF VALUE *2 IN GENERALIZED DOMINEERING AND CHESS , 2005 .
[486] Peter Ransom,et al. The Unexpected Hanging And Other Mathematical Diversions , 1992, The Mathematical Gazette.
[487] Andrzej Czygrinow,et al. Thresholds for families of multisets, with an application to graph pebbling , 2003, Discret. Math..
[488] Matteo Sereno,et al. Binary Search with Errors and Variable Cost Queries , 1998, Inf. Process. Lett..
[489] U. K. Sarkar. On the design of a constructive algorithm to solve the multi-peg towers of Hanoi problem , 2000, Theor. Comput. Sci..
[490] T. Dillon,et al. A note on parallelism for the Towers of Hanoi , 1994 .
[491] David Sidney Parlett,et al. The Oxford history of board games , 1999 .
[492] H. James Hoover,et al. Limits to Parallel Computation: P-Completeness Theory , 1995 .
[493] J. G. Mauldon,et al. Num, a Variant of Nim with No First-Player Win , 1978 .
[494] C. Frangakis. A backtracking algorithm to generate all kernels of a directed graph , 1981 .
[495] Leslie E. Shader,et al. Another Strategy for SIM , 1978 .
[496] Kiyoshi Igusa. Solution of the Bulgarian Solitaire Conjecture , 1985 .
[497] Hortensia Galeana-Sánchez. Kernels in digraphs with covering number at most 3 , 2002, Discret. Math..
[498] H. Witsenhausen,et al. Single-suit two-person card play II. Dominance , 1988 .
[499] The Sierpiński Sieve of Nim-varieties and Binomial Coefficients , 2006 .
[500] Elwyn R. Berlekamp. Combinatorial Games , 2006, ITW.
[501] Andrzej Pelc,et al. Searching with Local Constraints on Error Patterns , 1994, Eur. J. Comb..
[502] John H. Conway,et al. A Gamut of Game Theories , 1978 .
[503] Alexander Rosa,et al. THE GAME OF SIM: A WINNING STRATEGY FOR THE SECOND PLAYER , 1974 .
[504] John Michael Robson,et al. Combinatorial Games with Exponential Space Complete Decision Problems , 1984, MFCS.
[505] Gary MacGillivray,et al. A note on k-cop, l-robber games on graphs , 2006, Discret. Math..
[506] Henry Meyniel,et al. On a game of policemen and robber , 1987, Discret. Appl. Math..
[507] Richard J. Nowakowski,et al. CUTTHROAT, AN ALL-SMALL GAME ON GRAPHS. , 2005 .
[508] H. Jaap van den Herik,et al. The Construction of an Omniscient Endgame Data Base , 1985, J. Int. Comput. Games Assoc..
[509] J. V. Uspensky,et al. On a Problem Arising out of the Theory of a Certain Game , 1927 .
[510] Ákos Seress,et al. On Hajnal's triangle-free game , 1992, Graphs Comb..
[511] J. H. Conway,et al. All Games Bright and Beautiful , 1977 .
[512] Donald H. Pelletier. Merlin's magic square , 1987 .
[513] Peter B. Gibbons,et al. Computational methods and new results for chessboard problems , 2001, Australas. J Comb..
[514] Criel Merino. The Chip Firing Game and Matroid Complexes , 2001, DM-CCG.
[515] T. D. Parsons,et al. Pursuit-evasion in a graph , 1978 .
[516] Benjamin Doerr. Vector Balancing Games with Aging , 2001, Electron. Notes Discret. Math..
[517] Erik D. Demaine,et al. PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation , 2002, Theor. Comput. Sci..
[518] Sylvain Gravier,et al. A DELETION GAME ON GRAPHS: “LE PIC ARÊTE” , 2006 .
[519] József Beck,et al. Deterministic Graph Games and a Probabilistic Intuition , 1994, Combinatorics, Probability and Computing.
[520] T. Dillon,et al. Nonrecursive solution to parallel multipeg Towers of Hanoi: A decomposition approach , 1996 .
[521] G. A. Heuer,et al. Silverman Games on Disjoint Discrete Sets , 1988, SIAM J. Discret. Math..
[522] J. A. Flanigan. Selective sums of loopy partizan graph games , 1981 .
[523] Mike D. Atkinson,et al. The Cyclic Towers of Hanoi , 1981, Inf. Process. Lett..
[524] Martin Müller. Conditional combinatorial games and their application to analyzing capturing races in Go , 2003, Inf. Sci..
[525] Steven Minsker,et al. The Towers of Hanoi Rainbow Problem: Coloring the Rings , 1989, J. Algorithms.
[526] József Beck,et al. Random Graphs and Positional Games on the Complete Graph , 1985 .
[527] M. C. Er,et al. A Linear space algorithm for solving the towers of hanoi problem by using a virtual disc , 1989, Inf. Sci..
[528] Samuel Jones Loyd Baron Overstone. More mathematical puzzles of Sam Loyd , 1960 .
[529] Matteo Sereno,et al. Solution of Ulam's Problem on Binary Search with Three Lies , 1992, J. Comb. Theory, Ser. A.
[530] Aviezri S. Fraenkel,et al. New Games Related to Old and New Sequences , 2003, ACG.
[531] Dieter Kratsch,et al. The Complexity of Coloring Games on Perfect Graphs , 1992, Theor. Comput. Sci..
[532] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[533] Y. C. Ho,et al. A Game Locating a Needle in a Circular Haystack , 2022 .
[534] J. Lewin,et al. The lion and man problem revisited , 1986 .
[535] József Beck,et al. Positional Games and the Second Moment Method , 2002, Comb..
[536] Aleksandar Pekec,et al. A Winning Strategy for the Ramsey Graph Game , 1995, Combinatorics, Probability and Computing.
[537] Richard J. Nowakowski,et al. Periodicity and arithmetic-periodicity in hexadecimal games , 2004, Theor. Comput. Sci..
[538] W. H. Freeman,et al. The Armchair Universe: An Exploration of Computer Worlds , 1988 .
[539] Henry Ernest Dudeney. Amusements in Mathematics , 1917, Nature.
[540] Frank Harary,et al. Achievement and Avoidance Games for Graphs , 1982 .
[541] Frédéric Maffray,et al. On kernels in perfect graphs , 1993, Comb..
[542] Erik D. Demaine,et al. The Complexity of Clickomania , 2001, ArXiv.
[543] David Wolfe,et al. On the Lattice Structure of Finite Games , 2002 .
[544] Dan Calistrate. The Reduced Canonical Form of a Game , 1996 .
[545] Victor Chepoi,et al. Bridged Graphs Are Cop-Win Graphs: An Algorithmic Proof , 1997, J. Comb. Theory, Ser. B.
[546] Erich Grädel,et al. Domino Games and Complexity , 1990, SIAM J. Comput..
[547] Frédéric Maffray,et al. On kernels in i-triangulated graphs , 1986, Discret. Math..
[548] R. Sprague,et al. Über zwei Abarten von Nim , 1937 .
[549] Kimmo Eriksson,et al. Reachability is Decidable in the Numbers Game , 1994, Theor. Comput. Sci..
[550] Christof Löding,et al. Solving the Sabotage Game Is PSPACE-Hard , 2003, MFCS.
[551] Imre Leader,et al. Domination Games on Infinite Graphs , 1994, Theor. Comput. Sci..
[552] W. W. Ball,et al. Mathematical Recreations and Essays , 1905, Nature.
[553] Peter Buneman,et al. The Towers of Hanoi Problem , 1980, Inf. Process. Lett..
[554] Xuding Zhu,et al. Relaxed game chromatic number of graphs , 2003, Discret. Math..
[555] H. Kinder. Gewinnstrategien des Anziehenden in einigen Spielen auf Graphen , 1973 .
[556] Donald E. Knuth,et al. The Stanford GraphBase - a platform for combinatorial computing , 1993 .
[557] Joel H. Spencer,et al. The Two-Batch Liar Game over an Arbitrary Channel , 2005, SIAM J. Discret. Math..
[558] Yohei Yamasaki,et al. A difficulty in particular Shannon-like games , 1991, Discret. Appl. Math..
[559] Gary J. Sherman. A Child's Game with Permutations , 1978 .
[560] Edward L. Spitznagel,et al. Properties of a Game Based on Euclid's Algorithm , 1973 .
[561] C. Berge. Some Remarks about a Hex Problem , 1981 .
[562] Howard A. Landman,et al. A Simple FSM-Based Proof of the Additive Periodicity of the Sprague--Grundy Function of Wythoff's Game , 2002 .
[563] L. Csmiraz,et al. On a combinatorial game with an application to Go-moku , 1980, Discret. Math..
[564] Aviezri S. Fraenkel,et al. Arrays, numeration systems and Frankenstein games , 2002, Theor. Comput. Sci..
[565] Ugo Vaccaro,et al. Least adaptive optimal search with unreliable tests , 2000, Theor. Comput. Sci..
[566] A. J. Cole,et al. A Game Based on the Euclidean Algorithm and A Winning Strategy for it , 1969, Mathematical Gazette.
[567] M. C. Er,et al. An iterative solution to the generalized Towers of Hanoi problem , 1983, BIT.
[568] Igor Rivin,et al. A Dynamic Programming Solution to the n-Queens Problem , 1992, Inf. Process. Lett..
[569] Ugo Vaccaro,et al. An improved heuristic for "Ulam-Rényi game" , 2000, Inf. Process. Lett..
[570] Andrzej Pelc,et al. Solution of Ulam's problem on binary search with two lies , 1988, J. Comb. Theory, Ser. A.
[571] Uri Zwick,et al. The Complexity of Mean Payoff Games , 1995, COCOON.
[572] Matthias Reichling,et al. A Simplified Solution of the n Queens Problem , 1987, Information Processing Letters.
[573] Arnold Knopfmacher,et al. A Simple Card Guessing Game Revisited , 2000, Electron. J. Comb..
[574] Mikio Kano,et al. Cycle games and cycle cut games , 1983, Comb..
[575] P. Nowell-Smith,et al. Riddles of the Sphinx , 2002 .
[576] Jin Akiyama. Mathematical Circus , 2004 .
[577] Richard A. Weida,et al. An Easy Solution to Mini Lights Out , 2001 .
[578] R. Guy. Mathematics from Fun & Fun from Mathematics: An Informal Autobiographical History of Combinatorial Games , 1991 .
[579] Thomas S. Ferguson,et al. Who Solved the Secretary Problem , 1989 .
[580] J. Daniel Christensen,et al. David Gale's subset take-away game , 1997 .
[581] P. M. Grundy,et al. Disjunctive games with the last player losing , 1956, Mathematical Proceedings of the Cambridge Philosophical Society.
[582] Robert E. Tarjan,et al. A Combinatorial Problem Which Is Complete in Polynomial Space , 1976, JACM.
[583] Martin Gardner,et al. Time Travel And Other Mathematical Bewilderments , 1987 .
[584] R. Evans,et al. Silverman's Game on Discrete Sets , 1992 .
[585] Elwyn R. Berlekamp. The dots-and-boxes game - sophiticated child's play , 2000 .
[586] Yohei Yamasaki,et al. On misère Nim-type games , 1980 .
[587] Ralph-Johan Back,et al. Games and Winning Strategies , 1995, Inf. Process. Lett..
[588] József Beck,et al. On a generalization of Kaplansky's game , 1982, Discret. Math..
[589] Elwyn R. Berlekamp,et al. Mathematical Go - chilling gets the last point , 1994 .
[590] József Beck,et al. Remarks on positional games. I , 1982 .
[591] Andrzej Czygrinow,et al. Pebbling in dense graphs , 2003, Australas. J Comb..
[592] S. Li,et al. N-person Nim andn-person Moore's Games , 1978 .
[593] A. M. Hinz,et al. On the planarity of Hanoi graphs , 2002 .
[594] C. Berge. Les jeux sur un graphe , 1992 .
[595] Richard M. Wilson,et al. Graph puzzles, homotopy, and the alternating group☆ , 1974 .
[596] A. J. Goldman,et al. The Set Coincidence Game: Complexity, Attainability, and Symmetric Strategies , 1989, J. Comput. Syst. Sci..
[597] M. C. Er,et al. The Generalized Colour Towers of Hanoi: An Iterative Algorithm , 1984, Comput. J..
[598] L. Weinberg,et al. A constructive graph-theoretic solution of the Shannon switching game , 1970 .
[599] Hortensia Galeana-Sánchez,et al. B1- and B2-orientable graphs in kernel theory , 1995, Discret. Math..
[600] Christian Deppe,et al. Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests , 2003, ISAAC.
[601] Eric Goles Ch.,et al. Sandpiles and order structure of integer partitions , 2002, Discret. Appl. Math..
[602] Barry Nalebuff,et al. The Other Person's Envelope is Always Greener , 1989 .
[603] Thane E. Plambeck,et al. Daisies, Kayles, and the Silbert-Conway Decomposition in Misère Octal Games , 1992, Theor. Comput. Sci..
[604] L. R. Foulds,et al. An Application of Graph Theory and Integer Programming: Chessboard Non-attacking Puzzles , 1984 .
[605] David Gale,et al. Tracking the Automatic ANT: And Other Mathematical Explorations , 1998 .
[606] Ian M. Wanless. Path achievement games , 2001, Australas. J Comb..
[607] Eugene L. Lawler,et al. An Algorithm for "Ulam's Game" and its Application to Error Correcting Codes , 1995, Inf. Process. Lett..
[608] Alan R. Washburn,et al. Deterministic graphical games , 1990 .
[609] R. Banerji,et al. On misere games , 1992 .
[610] Wojciech Guzicki,et al. Ulam's searching game with two lies , 1990, J. Comb. Theory, Ser. A.
[611] Hortensia Galeana-Sánchez,et al. On kernels and semikernels of digraphs , 1984, Discret. Math..
[612] Aviezri S. Fraenkel,et al. A Generalization of Wythoff's Game , 1973, J. Comb. Theory, Ser. A.
[613] Hans L. Bodlaender. On the Complexity of Some Coloring Games , 1991, Int. J. Found. Comput. Sci..
[614] Jeffrey S. Rohl,et al. A Faster Lexicographical N Queens Algorithm , 1983, Inf. Process. Lett..
[615] Hal A. Kierstead,et al. A Simple Competitive Graph Coloring Algorithm , 2000, J. Comb. Theory B.
[616] F. L. Morris,et al. Prohibiting repetitions makes playing games substantially harder , 1984 .
[617] Rong-Jaye Chen,et al. The Towers of Hanoi Problem with Parallel Moves , 1992, Inf. Process. Lett..
[618] Monotonic sequence games , 2006, math/0602630.
[619] Ilya Safro,et al. Collective stochastic versions of playable games as metaphors for complex biosystems: Team connect four , 2003, Complex..
[620] J. G. Báron. The Game of Nim—a Heuristic Approach , 1974 .
[621] Glenn H. Hurlbert,et al. Pebbling in diameter two graphs and products of paths , 1997, J. Graph Theory.
[622] Martin Gardner,et al. Entertaining Science Experiments with Everyday Objects , 1981 .
[623] N. L. Alling,et al. CONWAY'S FIELD OF SURREAL NUMBERS , 1985 .
[624] T. Chan. A statistical analysis of the towers of hanoi problem , 1989 .
[625] Martin Gardner. A Gardner's workout - training the mind and entertaining the spirit , 2001 .
[626] Andreas M. Hinz,et al. Shortest paths between regular states of the Tower of Hanoi , 1992, Inf. Sci..
[627] Joel H. Spencer,et al. Coping with Errors in Binary Search Procedures , 1980, J. Comput. Syst. Sci..
[628] Manouchehr Zaker,et al. Grundy chromatic number of the complement of bipartite graphs , 2005, Australas. J Comb..
[629] W. Webb. The length of the four-number game , 1982 .
[630] Aviezri S. Fraenkel,et al. PSPACE-hardness of some combinatorial games , 1987, J. Comb. Theory, Ser. A.
[631] Aviezri S. Fraenkel,et al. Epidemiography with various growth functions , 1989, Discret. Appl. Math..
[632] Daniel Dominic Sleator,et al. Computer analysis of Sprouts , 1999 .
[633] Kuo-Yuan Kao. SUMBERS - SUMS OF UPS AND DOWNS , 2005 .
[634] John Tromp,et al. Ladders Are PSPACE-Complete , 2000, Computers and Games.
[635] András Pluhár. The accelerated k-in-a-row game , 2002, Theor. Comput. Sci..
[636] de Ng Dick Bruijn. A Solitaire Game and Its Relation to a Finite Field , 2019, Mathematical Solitaires & Games.
[637] Hortensia Galeana-Sánchez,et al. On graphs all of whose {C3, T3}-free arc colorations are kernel-perfect , 2001, Discuss. Math. Graph Theory.
[638] Kimmo Eriksson,et al. No polynomial bound for the chip firing game on directed graphs , 1991 .
[639] J. Holladay. A Note on the Game of Dots , 1966 .
[640] Michael Bradley Johanson,et al. Dead Cell Analysis in Hex and the Shannon Game , 2006 .
[641] Ryuhei Uehara,et al. Generalized Hi-Q is NP-complete , 1990 .
[642] A. Fraenkel. The particles and antiparticles game , 1977 .
[643] Richard J. Nowakowski,et al. The Game of End-Nim , 2001, Electron. J. Comb..
[644] Grahame Bennett,et al. Double Dipping: the Case of the Missing Binomial Coefficient Identities , 1994, Theor. Comput. Sci..
[645] Anne Condon. Space-bounded probabilistic game automata , 1991, JACM.
[646] Xuding Zhu. The game coloring number of pseudo partial k-trees , 2000, Discret. Math..
[647] Michael Buro,et al. Simple Amazons Endgames and Their Connection to Hamilton Circuits in Cubic Subgrid Graphs , 2000, Computers and Games.
[648] Peter Frankl,et al. On a pursuit game on cayley graphs , 1987, Comb..
[649] M. Richardson. Extension Theorems for Solutions of Irreflexive Relations. , 1953, Proceedings of the National Academy of Sciences of the United States of America.
[650] Samuel Loyd,et al. Mathematical Puzzles of Sam Loyd , 1959 .
[651] Wolfgang Slany. Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete , 2002, Theor. Comput. Sci..
[652] J. R. Weisinger,et al. A survey of the search theory literature , 1991 .
[653] Matthew L. Ginsberg,et al. Alpha-Beta Pruning Under Partial Orders , 2002 .
[654] M. Gardner. Penrose Tiles To Trapdoor Ciphers , 1988 .
[655] Hortensia Galeana-Sánchez,et al. Kernels in pretransitive digraphs , 2004, Discret. Math..
[656] Ugo Vaccaro,et al. Optimal Strategies Against a Liar , 1999, Theor. Comput. Sci..
[657] Elwyn R. Berlekamp,et al. Introductory overview of mathematical Go endgames , 1991 .
[658] Criel Merino,et al. The chip-firing game , 2005, Discret. Math..
[659] Aviezri S. Fraenkel,et al. Never Rush to Be First in Playing Nimbi , 1980 .
[660] Richard J. Nowakowski,et al. Cops, Robber, and Photo Radar , 2000, Ars Comb..
[661] Alewyn P. Burger,et al. An improved upper bound for queens domination numbers , 2003, Discret. Math..
[662] Peter Winkler,et al. On playing “Twenty Questions” with a liar , 1992, SODA '92.
[663] Liam Halpenny,et al. A Classification of Minimal Standard-Path 2x2 Switching Networks , 1992, Theor. Comput. Sci..
[664] Thomas Ströhlein,et al. Analyzing games by Boolean matrix iteration , 1977, Discret. Math..
[665] Peter Frankl,et al. Cops and robbers in graphs with large girth and Cayley graphs , 1987, Discret. Appl. Math..
[666] Dov Samet,et al. One Observation behind Two-Envelope Puzzles , 2004, Am. Math. Mon..
[667] F. A. Bostock,et al. A one-dimensional helicopter-submarine game , 1989 .
[668] King and rook vs. king on a quarter-infinite board. , 2006 .
[669] Vladimir Gurvich,et al. Perfect graphs, kernels, and cores of cooperative games , 2006, Discret. Math..
[670] Péter L. Erdös,et al. Note on the game chromatic index of trees , 2004, Theor. Comput. Sci..
[671] J. Kenyon. Nim-like games and the Sprague-Grundy theory , 1967 .
[672] James A. Storer,et al. On the Complexity of Chess , 1983, J. Comput. Syst. Sci..
[673] Gwihen Etienne,et al. Tableaux de young et solitaire bulgare , 1991, J. Comb. Theory, Ser. A.
[674] Wei-Fan Wang. Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers , 2006, Discret. Math..
[675] Robert E. Tarjan,et al. The pebbling problem is complete in polynomial space , 1979, SIAM J. Comput..
[676] David Lichtenstein,et al. Planar Formulae and Their Uses , 1982, SIAM J. Comput..
[677] Frédéric Maffray,et al. Some operations preserving the existence of kernels , 1999, Discret. Math..
[678] Hal A. Kierstead,et al. The relaxed game chromatic number of outerplanar graphs , 2004, J. Graph Theory.
[679] David A. Klarner,et al. Mathematical recreations : a collection in honor of Martin Gardner , 1998 .
[680] Dennis R. Wixon,et al. What is a game? , 2006, INTR.
[681] Henrik Eriksson,et al. Diagonal Checker-jumping and Eulerian Numbers for Color-signed Permutations , 2000, Electron. J. Comb..
[682] Y. Yamasaki. The Projectivity of Y-Games , 1981 .
[683] Vadim V. Anshelevich,et al. The Game of Hex: An Automatic Theorem Proving Approach to Game Programming , 2000, AAAI/IAAI.
[684] D. Knuth. The Computer as Master Mind , 1977 .
[685] Harold James Ruthren Murray,et al. A History of Board-Games Other Than Chess , 1969 .
[686] Robert E. Wilber. White pebbles help , 1985, STOC '85.
[687] M. Sato. Grundy Functions and Linear Games , 1971 .
[688] Konrad J. Swanepoel,et al. Balancing Unit Vectors , 2008, J. Comb. Theory A.
[689] R. Guy. John Isbell's Game of Beanstalk and John Conway's Game of Beans-Don't-Talk , 1986 .
[690] Aviezri S. Fraenkel,et al. Recent results and questions in combinatorial game complexities , 2000, Theor. Comput. Sci..
[691] B. Banaschewski,et al. Tarski's Fixpoint Lemma and combinatorial games , 1990 .
[692] Glenn Hurlbert. A Survey of Graph Pebbling , 2004 .
[693] Andrzej Pelc,et al. Prefix search with a lie , 1988, J. Comb. Theory, Ser. A.
[694] A. Fraenkel. Scenic Trails Ascending from Sea-Level Nim to Alpine Chess , 1995, math/9503222.
[695] Claude Berge,et al. Recent problems and results about kernels in directed graphs , 1991, Discret. Math..
[696] Olof Heden,et al. Maximal partial spreads and the modular n-queen problem , 1993, Discret. Math..
[697] Anne Condon,et al. The Complexity of Stochastic Games , 1992, Inf. Comput..
[698] Hortensia Galeana-Sánchez,et al. Kernels in Orientations of Pretransitive Orientable Graphs , 2006 .
[699] Thomas Andreae,et al. A Two-Person Game on Graphs Where Each Player Tries to Encircle his Opponent's Men , 1999, Theor. Comput. Sci..
[700] Xinyu Sun,et al. Wythoff's sequence and N-Heap Wythoff's conjectures , 2005, Discret. Math..
[701] László Babai,et al. Trading group theory for randomness , 1985, STOC '85.
[702] Atsushi Takahashi,et al. Mixed Searching and Proper-Path-Width , 1991, Theor. Comput. Sci..
[703] D. L. Stock. Merlin's magic square revisited , 1989 .
[704] Andrzej Pelc,et al. Detecting errors in searching games , 1989, J. Comb. Theory, Ser. A.
[705] Martin Gardner,et al. Mathematics, Magic and Mystery , 1956 .
[706] M. Gardner. Mathematical Magic Show , 1978 .
[707] A. P. Domoryad,et al. Mathematical games and pastimes , 1966 .
[708] James P. Jones,et al. Some undecidable determined games , 1982 .
[709] D. Coleman. Stretch: A Geoboard Game , 1978 .
[710] Catherine H. Yan,et al. Ulam's pathological liar game with one half-lie , 2004, Int. J. Math. Math. Sci..
[711] Ales Pultr,et al. Remarks on strategies in combinatorial games , 1985, Discret. Appl. Math..
[712] Peter Winkler,et al. Vertex-to-vertex pursuit in a graph , 1983, Discret. Math..
[713] John E. Olson,et al. A Balancing Strategy , 1985, J. Comb. Theory, Ser. A.
[714] David S. Johnson,et al. The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.
[715] Martin Tompa,et al. A new pebble game that characterizes parallel complexity classes , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[716] Paul K. Stockmeyer,et al. Exchanging disks in the tower of hanoi , 1995, Int. J. Comput. Math..
[717] Richard P. Anstee,et al. On bridged graphs and cop-win graphs , 1988, J. Comb. Theory, Ser. B.
[718] David Lichtenstein,et al. GO Is Polynomial-Space Hard , 1980, JACM.
[719] Erik D. Demaine,et al. Playing Games with Algorithms: Algorithmic Combinatorial Game Theory , 2001, MFCS.
[720] A. Fraenkel,et al. Two-Player Games on Cellular Automata , 2000 .
[721] Richard M. Karp,et al. On parallel evaluation of game trees , 1989, SPAA '89.
[722] Ross Homel,et al. The puzzles and paradoxes , 2022 .
[723] D. Clark. Fibonacci Numbers as Expected Values in a Game of Chance , 1984 .
[724] Andrzej Pelc,et al. Ulam's searching game with lies , 1989, J. Comb. Theory, Ser. A.
[725] Marcel Crâsmaru,et al. On the Complexity of Tsume-Go , 1998, Computers and Games.
[726] Friedhelm Meyer auf der Heide,et al. A Comparison of two Variations of a Pebble Game on Graphs , 1981, Theor. Comput. Sci..
[727] Daniel Mey,et al. Finite Games for a Predicate Logic Without Contractions , 1994, Theor. Comput. Sci..
[728] Hortensia Galeana-Sánchez,et al. Semikernels and (k, l)-Kernels in Digraphs , 1998, SIAM J. Discret. Math..
[729] Noga Alon,et al. The Acyclic Orientation Game on Random Graphs , 1995, Random Struct. Algorithms.
[730] Hans Liebeck,et al. Some Generalizations of the 14–15 Puzzle , 1971 .
[731] N. L. Alling. Fundamentals of analysis over surreal number fields , 1989 .
[732] Wayne Goddard,et al. An algorithm for partial Grundy number on trees , 2005, Discret. Math..
[733] Christos H. Papadimitriou,et al. The complexity of searching a graph , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[734] Andreas M. Hinz,et al. An iterative algorithm for the Tower of Hanoi with four pegs , 1989, Computing.
[735] David Moews,et al. Pebbling graphs , 1992, J. Comb. Theory, Ser. B.
[736] T. Ferguson. On sums of graph games with last player losing , 1974 .
[737] J. P. Grossman. Periodicity in one-dimensional peg duotaire , 2004, Theor. Comput. Sci..
[738] Hortensia Galeana-Sánchez. Semikernels modulo F and kernels in digraphs , 2000, Discret. Math..
[739] Philip D. Straffin,et al. Three Person Winner-Take-All Games with McCarthy's Revenge Rule , 1985 .
[740] N. J. A. Sloane,et al. The solution to Berlekamp's switching game , 1989, Discret. Math..
[741] Hal A. Kierstead,et al. Competitive Colorings of Oriented Graphs , 2000, Electron. J. Comb..
[742] B. L. Waerden. The game of rectangles , 1974 .
[743] Solomon W. Golomb,et al. A mathematical investigation of games of “take-away” , 1966 .
[744] Xiaoyun Lu,et al. A Note on Biased and Non-biased Games , 1995, Discret. Appl. Math..
[745] William Klostermeyer,et al. Maximization Versions of “ Lights Out ” Games in Grids and Graphs , 1998 .
[746] Y. Yamasaki. Theory of Connexes. II , 1981 .
[747] V. Chvátal. Cheap, Middling or Dear , 1981 .
[748] Stathis Zachos,et al. Probabilistic Quantifiers and Games , 1988, J. Comput. Syst. Sci..
[749] Suku Nair,et al. Parallel Memory Allocation and Data Alignment in Simd Machines , 1994, Parallel Algorithms Appl..
[750] Tamás Lengyel,et al. Color Switching Games , 2000, Ars Comb..
[751] Frank Harary,et al. Geodetic contraction games on graphs , 1989 .
[752] Robert E. Tarjan,et al. The Space Complexity of Pebble Games on Trees , 1980, Inf. Process. Lett..
[753] Jirí Sgall. Solution of David Gale's lion and man problem , 2001, Theor. Comput. Sci..
[754] Stanislav Jendrol',et al. List coloring of Cartesian products of graphs , 2006, Discret. Math..
[755] Frank Harary,et al. Achievement and avoidance games for generating abelian groups , 1987 .
[756] The Abstract Structure of the Group of Games , 2002 .
[757] Hortensia Galeana-Sánchez,et al. Kernels in the closure of coloured digraphs , 2000, Discuss. Math. Graph Theory.
[758] David Berengut,et al. A Random Hopscotch Problem or How to Make Johnny Read More , 1981 .
[759] Sin Hitotumatu,et al. Some remarks on nim-like games , 1969 .
[760] Hortensia Galeana-Sánchez,et al. Kernels and perfectness in arc-local tournament digraphs , 2006, Discret. Math..
[761] Martin Knor,et al. On Ramsey-type games for graphs , 1996, Australas. J Comb..
[762] F. A. Bostock,et al. A game locating a needle in a square haystack , 1986 .
[763] Eric Goles Ch.,et al. No Polynomial Bound for the Period of the Parallel Chip Firing Game on Graphs , 1994, Theor. Comput. Sci..
[764] Tomás Feder,et al. Disks on a Tree: Analysis of a Combinatorial Game , 2005, SIAM J. Discret. Math..
[765] N. S. Mendelsohn. A Psychological Game , 1946 .
[766] Klaus Sutner,et al. Decomposition of Additive Cellular Automata , 2002, Complex Syst..
[767] Alain Quilliot,et al. A short note about pursuit games played on a graph with a given genus , 1985, J. Comb. Theory, Ser. B.
[768] Boris Bukh. Maximum pebbling number of graphs of diameter three , 2006, J. Graph Theory.
[769] Javed A. Aslam,et al. On-Line Algorithms for 2-Coloring Hypergraphs Via Chip Games , 1993, Theor. Comput. Sci..
[770] Frédéric Maffray,et al. Kernels in perfect line-graphs , 1992, J. Comb. Theory, Ser. B.
[771] Masahiko Fukuyama. A Nim game played on graphs , 2003, Theor. Comput. Sci..
[772] Fred Galvin,et al. A Ramseyan Theorem and an Infinite Game , 1992, J. Comb. Theory, Ser. A.
[773] Hortensia Galeana-Sánchez,et al. On kernel-perfect critical digraphs , 1986, Discret. Math..
[774] Aviezri S. Fraenkel,et al. Virus Versus Mankind , 2000, Computers and Games.
[775] Richard Mansfield,et al. Strategies for the Shannon Switching Game , 1996 .
[776] Matthieu Latapy,et al. Coding distributive lattices with Edge Firing Games , 2001, Inf. Process. Lett..
[777] Thomas J. Schaefer,et al. Complexity of decision problems based on finite two-person perfect-information games , 1976, STOC '76.
[778] Aaron Archer,et al. A Modern Treatment of the 15 Puzzle , 1999 .
[779] Marion Scheepers,et al. Variations on a Game of Gale (II): Markov Strategies , 1994, Theor. Comput. Sci..
[780] Martin Aigner,et al. A game of cops and robbers , 1984, Discret. Appl. Math..
[781] C. L. Bouton. Nim, A Game with a Complete Mathematical Theory , 1901 .
[782] D. P. McIntyre,et al. A New System for Playing the Game of Nim , 1942 .
[783] Hortensia Galeana-Sánchez,et al. Kernels in edge-colored digraphs , 1998, Discret. Math..
[784] Yahya Ould Hamidoune,et al. The directed Shannon switching game and the one-way game , 1985 .
[785] J. Keil. How a skeptic misrepresents the research with Stepanek: a review of Martin Gardner's How not to test a psychic , 1990 .
[786] Cedric A. B. Smith,et al. The G-values of various games , 1956, Mathematical Proceedings of the Cambridge Philosophical Society.
[787] C. G. Méndez. On the Law of Large Numbers, Infinite Games, and Category , 1981 .
[788] Aviezri S. Fraenkel,et al. THE STRUCTURE OF COMPLEMENTARY SETS OF INTEGERS : A 3-SHIFT THEOREM , 2003 .
[789] Henry Meyniel,et al. A note on kernel-critical graphs , 1981, Discret. Math..
[790] H. Lenstra,et al. On the algebraic closure of two , 1977 .
[791] Tamás Lengyel,et al. A Nim-type game and continued fractions , 2003 .
[792] D. Ullman. More on the Four-Numbers Game , 1992 .
[793] Xuding Zhu,et al. The d-relaxed game chromatic index of k-degenerated graphs , 2006, Australas. J Comb..
[794] C. Moore,et al. Who Wins Domineering on Rectangular Boards , 2000, math/0006066.
[795] Jean-Paul Allouche,et al. Restricted Towers of Hanoi and Morphisms , 2005, Developments in Language Theory.
[796] Andrzej Czygrinow,et al. On pebbling threshold functions for graph sequences , 2002, Discret. Math..
[797] Peter Winkler,et al. Universal configurations in light-flipping games , 2001, SODA '01.
[798] William I. Gasarch,et al. The Mapmaker's dilemma , 1991, Discret. Appl. Math..
[799] Hortensia Galeana-Sánchez,et al. Orientations of graphs in kernel theory , 1991, Discret. Math..
[800] A. J. Goldman,et al. The isolation game for regular graphs , 1993, Discret. Math..
[801] M. Richardson,et al. Solutions of Irreflexive Relations , 1953 .
[802] Joel H. Spencer,et al. The Liar Game Over an Arbitrary Channel , 2005, Comb..
[803] D. Poole. The Towers and Triangles of Professor Claus (or, Pascal Knows Hanoi) , 1994 .
[804] Martin Gardner,et al. Logic Machines, Diagrams and Boolean Algebra , 1968 .
[805] Ranan B. Banerji,et al. Strategy Construction Using Homomorphisms Between Games , 1972, Artif. Intell..
[806] Matthieu Latapy,et al. The lattice structure of chip firing games and related models , 2000 .
[807] R. Laver,et al. COUNTABLE LENGTH RAMSEY GAMES , 1998 .
[808] H. P.,et al. Mathematical Recreations , 1944, Nature.
[809] James Tanton,et al. Candy Sharing , 2003, Am. Math. Mon..
[810] Claude Berge,et al. Combinatorial games on a graph , 1996, Discret. Math..
[811] Iain A. Stewart,et al. Generalized Hex and Logical Characterizations of Polynomial Space , 1997, Inf. Process. Lett..
[812] P. Cull,et al. Perfect codes, NP-completeness, and Towers of Hanoi graphs , 1998 .
[813] Arthur T. Benjamin,et al. Across the board: The mathematics of chessboard problems , 2005 .
[814] Y. Yeh. A remarkable endofunction involving compositions , 1995 .
[815] Gabriel Nivasch,et al. The Sprague-Grundy function of the game Euclid , 2006, Discret. Math..
[816] A. L. Davies,et al. Rotating the Fifteen Puzzle , 1970, The Mathematical Gazette.
[817] Alewyn P. Burger,et al. Queens graphs for chessboards on the torus , 2001, Australas. J Comb..
[818] Jennifer Ryan,et al. Tournament games and positive tournaments , 1995, J. Graph Theory.
[819] Steve Alpern,et al. Hex games and twist maps on the annulus , 1991 .
[820] Frank Harary,et al. A Symmetric Strategy in Graph Avoidance Games , 2001, ArXiv.
[821] Bala Kalyanasundaram,et al. On the power of white pebbles , 1991, STOC '88.
[822] David Moews,et al. Coin-Sliding and Go , 1996, Theor. Comput. Sci..
[823] Oren Patashnik. Qubic: 4×4×4 Tic-Tac-Toe , 1980 .
[824] J. Pach. On the Game of Misery , 1992 .
[825] Martin Gardner,et al. The Last Recreations , 1997 .
[826] M. C. Er,et al. The Colour Towers of Hanoi: A Generalization , 1984, Comput. J..
[827] David B. Leep,et al. MARRIAGE, MAGIC, AND SOLITAIRE , 1999 .
[828] David Wolfe,et al. The structure of the distributive lattice of games born by day . , 2005 .
[829] N. J. A. Sloane,et al. Lexicographic codes: Error-correcting codes from game theory , 1986, IEEE Trans. Inf. Theory.
[830] Ryan B. Hayward,et al. Solving 7x7 Hex with domination, fill-in, and virtual connections , 2005, Theor. Comput. Sci..
[831] Steven Minsker,et al. The Towers of Antwerpen Problem , 1991, Inf. Process. Lett..
[832] Stephan Dominique Andres. The game chromatic index of forests of maximum degree Delta>=5 , 2006, Discret. Appl. Math..
[833] A. J. van Zanten,et al. The complexity of an optimal algorithm for the generalized tower of hanoi problem , 1990, Int. J. Comput. Math..
[834] Marcia Ascher,et al. Mu Torere: An Analysis of a Maori Game , 1987 .
[835] Uri Zwick,et al. The Complexity of Mean Payoff Games on Graphs , 1996, Theor. Comput. Sci..
[836] David C. Fisher,et al. Optimal strategies for a generalized “scissors, paper, and stone” game , 1992 .
[837] Hans L. Bodlaender,et al. Kayles on Special Classes of Graphs - An Application of Sprague-Grundy Theory , 1992, WG.
[838] Robin W. Dawes,et al. Some Pursuit-Evasion Problems on Grids , 1992, Inf. Process. Lett..
[839] Jack Edmonds,et al. Lehmans switching game and a theorem of Tutte and Nash-Williams , 1965 .
[840] Elwyn R. Berlekamp,et al. Where Is the " Thousand-Dollar Ko ''? , 1996 .
[841] Péter Csorba. On the biased n-in-a-row game , 2005, Discret. Math..
[842] Hortensia Galeana-Sánchez,et al. Extending kernel perfect digraphs to kernel perfect critical digraphs , 1991, Discret. Math..
[843] E. H. Moore. A Generalization of the Game Called Nim , 1910 .
[844] A. J. Goldman,et al. On Ringeisen's isolation game II , 1991, Discret. Math..
[845] Hortensia Galeana-Sánchez,et al. On the existence of kernels and h-kernels in directed graphs , 1992, Discret. Math..
[846] J. Spencer. Guess a number - with lying , 1984 .
[847] Aviezri S. Fraenkel,et al. Combinatorial Games: selected Bibliography with a Succinct Gourmet Introduction , 2012 .
[848] Aviezri S. Fraenkel,et al. Combinatorial games with an annihilation rule , 1974 .
[849] Edward L. Spitznagel,et al. A New Look at the Fifteen Puzzle , 1967 .
[850] Hortensia Galeana-Sánchez,et al. A counterexample to a conjecture of meyniel on kernel-perfect graphs , 1982, Discret. Math..
[851] P. Mangan. The new game in town. , 1993, Nursing times.
[852] Mostafa Blidia,et al. A parity digraph has a kernel , 1986, Comb..
[853] R. Nowakowski,et al. Vertex deletion games with parity rules. , 2005 .
[854] L. P. Varvak. Games on the sum of graphs , 1968 .
[855] Thane E. Plambeck,et al. Taming the wild in impartial combinatorial games , 2005 .
[856] G. Heuer. Reduction of Silverman-like games to games on bounded sets , 1989 .
[857] Henry Meyniel,et al. The vertex picking game and a variation of the game of dots and boxes , 1988, Discret. Math..
[858] Martin Gardner,et al. Further Mathematical Diversions , 1971 .
[859] Henry Meyniel,et al. Kernels in directed graphs: a poison game , 1993, Discret. Math..
[860] Mario Szegedy,et al. In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved? , 1999, STACS.
[861] Yohei Yamasaki,et al. Theory of Division Games , 1978 .
[862] N. Blachman,et al. Elusive Optimality in the Box Problem , 2001 .
[863] David Poole,et al. Geography Played on Products of Directed Cycles , 1996 .
[864] Xuding Zhu,et al. A bound for the game chromatic number of graphs , 1999, Discret. Math..