Title: Games of No Chance III
Editors: M. H. Albert and R. J. Nowakowski
M. H. Albert, R. E. L. Aldred, M. D. Atkinson, C. C. Handley,
D. A. Holton, D. J. McCaughan, and B. E. Sagan, Monotonic Sequence Games.
Elwyn Berlekamp, Yellow Brown Hackenbush
Tristan Cazenave, The use of direct threats in a Monte-Carlo Go program
Erik D. Demaine, Playing Games with Algorithms:
Algorithmic Combinatorial
Game Theory.
Erik D. Demaine , Martin L. Demaine , Rudolf Fleischer,
Robert A. Hearn , and Timo von Oertzen, The Complexity of Dyson Telescopes.
Lim Yew Jin and Jurg Nievergelt, Tigers and Goats is a draw
Adam Duffy, Garrett Kolpin, and David Wolfe, Ordinal Partizan End Nim
Aviezri S. Fraenkel , Elnatan Reisner, The game of End-Wythoff.
Eric J. Friedman, Adam S. Landsberg, On the Geometry of Combinatorial Games:
A renormalization approach
J. P. Grossman, Aaron N. Siegel, Reductions of Partizan Games.
Ryan B. Hayward, A puzzling Hex primer
Robert A. Hearn, Amazons, Konane, and Cross Purposes are PSPACE-complete
Thane Plambeck, Advances in Losing.
G. A. Mesdal III, Partizan Splittles
Teigo Nakamura, On Counting Liberties in Capturing Races of Go
Gabriel Nivasch, More on the Sprague?Grundy function for
Wythoff ?s game
Aaron N. Siegel, Loopy Games
Aaron N. Siegel, Coping with Cycles
Aaron N. Siegel, Backsliding Toads and Frogs
Thomas Wolf , A library of eyes in Go I: A life & death definition consistent with ?bent-4?
Thomas Wolf , A library of eyes in Go II: Monolithic eyes
D. Wolfe, on day $n$.
@article {MR2342186,
AUTHOR = {Abbasi, Sarmad and Sheikh, Numan},
TITLE = {Some hardness results for question/answer games},
JOURNAL = {Integers, Electr. J of Combinat. Number Theory},
FJOURNAL = {Integers. Electronic Journal of Combinatorial Number Theory},
VOLUME = {7},
YEAR = {2007},
PAGES = {\#G08, 29 pp.},
url = {http://www.integers-ejcnt.org/vol7.html},
ISSN = {1553-1732},
MRCLASS = {68Q25 (05C38 68Q17 91A43)},
MRNUMBER = {MR2342186},
}
@article{AbYu1989,
author = {B. Abramson and M. Yung},
year = 1989,
title = {Divide and conquer under global constraints:
a solution to the $n$-queens problem},
journal = {J. Parallel Distrib. Comput.},
volume = 6,
pages = {649-662},
}
@inproceedings{AIK1981,
author = {A. Adachi and S. Iwata and T. Kasai},
year = 1981,
title = {Low level complexity for combinatorial games},
booktitle = {Proc. 13th Ann. ACM Symp. Theory of Computing (Milwaukee, WI, 1981)},
organization = {Assoc. Comput. Mach., New York, NY},
pages = {228-237},
}
@article{AIK1984,
author = {A. Adachi and S. Iwata and T. Kasai},
year = 1984,
title = {Some combinatorial game problems require $\Omega (n^k)$ time},
journal = {J. Assoc. Comput. Mach.},
volume = 31,
pages = {361-376},
}
@article{AKI1987,
author = {H. Adachi and H. Kamekawa and S. Iwata},
year = 1987,
title = {Shogi on $n\times n$ board is complete in exponential time},
journal = {Trans. IEICE},
volume = {J70-D},
pages = {1843-1852 {(in Japanese)}},
}
@inproceedings{AB1956,
author = {E. W. Adams and D. C. Benson},
year = 1956,
title = {Nim-Type Games},
booktitle = {Technical Report No. 31},
number = {Department of Mathematics},
pages = {},
address = {Pittsburgh, PA},
}
@book{Ahr1910,
author = {W. Ahrens},
year = 1910,
title = {Mathematische Unterhaltungen und Spiele},
volume = {I},
note = {Zweite vermehrte und verbesserte Auflage. (There are further
editions and related game-books of Ahrens)},
publisher = {Teubner, Leipzig},
}
@article{ABDHKKRSU2005,
author = {O. Aichholzer and D. Bremmer and E. D. Demaine and F. Hurtado
and E. Kranakis and H. Krasser and S. Ramaswami and S. Sethia and J. Urrutia},
year = 2005,
title = {Games on triangulations},
journal = {Theoret. Comput. Sci.},
volume = 259,
note = {special issue: Game Theory Meets Theoretical Computer Science},
mrnumber = {MR2168844 (2006d:91037)},
pages = {42-71},
}
@article {MR2038401,
AUTHOR = {Aida, Shin and Crasmaru, Marcel and Regan, Kenneth and
Watanabe, Osamu},
TITLE = {Games with uniqueness properties},
NOTE = {Symposium on Theoretical Aspects of Computer Science
(Antibes-Juan les Pins, 2002)},
JOURNAL = {Theory Comput. Syst.},
FJOURNAL = {Theory of Computing Systems},
VOLUME = {37},
YEAR = {2004},
PAGES = {29--47},
ISSN = {1432-4350},
CODEN = {TCSYFI},
MRCLASS = {68Q15 (68Q25 91A05)},
MRNUMBER = {MR2038401 (2004m:68055)},
MRREVIEWER = {Uwe Sch{\"o}ning},
}
@article{Aig1995,
author = {M. Aigner},
year = 1995,
title = {Ulams Millionenspiel},
journal = {Math. Semesterber.},
volume = 42,
pages = {71--80},
}
@article{Aig1996,
author = {M. Aigner},
year = 1996,
title = {Searching with lies},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 74,
pages = {43-56},
}
@article {MR739593,
AUTHOR = {Aigner, M. and Fromme, M.},
TITLE = {A game of cops and robbers},
JOURNAL = {Discrete Appl. Math.},
FJOURNAL = {Discrete Applied Mathematics. The Journal of Combinatorial
Algorithms, Informatics and Computational Sciences},
VOLUME = {8},
YEAR = {1984},
PAGES = {1--11},
ISSN = {0166-218X},
CODEN = {DAMADU},
MRCLASS = {90D26 (05C38 90D42)},
MRNUMBER = {MR739593 (85f:90124)},
MRREVIEWER = {Harold Reiter},
}
@article{ACN1979,
author = {M. Ajtai and L. Csirmaz and Zs. Nagy},
year = 1979,
title = {On a generalization of the game Go-Moku I},
journal = {Studia Sci. Math. Hungar.},
volume = 14,
pages = {209-226},
}
@article {AkDa1985,
AUTHOR = {Akin, Ethan and Davis, Morton},
TITLE = {Bulgarian solitaire},
JOURNAL = {Amer. Math. Monthly},
FJOURNAL = {The American Mathematical Monthly},
VOLUME = {92},
YEAR = {1985},
PAGES = {237--250},
ISSN = {0002-9890},
CODEN = {AMMYAE},
MRCLASS = {05A17 (90D99)},
MRNUMBER = {MR786523 (86m:05014)},
MRREVIEWER = {A. Pultr},
}
@incollection{AAAHHMS2008,
author = {M. H. Albert and R. E. L. Aldred and M. D. Atkinson and
C. C. Handley and D. A. Holton and D. J. McCaughan and B. E. Sagan},
year = 2008,
title = {Monotonic sequence games},
pages = {},
editor = {M. H. Albert and R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {},
booktitle = {Games of No Chance III, \emph{Proc. BIRS Workshop on
Combinatorial Games, July, 2005, Banff, Alberta, Canada, MSRI Publ.}},
}
@article{AGNW2005,
author = {M. H. Albert and J. P. Grossman and R. J. Nowakowski and D. Wolfe},
year = 2005,
title = {An introduction to Clobber},
journal = {Integers, Electr. J of Combinat. Number Theory},
volume = {5(2)},
pages = {\#A01, 12 pp.},
url = {http://www.integers-ejcnt.org/vol5(2).html},
mrnumber = {MR2192079},
}
@article{AlNo2001,
author = {M. H. Albert and R. J. Nowakowski},
year = 2001,
title = {The game of End-Nim},
journal = {Electr. J. Combin.},
volume = {8(2)},
pages = {\#R1, 12 pp.},
url = {http://www.combinatorics.org/},
note = {Volume in honor of Aviezri S. Fraenkel},
mrnumber = {MR1853252 (2002g:91044)},
}
@article{AlNo2004,
author = {M. H. Albert and R. J. Nowakowski},
year = 2004,
title = {Nim restrictions},
journal = {Integers, Electr. J of Combinat. Number Theory},
volume = {4},
pages = {\#G1, 10 pp., Comb. Games Sect.},
url = {http://www.integers-ejcnt.org/vol4.html},
mrnumber = {MR2056015},
}
@book{ANW2007,
author = {M. Albert and R. J. Nowakowski and D. Wolfe},
year = 2007,
title = {Lessons in Play: An Introduction to Combinatorial Game Theory},
publisher = {A K Peters},
}
@article{AlFr1884,
author = {R. E. Allardice and A. Y. Fraser},
year = 1884,
title = {La tour d'Hano\" {\i}},
journal = {Proc. Edinburgh Math. Soc.},
volume = 2,
pages = {50-53},
}
@mastersthesis{All1984,
author = {D. T. Allemang},
year = 1984,
title = {Machine computation with finite games},
school = {Cambridge University},
}
@article{All2001,
author = {D. T. Allemang},
year = 2001,
title = {Generalized genus sequences for mis\`ere octal games},
journal = {Intern. J. Game Theory,},
volume = {30},
pages = {539--556},
mrnumber = {MR1907264 (2003h:91003)},
}
@inproceedings{All1989,
author = {J. D. Allen},
year = 1989,
title = {A note on the computer solution of Connect-Four},
booktitle = {Heuristic Programming in Artificial Intelligence \emph{1:}
The First Computer Olympiad},
editor = {D. N. L. Levy and D. F. Beal},
pages = {134-135},
publisher = {Ellis Horwood, Chichester, England},
}
@article {All2007,
AUTHOR = {Allen, M. R.},
TITLE = {On the periodicity of genus sequences of quaternary games},
JOURNAL = {Integers, Electr. J. of Combinat. Number Theory},
FJOURNAL = {Integers. Electronic Journal of Combinatorial Number Theory},
VOLUME = {7},
YEAR = {2007},
PAGES = {\#G04, 11 pp.},
ISSN = {1553-1732},
MRCLASS = {91A46},
url = {http://www.integers-ejcnt.org/vol7.html},
MRNUMBER = {MR2299810 (2007k:91050)},
}
@article{Alli1985,
author = {N. L. Alling},
year = 1985,
title = {Conway's field of surreal numbers},
journal = {Trans. Amer. Math. Soc.},
volume = {287},
pages = {365-386},
}
@book{Alli1987,
author = {N. L. Alling},
year = 1987,
title = {Foundations of Analysis Over Surreal Number Fields},
publisher = {North-Holland, Amsterdam},
}
@article{Alli1989,
author = {N. L. Alling},
year = 1989,
title = {Fundamentals of analysis over surreal number fields},
journal = {Rocky Mountain J. Math.},
volume = {19},
pages = {565-573},
}
@article{AlEh1986b,
author = {N. L. Alling and P. Ehrlich},
year = 1986,
title = {An abstract characterization of a full class of surreal numbers},
journal = {C. R. Math. Rep. Acad. Sci.},
volume = {8},
pages = {303-308},
}
@article{AlEh1986a,
author = {N. L. Alling and P. Ehrlich},
year = 1986,
title = {An alternative construction of Conway's surreal numbers},
journal = {C. R. Math. Rep. Acad. Sci.},
volume = {8},
pages = {241--246},
}
@phdthesis{All1994,
author = {L. V. Allis},
title = {Searching for solutions in games and artificial intelligence},
school = {University of Limburg},
year = 1994,
url = {ftp://ftp.cs.vu.nl/pub/victor/PhDthesis/thesis.ps.Z}
}
@inproceedings{AlSc1992,
author = {L. V. Allis and P. N. A. Schoo},
year = 1992,
title = {Qubic solved again},
booktitle = {Heuristic Programming in Artificial Intelligence \emph{3:}
The Third Computer Olympiad},
editor = {H. J. van den Herik and L. V. Allis},
pages = {192-204},
publisher = {Ellis Horwood, New York},
}
@inproceedings{AHH1993,
author = {L. V. Allis and H. J. van den Herik and M. P. H. Huntjens},
year = 1993,
title = {Go-Moku solved by new search techniques},
booktitle = {Proc. 1993 AAAI Fall Symp. on Games: Planning and Learning},
number = {AAAI Press Tech. Report FS93--02},
pages = {1-9},
address = {Menlo Park, CA},
}
@article{AARS1994,
author = {J.-P. Allouche and D. Astoorian and J. Randall and J. Shallit},
year = 1994,
title = {Morphisms, squarefree strings, and the tower of Hanoi puzzle},
journal = {Amer. Math. Monthly},
volume = 101,
pages = {651-658},
mrnumber = {MR1289274 (95g:68090)},
}
@incollection {AlSa2005,
AUTHOR = {Allouche, Jean-Paul and Sapir, Amir},
TITLE = {Restricted towers of {H}anoi and morphisms},
BOOKTITLE = {Developments in Language Theory},
SERIES = {Lecture Notes in Comput. Sci.},
VOLUME = {3572},
PAGES = {1--10},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {2005},
MRCLASS = {68W01},
MRNUMBER = {MR2187246 (2006g:68266)},
}
@article{ABBS2002,
author = {N. Alon and J. Balogh and B. Bollob\'{a}s and T. Szab\'{o}},
year = 2002,
title = {Game domination number},
journal = {Discrete Math.},
volume = 256,
pages = {23-33},
mrnumber = {MR1927054 (2003f:05086)},
}
@article{AKSS2005,
author = {N. Alon and M. Krivelevich and J. Spencer and T. Szab\'{o}},
year = 2005,
title = {Discrepancy games},
journal = {Electr. J. Combin.},
volume = {12(1)},
pages = {\#R51, 9 pp.},
url = {http://www.combinatorics.org/},
mrnumber = {MR2176527},
}
@article{AT1995,
author = {N. Alon and Z. Tuza},
year = 1995,
title = {The acyclic orientation game on random graphs},
journal = {Random Structures Algorithms},
volume = 6,
pages = {261-268},
}
@article{AlBe1991,
author = {S. Alpern and A. Beck},
year = 1991,
title = {Hex games and twist maps on the annulus},
journal = {Amer. Math. Monthly},
volume = 98,
pages = {803-811},
}
@article{Alt1988,
author = {I. Alth\"ofer},
year = 1988,
title = {Nim games with arbitrary periodic moving orders},
journal = {Internat. J. Game Theory},
volume = 17,
pages = {165-175},
}
@article{Alt1988a,
author = {I. Alth\"ofer},
year = 1988,
title = {On the complexity of searching game trees and other recursion trees},
journal = {J. Algorithms},
volume = 9,
pages = {538-567},
}
@incollection{Alt1989,
author = {I. Alth\"ofer},
year = 1989,
title = {Generalized minimax algorithms are no better error
correctors than minimax is itself},
booktitle = {Advances in Computer Chess},
volume = 5,
editor = {D. F. Beal},
publisher = {Elsevier, Amsterdam},
pages = {265-282},
}
@article{AlBu1995,
author = {I. Alth\"ofer and J. B\"ultermann},
year = 1995,
title = {Superlinear period lengths in some subtraction games},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 148,
pages = {111-119},
}
@article {AmBa2006,
AUTHOR = {Ambrus, G. and Bar{\'a}t, J.},
TITLE = {A contribution to queens graphs: a substitution method},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {306},
YEAR = {2006},
NUMBER = {12},
PAGES = {1105--1114},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05C75},
MRNUMBER = {MR2245636 (2007b:05174)},
MRREVIEWER = {Terry A. McKee},
}
@article{AnFe1998,
author = {M. Anderson and T. Feil},
year = 1998,
title = {Turning lights out with linear algebra},
journal = {Math. Mag.},
volume = 71,
pages = {300-303},
}
@article{AnHa1987,
author = {M. Anderson and F. Harary},
year = 1987,
title = {Achievement and avoidance games for generating abelian groups},
journal = {Internat. J. Game Theory},
volume = 16,
pages = {321-325},
}
@article{ALSSTW1989,
author = {R. Anderson and L. Lov\'asz and P. Shor and J. Spencer
and \'E. Tard\'os and S. Winograd},
year = 1989,
title = {Disks, balls and walls: analysis of a combinatorial game},
journal = {Amer. Math. Monthly},
volume = 96,
pages = {481-493},
}
@article{And1984,
author = {T. Andreae},
year = 1984,
title = {Note on a pursuit game played on graphs},
journal = {Discrete Appl. Math.},
volume = 9,
pages = {111-115},
}
@article{And1986,
author = {T. Andreae},
year = 1986,
title = {On a pursuit game played on graphs for which a minor is excluded},
journal = {J. Combin. Theory \emph{(Ser.~B)}},
volume = 41,
pages = {37-47},
}
@article{AHW1999,
author = {T. Andreae and F. Hartenstein and A. Wolter},
year = 1999,
title = {A two-person game on graphs where each player tries to encircle
his opponent's men},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 215,
pages = {305-323},
}
@incollection {MR2153344,
AUTHOR = {Andres, Stephan Dominique},
TITLE = {The game chromatic index of forests of maximum degree 5},
BOOKTITLE = {2nd Cologne-Twente Workshop on Graphs and Combinatorial
Optimization},
SERIES = {Electron. Notes Discrete Math.},
VOLUME = {13},
PAGES = {4 pp. (electronic)},
PUBLISHER = {Elsevier},
ADDRESS = {Amsterdam},
YEAR = {2003},
MRCLASS = {05C15},
MRNUMBER = {MR2153344},
}
@incollection {MR2301125,
AUTHOR = {Andres, Stephan Dominique},
TITLE = {Game-perfect graphs with clique number 2},
BOOKTITLE = {CTW2006---Cologne-Twente Workshop on Graphs and Combinatorial
Optimization},
SERIES = {Electron. Notes Discrete Math.},
VOLUME = {25},
PAGES = {13--16 (electronic)},
PUBLISHER = {Elsevier},
ADDRESS = {Amsterdam},
YEAR = {2006},
MRCLASS = {05C15},
MRNUMBER = {MR2301125 (2008a:05080)},
}
@article {MR2221551,
AUTHOR = {Andres, Stephan Dominique},
TITLE = {The game chromatic index of forests of maximum degree
{$\Delta\geq 5$}},
JOURNAL = {Discrete Appl. Math.},
FJOURNAL = {Discrete Applied Mathematics. The Journal of Combinatorial
Algorithms, Informatics and Computational Sciences},
VOLUME = {154},
YEAR = {2006},
PAGES = {1317--1323},
ISSN = {0166-218X},
CODEN = {DAMADU},
MRCLASS = {05C15},
MRNUMBER = {MR2221551},
MRREVIEWER = {Guofei Zhou},
}
@inproceedings{Ans2000,
author = {V. V. Anshelevich},
year = 2000,
title = {The Game of Hex: an automatic theorem proving approach to game
programming},
booktitle = {Proc. 17-th National Conference on Artificial Intelligence
{\rm (}AAAI-2000{\rm )}},
editor = {},
organization = {AAAI Press, Menlo Park, CA},
pages = {189-194},
mrnumber = {MR1973011 (2004b:91039)},
}
@incollection{Ans2002,
author = {V. V. Anshelevich},
year = 2002,
title = {The game of Hex: the hierarchical approach},
pages = {151-165},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
}
@article{AnFa1988,
author = {R. P. Anstee and M. Farber},
year = 1988,
title = {On bridged graphs and cop-win graphs},
journal = {J. Combin. Theory \emph{(Ser.~B)}},
volume = 44,
pages = {22-28},
}
@article {MR1483752,
AUTHOR = {Apartsin, A. and Ferapontova, E. and Gurvich, V.},
TITLE = {A circular graph---counterexample to the {D}uchet kernel
conjecture},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {178},
YEAR = {1998},
PAGES = {229--231},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05C75},
MRNUMBER = {MR1483752 (98f:05122)},
}
@article{AJS1999,
author = {D. Applegate and G. Jacobson and D. Sleator},
year = 1999,
title = {Computer analysis of Sprouts},
journal = {{\rm in:} The Mathemagician and Pied Puzzler{\rm ,}},
chapter = {},
pages = {},
note = {honoring Martin Gardner; E. Berlekamp and T. Rodgers, eds.,
A K Peters, Natick, MA, pp. 199-201},
publisher = {},
}
@article{Ara1982,
author = {A. A. Arakelyan},
year = 1982,
title = {$D$-products and compositions of Nim games},
journal = {Akad. Nauk Armyan. SSR Dokl.},
volume = 74,
pages = {3-6},
note = {(Russian)},
}
@article{Arc1999,
author = {A. F. Archer},
year = 1999,
title = {A modern treatment of the $15$ puzzle},
journal = {Amer. Math. Monthly},
volume = 106,
pages = {793-799},
}
@book{Arn1993,
editor = {P. Arnold},
title = {The Book of Games},
publisher = {Hamlyn, Chancellor Press},
year = 1993,
}
@article{AQS1997,
author = {A. A. Arratia-Quesada and I. A. Stewart},
year = 1997,
title = {Generalized Hex and logical characterizations of polynomial space},
journal = {Inform. Process. Lett.},
volume = 63,
pages = {147-152},
}
@article{ArSt2003,
author = {A. A. Arratia and I. A. Stewart},
year = 2003,
title = {A note on first-order projections and games},
journal = {Theoret. Comput. Sci.},
volume = 290,
pages = {2085-2093},
mrnumber = {MR1937766 (2003i:68034)},
}
@article{Asc1987,
author = {M. Ascher},
year = 1987,
title = {Mu Torere: An analysis of a Maori game},
journal = {Math. Mag.},
volume = 60,
pages = {90-100},
}
@article{Ase1974,
author = {I. M. Asel'derova},
year = 1974,
title = {On a certain discrete pursuit game on graphs},
journal = {Cybernetics},
volume = 10,
pages = {859-864},
note = {trans. of {\it Kibernetika} {\bf 10} (1974) 102--105},
}
@article{AsDh1993,
author = {J. A. Aslam and A. Dhagat},
year = 1993,
title = {On-line algorithms for 2-coloring hypergraphs via chip games},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 112,
pages = {355-369},
}
@article{Atk1981,
author = {M. D. Atkinson},
year = 1981,
title = {The cyclic towers of Hanoi},
journal = {Inform. Process. Lett.},
volume = 13,
pages = {118-119},
}
@article{Aug1991,
author = {J. M. Auger},
year = 1991,
title = {An infiltration game on $k$ arcs},
journal = {Naval Res. Logistics},
volume = 38,
pages = {511-529},
}
@inproceedings{ANP1992,
author = {V. Auletta and A. Negro and G. Parlati},
year = 1992,
title = {Some results on searching with lies},
booktitle = {Proc. 4th Italian Conf. on Theoretical Computer Science},
editor = {},
organization = {L'Aquila, Italy},
pages = {24-37},
}
@article{ABW1993,
author = {J. Auslander and A. T. Benjamin and D. S. Wilkerson},
year = 1993,
title = {Optimal leapfrogging},
journal = {Math. Mag.},
volume = 66,
pages = {14-19},
}
@mastersthesis{Aus1976,
author = {R. Austin},
year = 1976,
title = {Impartial and partisan games},
school = {Univ. of Calgary},
}
@article{AyLo1985,
author = {J. O. A. Ayeni and H. O. D. Longe},
year = 1985,
title = {Game people play: Ayo},
journal = {Internat. J. Game Theory},
volume = 14,
pages = {207-218},
}
@article {AzBe2006,
AUTHOR = {Azriel, D. and Berend, D.},
TITLE = {On a question of {L}eiss regarding the {H}anoi {T}ower
problem},
JOURNAL = {Theoret. Comput. Sci.},
FJOURNAL = {Theoretical Computer Science},
VOLUME = {369},
YEAR = {2006},
NUMBER = {1-3},
PAGES = {377--383},
ISSN = {0304-3975},
CODEN = {TCSDI},
MRCLASS = {68W40 (05C20 91A46)},
MRNUMBER = {MR2277583 (2007h:68226)},
}
@inproceedings{Baba1985,
author = {L. Babai},
year = 1985,
title = {Trading group theory for randomness},
booktitle = {Proc. 17th Ann. ACM Symp. Theory of Computing, \emph{Assoc.
Comput. Mach., New York, NY}},
pages = {421 - 429},
}
@article{BaMo1988,
author = {L. Babai and S. Moran},
year = 1988,
title = {Arthur--Merlin games: a randomized proof system, and a hierarchy of complexity classes},
journal = {J. Comput. System Sci.},
volume = 36,
pages = {254-276},
}
@article{BaWr1995,
author = {R. J. R. Back and J. von Wright},
year = 1995,
title = {Games and winning strategies},
journal = {Inform. Process. Lett.},
volume = 53,
pages = {165-172},
}
@inbook{BaMi2004,
author = {R. Backhouse and D. Michaelis},
year = 2004,
title = {{\rm Fixed-point characterisation of winning strategies in
impartial games in:} Relational and Kleene-Algebraic Methods in
Computer Science},
publisher = {Lecture Notes in Computer Scienc, Springer Berlin, Heidelberg},
chapter ={},
volume = {3051/2004},
pages = {34-47},
}
@article{BaKi1985,
author = {C. K. Bailey and M. E. Kidwell},
year = 1985,
title = {A king's tour of the chessboard},
journal = {Math. Mag.},
volume = 58,
pages = {285-286},
}
@book{BaCo1987,
author = {W. W. R. Ball and H. S. M. Coxeter},
year = 1987,
title = {Mathematical Recreations and Essays},
edition = {13th},
publisher = {Dover, New York, NY},
}
@article{BaWa,
AUTHOR = {Balof, Barry A. and Watkins, John J.},
TITLE = {Knight's tours and magic squares},
BOOKTITLE = {Proceedings of the Twenty-seventh Southeastern International
Conference on Combinatorics, Graph Theory and Computing (Baton
Rouge, LA, 1996)},
JOURNAL = {Congr. Numer.},
FJOURNAL = {Congressus Numerantium. A Conference Journal on Numerical
Themes},
VOLUME = {120},
YEAR = {1996},
PAGES = {23--32},
note = {Proc. 27th Southeastern Internat. Conf. on Combinatorics,
Graph Theory and Computing (Baton Rouge, LA, 1996)},
ISSN = {0384-9864},
MRCLASS = {05B15},
MRNUMBER = {MR1431952},
}
@article{BaPu1990,
author = {B. Banaschewski and A. Pultr},
year = {1990/91},
title = {Tarski's fixpoint lemma and combinatorial games},
journal = {Order},
volume = 7,
pages = {375-386},
}
@inproceedings{Ban1971,
author = {R. B. Banerji},
year = 1971,
title = {Similarities in games and their use in strategy construction},
booktitle = {Proc. Symp. Computers and Automata},
editor = {J. Fox},
organization = {Polytechnic Press, Brooklyn, NY},
pages = {337-357},
}
@book{Ban1980,
author = {R. B. Banerji},
year = 1980,
title = {Artificial Intelligence, A Theoretical Approach},
publisher = {Elsevier, North-Holland, New York, NY},
}
@article{BaDu1992,
author = {R. B. Banerji and C. A. Dunning},
year = 1992,
title = {On misere games},
journal = {Cybernetics and Systems},
volume = 23,
pages = {221-228},
}
@article{BaEr1972,
author = {R. B. Banerji and G. W. Ernst},
year = 1972,
title = {Strategy construction using homomorphisms between games},
journal = {Artificial Intelligence},
volume = 3,
pages = {223-249},
}
@article{YEM1993,
author = {Bar Yehuda, R. and T. Etzion and S. Moran},
year = 1993,
title = {Rotating-table games and derivatives of words},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 108,
pages = {311-329},
}
@article {MR1214102,
AUTHOR = {Barabash, Alexander and Fraenkel, Aviezri S. and Weiss, Barak},
TITLE = {Iterated {B}eatty functions},
JOURNAL = {Random Comput. Dynam.},
FJOURNAL = {Random \& Computational Dynamics},
VOLUME = {1},
YEAR = {1992/93},
PAGES = {333--348},
ISSN = {1061-835X},
CODEN = {RCDYEM},
MRCLASS = {11B34 (11B75)},
MRNUMBER = {MR1214102 (94g:11010)},
MRREVIEWER = {R. G. Stoneham},
}
@article{Bar1979,
author = {I. B\'ar\'any},
year = 1979,
title = {On a class of balancing games},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 26,
pages = {115-126},
}
@article{Bar1974,
author = {J. G. Baron},
year = 1974,
title = {The game of nim --- a heuristic approach},
journal = {Math. Mag.},
volume = 47,
pages = {23-28},
}
@article{BBGKMP2008,
author = {T. Bartnicki and B. Bre\u{s}ar and J. Grytczuk and M. Kov\u{s}e
and Z. Miechowicz and I. Peterinz},
year = 2008,
title = {Game chromatic number of Cartesian product graphs},
journal = {Electr. J. Combin.},
volume = {15(1)},
pages = {\#R72, 13 pp.},
url = {http://www.combinatorics.org/},
mrnumber = {**MR pending},
}
@article {MR2392056,
AUTHOR = {Bartnicki, T. and Grytczuk, J. A. and Kierstead, H. A.},
TITLE = {The game of arboricity},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {308},
YEAR = {2008},
PAGES = {1388--1393},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05C15 (05C20 05C35 91A43)},
MRNUMBER = {MR2392056},
}
@article {MR2360907,
AUTHOR = {Bartnicki, Tomasz and Grytczuk, Jaros{\l}aw and Kierstead, H.
A. and Zhu, Xuding},
TITLE = {The map-coloring game},
JOURNAL = {Amer. Math. Monthly},
FJOURNAL = {American Mathematical Monthly},
VOLUME = {114},
YEAR = {2007},
PAGES = {793--803},
ISSN = {0002-9890},
CODEN = {AMMYAE},
MRCLASS = {05C15 (05C55 91A43)},
MRNUMBER = {MR2360907},
}
@article{BaRa1996,
author = {R. Barua and S. Ramakrishnan},
year = 1996,
title = {$\sigma$-game, $\sigma^+$-game and two-dimen\-sional
additive cellular automata},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 154,
pages = {349-366},
}
@article{BaBo1985,
author = {V. J. D. Baston and F. A. Bostock},
year = 1985,
title = {A game locating a needle in a cirular haystack},
journal = {J. Optimization Theory and Applications},
volume = 47,
pages = {383-391},
}
@article{BaBo1986,
author = {V. J. D. Baston and F. A. Bostock},
year = 1986,
title = {A game locating a needle in a square haystack},
journal = {J. Optimization Theory and Applications},
volume = 51,
pages = {405-419},
}
@article{BaBo1987,
author = {V. J. D. Baston and F. A. Bostock},
year = 1987,
title = {Discrete hamstrung squad car games},
journal = {Internat. J. Game Theory},
volume = 16,
pages = {253-261},
}
@article{BaBo1988,
author = {V. J. D. Baston and F. A. Bostock},
year = 1988,
title = {A simple cover-up game},
journal = {Amer. Math. Monthly},
volume = 95,
pages = {850-854},
}
@article{BaBo1989,
author = {V. J. D. Baston and F. A. Bostock},
year = 1989,
title = {A one-dimensional helicopter-sub\-mar\-ine game},
journal = {Naval Res. Logistics},
volume = 36,
pages = {479-490},
}
@article{BaBo1993,
author = {V. J. D. Baston and F. A. Bostock},
year = 1993,
title = {Infinite deterministic graphical games},
journal = {SIAM J. Control Optim.},
volume = 31,
pages = {1623-1629},
}
@incollection{BGLM1975,
author = {J. Baumgartner and F. Galvin and R. Laver and R. McKenzie},
year = 1975,
title = {Game theoretic versions of partition relations},
pages = {131-135},
editor = {A. Hajnal and R. Rado and V. T. S\'os},
booktitle = {Colloquia Mathematica Societatis J\'anos Bolyai
{\bf 10}, Proc. Internat. Colloq. on Infinite and Finite Sets,
\emph{Vol.~1, Keszthely, Hungary, 1973}},
publisher = {North-Holland},
}
@book{Bea1985,
author = {J. D. Beasley},
year = 1985,
title = {The Ins \& Outs of Peg Solitaire},
publisher = {Oxford University Press, Oxford},
}
@book{Bea1989,
author = {J. D. Beasley},
year = 1989,
title = {The Mathematics of Games},
publisher = {Oxford University Press, Oxford},
}
@book{Bea1995,
author = {P. Beaver},
year = 1995,
title = {Victorian Parlour Games},
publisher = {Magna Books},
}
@incollection{Bec2000,
author = {A. Beck},
year = 1969,
title = {Games},
chapter = 5,
pages = {317-387},
editor = {A. Beck and M. N. Bleicher and D. W. Crowe},
booktitle = {Excursions into Mathematics},
EDITION = {millennium},
NOTE = {With a foreword by Martin Gardner; first appeared in 1969,
Worth Publ.},
publisher = {A K Peters},
ADDRESS = {Natick, MA},
MRNUMBER = {MR1744676 (2000k:00002)},
}
@article{Bec1981,
author = {J. Beck},
year = 1981,
title = {On positional games},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 30,
pages = {117-133},
}
@article{Bec1981a,
author = {J. Beck},
year = 1981,
title = {Van der Waerden and Ramsey type games},
journal = {Combinatorica},
volume = 1,
pages = {103-116},
}
@article{Bec1982,
author = {J. Beck},
year = 1982,
title = {On a generalization of Kaplansky's game},
journal = {Discrete Math.},
volume = 42,
pages = {27-35},
}
@article{Bec1982a,
author = {J. Beck},
year = 1982,
title = {Remarks on positional games, I},
journal = {Acta Math. Acad. Sci. Hungar.},
volume = 40,
number = {1--2},
pages = {65-71},
}
@article{Bec1983,
author = {J. Beck},
title = {Biased {Ramsey} type games},
journal = {Studia Sci. Math. Hung.},
year = 1983,
volume = 18,
pages = {287-292},
}
@article{Bec1985,
author = {J. Beck},
year = 1985,
title = {Random graphs and positional games on the complete graph},
journal = {Ann. Discrete Math.},
volume = 28,
pages = {7-13},
}
@incollection{Bec1993,
author = {J. Beck},
year = 1993,
title = {Achievement games and the probabilistic method},
pages = {51--78},
volume = {1},
booktitle = {Combinatorics, Paul Erd\H os is Eighty},
publisher = {Bolyai Soc. Math. Stud., J\'anos Bolyai Math. Soc.,
Budapest},
}
@article{Bec1994,
author = {J. Beck},
title = {Deterministic graph games and a probabilistic intuition},
journal = {Combin. Probab. Comput.},
year = 1994,
volume = 3,
pages = {13--26},
}
@article{Bec1996,
author = {J. Beck},
title = {Foundations of positional games},
journal = {Random Structures Algorithms},
year = 1996,
volume = 9,
pages = {15--47},
note = {appeared first in: Proc. Seventh International Conference on
Random Structures and Algorithms, Atlanta, GA, 1995},
}
@incollection{Bec1997,
author = {J. Beck},
year = 1997,
title = {Games, randomness and algorithms},
editor = {R. L. Graham and J. Ne\v{s}et\v{r}il},
pages = {280-310},
volume = {I},
booktitle = {The Mathematics of Paul Erd\H os},
publisher = {Springer},
}
@inproceedings{Bec1997a,
author = {J. Beck},
title = {Graph games},
booktitle = {Proc. Int. Coll. Extremal Graph Theory},
year = 1997,
address = {Balatonlelle, Hungary},
}
@article{Bec2002a,
author = {J. Beck},
year = 2002,
title = {Positional games and the second moment method},
journal = {Combinatorica},
volume = 22,
pages = {169-216},
note = {special issue: Paul Erd\"{o}s and his mathematics},
mrnumber = {MR1909083 (2003i:91027)},
}
@article{Bec2002b,
author = {J. Beck},
year = 2002,
title = {Ramsey games},
journal = {Discrete Math.},
volume = 249,
pages = {3-30},
mrnumber = {MR1898254 (2003e:05084)},
}
@article{Bec2002c,
author = {J. Beck},
year = 2002,
title = {The Erd\"{o}s-Selfridge theorem in positional game theory},
journal = {Bolyai Soc. Math. Stud.},
volume = 11,
pages = {33-77},
note = {Paul Erd\"{o}s and his mathematics, II, J\'{a}nos Bolyai Math.
Soc., Budapest},
mrnumber = {MR1954724 (2004a:91028)},
}
@article{Bec2002d,
author = {J. Beck},
year = 2002,
title = {Tic-Tac-Toe},
journal = {Bolyai Soc. Math. Stud.},
volume = 10,
pages = {93-137},
note = {J\'{a}nos Bolyai Math. Soc., Budapest},
mrnumber = {MR1919569 (2003e:05137)},
}
@article {Bec2005,
AUTHOR = {Beck, J{\'o}zsef},
TITLE = {Positional games},
JOURNAL = {Combin. Probab. Comput.},
FJOURNAL = {Combinatorics, Probability and Computing},
VOLUME = {14},
YEAR = {2005},
NUMBER = {5-6},
PAGES = {649--696},
ISSN = {0963-5483},
MRCLASS = {91A24 (05C65 91A46)},
MRNUMBER = {MR2174650 (2006f:91030)},
MRREVIEWER = {Vincent J. Vannetelbosch},
}
@book{Bec2008,
author = {J. Beck},
year = 2008,
title = {Tic-Tac-Toe Theory},
publisher = {Cambridge University Press, Cambridge},
}
@article{BeCs1982,
author = {J. Beck and L. Csirmaz},
year = 1982,
title = {Variations on a game},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 33,
pages = {297-315},
}
@article{BeGa1991,
author = {R. Beigel and W. I. Gasarch},
year = 1991,
title = {The mapmaker's dilemma},
journal = {Discrete Appl. Math.},
volume = 34,
pages = {37-48},
}
@article {BBH1999,
AUTHOR = {L. W. Beineke and I. Broereand and M. A. Henning},
TITLE = {Queens graphs},
NOTE = {Combinatorics and number theory (Tiruchirappalli, 1996)},
JOURNAL = {Discrete Math.},
VOLUME = {206},
YEAR = {1999},
PAGES = {63--75},
MRCLASS = {05C75},
MRNUMBER = {MR1665386 (2000f:05066)},
}
@article{BBCH2003,
author = {A. Bekmetjev and G. Brightwell and A. Czygrinow and G. Hurlbert},
year = 2003,
title = {Thresholds for families of multisets, with an application
to graph pebbling},
journal = {Discrete Math.},
volume = 269,
pages = {21-34},
mrnumber = {MR1989450 (2004i:05152)},
}
@article {Bel2007a,
AUTHOR = {Bell, George I.},
TITLE = {A fresh look at peg solitaire},
JOURNAL = {Math. Mag.},
FJOURNAL = {Mathematics Magazine},
VOLUME = {80},
YEAR = {2007},
NUMBER = {1},
PAGES = {16--28},
ISSN = {0025-570X},
CODEN = {MAMGA8},
MRCLASS = {91A46 (00A08 05A99)},
MRNUMBER = {MR2286485},
}
@article {MR2282183,
AUTHOR = {Bell, George I.},
TITLE = {Diagonal peg solitaire},
JOURNAL = {Integers, Electr. J. of Combinat. Number Theory},
FJOURNAL = {Integers. Electronic Journal of Combinatorial Number Theory},
VOLUME = {7},
YEAR = {2007},
PAGES = {\#G01, 20 pp.},
url = {http://www.integers-ejcnt.org/vol7.html},
ISSN = {1553-1732},
MRCLASS = {05A99 (91A46)},
MRNUMBER = {MR2282183 (2007j:05018)},
}
@article {BHG2007,
AUTHOR = {Bell, George I. and Hirschberg, Daniel S. and
Guerrero-Garc{\'{\i}}a, Pablo},
TITLE = {The minimum size required of a solitaire army},
JOURNAL = {Integers, Electr. J. of Combinat. Number Theory},
FJOURNAL = {Integers. Electronic Journal of Combinatorial Number Theory},
VOLUME = {7},
YEAR = {2007},
PAGES = {\#G07, 22 pp.},
url = {http://www.integers-ejcnt.org/vol7.html},
ISSN = {1553-1732},
MRCLASS = {91A46},
MRNUMBER = {MR2342185},
}
@book{Bel1960,
author = {R. C. Bell},
year = {1960, 1969},
title = {Board and Table Games from Many Civilisations},
volume = {I \& II},
publisher = {Oxford University Press},
note = {revised in 1979, Dover},
}
@book{Bel1988,
author = {R. Bell and M. Cornelius},
year = 1988,
title = {Board Games Round the World: A Resource Book for Mathematical
Investigations},
publisher = {Cambridge University Press, Cambridge},
note = {reprinted 1990},
}
@article{BFH2001,
author = {A. J. Benjamin and M. T. Fluet and M. L. Huber},
year = 2001,
title = {Optimal Token Allocations in Solitaire Knock 'm Down},
journal = {Electr. J. Combin.},
volume = {8(2)},
pages = {\#R2, 8 pp.},
url = {http://www.combinatorics.org/},
note = {Volume in honor of Aviezri S. Fraenkel},
mrnumber = {MR1853253 (2002g:91048)},
}
@article{BMW1991,
author = {S. J. Benkoski and M. G. Monticino and J. R. Weisinger},
year = 1991,
title = {A survey of the search theory literature},
journal = {Naval Res. Logistics},
volume = 38,
pages = {469-494},
}
@article{Ben1994,
author = {G. Bennett},
year = 1994,
title = {Double dipping: the case of the missing binomial coefficient identities},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 123,
pages = {351-375},
}
@article {Ben1987,
AUTHOR = {Bentz, Hans-J.},
TITLE = {Proof of the {B}ulgarian {S}olitaire conjectures},
JOURNAL = {Ars Combin.},
FJOURNAL = {Ars Combinatoria},
VOLUME = {23},
YEAR = {1987},
PAGES = {151--170},
ISSN = {0381-7032},
CODEN = {ACOMDN},
MRCLASS = {05A17 (90D42)},
MRNUMBER = {MR886950 (88k:05018)},
MRREVIEWER = {D. A. Klarner},
}
@article {MR2382343,
AUTHOR = {Berkove, Ethan and Van Sickle, Jenna and Hummon, Ben and
Kogut, Joy},
TITLE = {An analysis of the (colored cubes){$^3$} puzzle},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {308},
YEAR = {2008},
NUMBER = {7},
PAGES = {1033--1045},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05B99 (00A08)},
MRNUMBER = {MR2382343},
}
@article {{BeSa2006,
AUTHOR = {Berend, Daniel and Sapir, Amir},
TITLE = {The cyclic multi-peg tower of {H}anoi},
JOURNAL = {ACM Trans. Algorithms},
FJOURNAL = {ACM Transactions on Algorithms},
VOLUME = {2},
YEAR = {2006},
PAGES = {297--317},
ISSN = {1549-6325},
MRCLASS = {68Q25 (05A05 05C12 68W40 91A46)},
MRNUMBER = {MR2253783},
MRREVIEWER = {Hsien-Kuei Hwang},
}
@article {BeSa2006b,
AUTHOR = {Berend, Daniel and Sapir, Amir},
TITLE = {The diameter of {H}anoi graphs},
JOURNAL = {Inform. Process. Lett.},
FJOURNAL = {Information Processing Letters},
VOLUME = {98},
YEAR = {2006},
PAGES = {79--85},
ISSN = {0020-0190},
CODEN = {IFPLAT},
MRCLASS = {68W40 (05C85 68Q25)},
MRNUMBER = {MR2207581 (2006m:68187)},
MRREVIEWER = {Jean-Paul Allouche},
}
@incollection{Ber1981,
author = {D. Berengut},
year = 1981,
title = {A random hopscotch problem or how to make Johnny read more},
pages = {51-59},
editor = {D. A. Klarner},
publisher = {Wadsworth Internat., Belmont, CA},
booktitle = {The Mathematical Gardner},
}
@article{BeGn1984,
author = {B. Berezovskiy and A. Gnedin},
year = 1984,
title = {The best choice problem},
journal = {Akad. Nauk, USSR, Moscow \emph{(in Russian)}},
}
@article {Ber1956,
AUTHOR = {Berge, Claude},
TITLE = {La fonction de {G}rundy d'un graphe infini},
JOURNAL = {C. R. Acad. Sci. Paris},
VOLUME = {242},
YEAR = {1956},
PAGES = {1404--1407},
MRCLASS = {90.0X},
MRNUMBER = {MR0089115 (19,621d)},
}
@book {Ber1957,
AUTHOR = {Berge, C.},
TITLE = {Th\'eorie g\'en\'erale des jeux \`a {$n$} personnes},
SERIES = {M\'emor. Sci. Math., no. 138},
PUBLISHER = {Gauthier-Villars},
ADDRESS = {Paris},
YEAR = {1957},
PAGES = {114},
MRCLASS = {90.00},
MRNUMBER = {MR0099259 (20 \#5700)},
MRREVIEWER = {I. Mann},
}
@article{Ber1976,
author = {C. Berge},
year = 1976,
title = {Sur les jeux positionnels},
journal = {Cahiers du Centre \'Etudes Rech. Op\'er.},
volume = 18,
pages = {91-107},
}
@incollection{Ber1977,
author = {C. Berge},
year = 1977,
title = {Vers une th\'eorie g\'en\'erale des jeux positionnels},
editor = {R. Henn and O. Moeschlin},
pages = {13-24},
publisher = {Springer Verlag, Berlin},
volume = 141,
booktitle = {Mathematical Economics and Game Theory, Essays in
Honor of Oskar Morgenstern, \emph{Lecture Notes in Economics}},
}
@incollection{Ber1981a,
author = {C. Berge},
year = 1981,
title = {Some remarks about a Hex problem},
pages = {25-27},
editor = {D. A. Klarner},
publisher = {Wadsworth Internat., Belmont, CA},
booktitle = {The Mathematical Gardner},
}
@article {Ber1982,
AUTHOR = {Berge, C.},
TITLE = {Les jeux combinatoires},
JOURNAL = {Cahiers Centre \'Etudes Rech. Op\'er.},
FJOURNAL = {Cahiers du Centre d'\'Etudes de Recherche Op\'erationnelle},
VOLUME = {24},
YEAR = {1982},
PAGES = {89--105},
ISSN = {0008-9737},
CODEN = {CCROAT},
MRCLASS = {90D05 (05B30)},
MRNUMBER = {MR687875 (84d:90112)},
}
@inbook{Ber1985,
author = {C. Berge},
year = 1985,
title = {Graphs},
chapter = 14,
publisher = {North-Holland, Amsterdam},
}
@inbook{Ber1989,
author = {C. Berge},
year = 1989,
title = {Hypergraphs},
chapter = 4,
publisher = {Elsevier (French: Gauthier Villars 1988)},
}
@article {Ber1992,
AUTHOR = {Berge, Claude},
TITLE = {Les jeux sur un graphe},
JOURNAL = {Cahiers Centre \'Etudes Rech. Op\'er.},
FJOURNAL = {Cahiers du Centre d'\'Etudes de Recherche Op\'erationnelle.
Operations Research, Statistics and Applied Mathematics},
VOLUME = {34},
YEAR = {1992},
PAGES = {95--101},
ISSN = {0774-3068},
CODEN = {CCROAT},
MRCLASS = {05C99 (05C65 90D35)},
MRNUMBER = {MR1226531 (94h:05089)},
MRREVIEWER = {Robin J. Wilson},
}
@article{Ber1996,
author = {C. Berge},
year = 1996,
title = {Combinatorial games on a graph},
journal = {Discrete Math.},
volume = 151,
pages = {59-65},
}
@article{BeDu1988,
author = {C. Berge and P. Duchet},
year = 1988,
title = {Perfect graphs and kernels},
journal = {Bull. Inst. Math. Acad. Sinica},
volume = 16,
pages = {263-274},
}
@article{BeDu1990,
author = {C. Berge and P. Duchet},
year = 1990,
title = {Recent problems and results about kernels in directed graphs},
journal = {Discrete Math.},
volume = 86,
pages = {27-31},
note = {appeared first under the same title in {\it Applications of
Discrete Mathematics} (Clemson, SC, 1986), 200--204, SIAM, Philadelphia,
PA, 1988},
}
@article{BeLa1976,
author = {C. Berge and M. {Las Vergnas}},
year = 1976,
title = {Un nouveau jeu positionnel, le ``Match-It", ou une construction dialectique des couplages parfaits},
journal = {Cahiers du Centre \'Etudes Rech. Op\'er.},
volume = 18,
pages = {83-89},
}
@article{BeSc1956,
author = {C. Berge and M. P. Sch\"{u}tzenberger},
year = 1956,
title = {Jeux de Nim et solutions},
journal = {Acad. Sci. Paris},
volume = 242,
pages = {1672-1674},
note = {(French)}
}
@inproceedings{Ber1972,
author = {E. R. Berlekamp},
year = 1972,
title = {Some recent results on the combinatorial game called Welter's Nim},
booktitle = {Proc. 6th Ann. Princeton Conf. Information Science and
Systems},
pages = {203-204},
}
@article{Ber1974,
author = {E. R. Berlekamp},
year = 1974,
title = {The Hackenbush number system for compression of numerical data},
journal = {Inform. and Control},
volume = 26,
pages = {134-140},
}
@article{Ber1988a,
author = {E. R. Berlekamp},
year = 1988,
title = {Blockbusting and domineering},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 49,
pages = {67-116},
note = {an earlier version, entitled Introduction to blockbusting and
domineering, appeared in: {\it The Lighter Side of Mathematics}, Proc. E.
Strens Memorial Conf. on Recr. Math. and its History, Calgary, 1986,
Spectrum Series (R. K. Guy and R. E. Woodrow, eds.), Math.
Assoc. of America, Washington, DC, 1994, pp. 137--148},
}
@incollection{Ber1990,
author = {E. Berlekamp},
year = 1990,
title = {Two-person, perfect-information games},
pages = {275-287},
publisher = {Amer. Math. Soc., Providence, RI},
volume = 50,
booktitle = {The Le\-ga\-cy of John von Neumann \emph{(Hempstead NY,
1988)}, Proc. Sympos. Pure Math.},
}
@incollection{Ber1991,
author = {E. R. Berlekamp},
year = 1991,
title = {Introductory overview of mathematical Go end\-games},
pages = {73-100},
editor = {R. K. Guy},
publisher = {Amer. Math. Soc., Providence, RI},
volume = 43,
booktitle = {Combinatorial Games, \emph{Proc. Symp. Appl. Math.}},
}
@incollection{Ber1996a,
author = {E. R. Berlekamp},
year = 1996,
title = {The economist's view of combinatorial games},
pages = {365-405},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}
@incollection{Ber2000a,
author = {E. R. Berlekamp},
year = 2000,
title = {Sums of {$N \times 2$} Amazons},
volume = {35},
pages = {1-34},
editor = {{F.T. Bruss} and {L.M. Le Cam}},
publisher = {Beechwood, Ohio: Institute of Mathematical Statistics},
booktitle = {Institute of Mathematical Statistics Lecture Notes--Monograph
Series},
note = {Papers in honor of Thomas S. Ferguson},
mrnumber = {MR1833848 (2002e:91033)},
}
@book{Ber2000b,
author = {E. R. Berlekamp},
year = 2000,
title = {The Dots-and-Boxes Game: Sophisticated Child's Play},
volume = {},
publisher = {A K Peters, Natick, MA},
mrnumber = {MR1780088 (2001i:00005)},
}
@article{Ber2002,
author = {E. R. Berlekamp},
year = 2002,
title = {Four games for Gardner},
journal = {{\rm in:} Puzzler's Tribute: a Feast for the Mind{\rm ,}},
chapter = {},
pages = {383-386},
note = {honoring Martin Gardner (D. Wolfe and T. Rodgers, eds.),
A K Peters, Natick, MA},
publisher = {},
}
@incollection{Ber2002b,
author = {E. R. Berlekamp},
year = 2002,
title = {Idempotents among partisan games},
pages = {3-23},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
}
@incollection{Ber2002a,
author = {E. R. Berlekamp},
year = 2002,
title = {The 4G4G4G4G4 problems and solutions},
pages = {231-241},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
}
@incollection{Ber2008,
author = {E. R. Berlekamp},
year = 2008,
title = {Yellow brown Hackenbush},
pages = {},
editor = {M. H. Albert and R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {},
booktitle = {Games of No Chance III, \emph{Proc. BIRS Workshop on
Combinatorial Games, July, 2005, Banff, Alberta, Canada, MSRI Publ.}},
}
@book{BCG2001,
author = {E. R. Berlekamp and J. H. Conway and R. K. Guy},
year = {2001-2004},
title = {Winning Ways for your Mathematical Plays},
volume = {1-4},
publisher = {A K Peters, Wellesley, MA},
note = {2nd edition: vol. 1 (2001), vols. 2, 3 (2003), vol. 4 (2004);
translation of 1st edition (1982) into German: {\it Gewinnen, Strategien f\"ur
Mathematische Spiele} by G. Seiffert, Foreword by K. Jacobs, M.
Rem\'enyi and Seiffert, Friedr. Vieweg \& Sohn, Braunschweig (four
volumes), 1985},
}
@incollection{BeKi1996,
author = {E. R. Berlekamp and Y. Kim},
year = 1996,
title = {Where is the ``Thousand-Dollar Ko?''},
pages = {203-226},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}
@book{BeRo1999,
editor = {E. Berlekamp and T. Rodgers},
year = 1999,
title = {The Mathemagician and Pied Puzzler},
publisher = {A K Peters, Natick, MA},
note = {A collection in tribute to Martin Gardner. Papers from
the Gathering for Gardner Meeting (G4G1) held in Atlanta, GA, January 1993},
}
@incollection{BeSc2002,
author = {E. Berlekamp and K. Scott},
year = 2002,
title = {Forcing your opponent to stay in control of a loony
dots-and-boxes endgame},
pages = {317-330},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1973020},
}
@book{BeWo1994,
author = {E. Berlekamp and D. Wolfe},
year = 1994,
title = {Mathematical Go --- Chilling Gets the Last Point},
publisher = {A K Peters, Natick, MA},
}
@book{Ber1976a,
author = {P. Berloquin},
year = 1976,
title = {100 Jeux de Table},
publisher = {Flammarion, Paris},
}
@book{Ber1995,
author = {P. Berloquin},
year = 1995,
title = {100 Games of Logic},
publisher = {Barnes \& Noble},
}
@book{Ber1999,
author = {{P. Berloquin and D. Dugas (Illustrator)}},
year = 1999,
title = {100 Perceptual Puzzles},
publisher = {Barnes \& Noble},
}
@incollection{BDDFJM2002,
author = {T. C. Biedl and E. D. Demaine and M. L. Demaine and R. Fleischer
and L. Jacobsen and I. Munro},
year = 2002,
title = {The complexity of Clickomania},
pages = {389-404},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1973107 (2004b:91041)},
}
@article{Big1999,
author = {N. L. Biggs},
year = 1999,
title = {Chip-firing and the critical group of a graph},
journal = {J. Algebr. Comb.},
volume = 9,
pages = {25-45},
}
@book{Bin1992,
author = {K. Binmore},
year = 1992,
title = {Fun and Games: a Text on Game Theory},
publisher = {D.C. Heath, Lexington},
}
@article{BiGo1992,
author = {J. Bitar and E. Goles},
year = 1992,
title = {Parallel chip firing games on graphs},
journal = {Theoret. Comput. Sci.},
volume = 92,
pages = {291-300},
}
@article{BjLo1992,
author = {A. Bj\"orner and L. Lov\'asz},
year = 1992,
title = {Chip-firing games on directed graphs},
journal = {J. Algebraic Combin.},
volume = 1,
pages = {305-328},
}
@article{BLC1991,
author = {A. Bj\"orner and L. Lov\'asz and P. Chor},
year = 1991,
title = {Chip-firing games on graphs},
journal = {European J. Combin.},
volume = 12,
pages = {283-291},
}
@incollection {MR2279166,
AUTHOR = {Bj{\"o}rnsson, Yngvi and Hayward, Ryan and Johanson, Michael
and van Rijswijck, Jack},
TITLE = {Dead cell analysis in {H}ex and the {S}hannon game},
BOOKTITLE = {Graph theory in Paris},
SERIES = {Trends Math.},
PAGES = {45--59},
PUBLISHER = {Birkh\"auser},
ADDRESS = {Basel},
YEAR = {2007},
MRCLASS = {91A46 (05C99)},
MRNUMBER = {MR2279166 (2007j:91023)},
MRREVIEWER = {Kimmo Eriksson},
}
@article{BlKi2001,
author = {N. M. Blachman and D. M. Kilgour},
year = 2001,
title = {Elusive optimality in the box problem},
journal = {Math. Mag.},
volume = 74,
number = 3,
pages = {171-181},
mrnumber = {MR2104911},
}
@book{BlGi1954,
author = {D. Blackwell and M. A. Girshick},
year = 1954,
title = {Theory of Games and Statistical Decisions},
publisher = {Wiley, New York, NY},
}
@article{BDG2006,
author = {L. Blanc and E. Duch\^{e}ne and S. Gravier},
year = 2006,
title = {A deletion game on graphs: ๔le pic ar\^{e}te๖},
journal = {Integers, Electr. J. of Combinat. Number Theory},
volume = 6,
pages = {\#G02, 10 pp., Comb. Games Sect.},
url = {http://www.integers-ejcnt.org/vol5.html},
MRNUMBER = {MR2215359},
}
@article {BlFr1990,
AUTHOR = {Blass, Uri and Fraenkel, Aviezri S.},
TITLE = {The {S}prague-{G}rundy function for {W}ythoff's game},
JOURNAL = {Theoret. Comput. Sci.},
FJOURNAL = {Theoretical Computer Science},
VOLUME = {75},
YEAR = {1990},
NUMBER = {3},
PAGES = {311--333},
ISSN = {0304-3975},
CODEN = {TCSDI},
MRCLASS = {90D43},
MRNUMBER = {MR1080539 (92a:90101)},
MRREVIEWER = {Jos Potters},
}
@article{BFG1998,
author = {U. Blass and A. S. Fraenkel and R. Guelman},
title = {How far can Nim in disguise be stretched?},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 84,
pages = {145-156},
year = 1998,
mrnumber = {MR1652900 (2000d:91029)},
}
@article{Bli1986,
author = {M. Blidia},
year = 1986,
title = {A parity digraph has a kernel},
journal = {Combinatorica},
volume = 6,
pages = {23-27},
}
@article{BDJMM1999,
author = {M. Blidia and P. Duchet and H. Jacob and F. Maffray and
H.. Meyniel},
year = 1999,
title = {Some operations preserving the existence of kernels},
journal = {Discrete Math.},
volume = 205,
pages = {211-216},
}
@article{BDM1993,
author = {M. Blidia and P. Duchet and F. Maffray},
year = 1993,
title = {On kernels in perfect graphs},
journal = {Combinatorica},
volume = 13,
pages = {231-233},
}
@article{BoHa1998,
author = {J-P. Bode and H. Harborth},
year = 1998,
title = {Achievement games on Platonic solids},
journal = {Bull. Inst. Combin. Appl.},
volume = 23,
pages = {23-32},
mrnumber = {MR1621748 (99d:05020)},
}
@article{BoHa2000a,
author = {J-P. Bode and H. Harborth},
year = 2000,
title = {Hexagonal polyomino achievement},
journal = {Discrete Math.},
volume = 212,
pages = {5-18},
mrnumber = {MR1748669 (2000k:05082)},
}
@article{BoHa2000b,
author = {J-P. Bode and H. Harborth},
year = 2000,
title = {Independent chess pieces on Euclidean boards},
journal = {J. Combin. Math. Combin. Comput.},
volume = 33,
pages = {209-223},
mrnumber = {MR1772763 (2001c:05105)},
}
@article{BoHa2000c,
author = {J-P. Bode and H. Harborth},
year = 2000,
title = {Triangular mosaic polyomino achievement},
journal = {Congr. Numer.},
volume = 144,
pages = {143-152},
note = {Proc. 31st Southeastern Internat. Conf. on Combinatorics,
Graph Theory and Computing (Boca Raton, FL, 2000)},
mrnumber = {MR1817929 (2001m:05082)},
}
@article{BoHa2001,
author = {J-P. Bode and H. Harborth},
year = 2001,
title = {Triangle polyomino set achievement},
journal = {Congr. Numer.},
volume = 148,
pages = {97--101},
note = {Proc.32nd Southeastern Internat. Conf. on Combinatorics,
Graph Theory and Computing (Boca Raton, FL, 2002)},
mrnumber = {MR1887377 (2002k:05057)},
}
@article{BoHa2002,
author = {J-P. Bode and H. Harborth},
year = 2002,
title = {Triangle and hexagon gameboard Ramsey numbers},
journal = {Congr. Numer.},
volume = 158,
pages = {93-98},
note = {Proc.33rd Southeastern Internat. Conf. on Combinatorics,
Graph Theory and Computing (Boca Raton, FL, 2002)},
mrnumber = {MR1985149 (2004d:05129)},
}
@article{BoHa2003a,
author = {J-P. Bode and H. Harborth},
year = 2003,
title = {Independence for knights on hexagon and triangle boards},
journal = {Discrete Math.},
volume = 272,
pages = {27-35},
mrnumber = {MR2019197 (2004i:05115)},
}
@article{BHH2003b,
author = {J-P. Bode and H. Harborth and M. Harborth},
year = 2003,
title = {King independence on triangle boards},
journal = {Discrete Math.},
volume = 266,
pages = {101-107},
note = {Presented at 18th British Combinatorial Conference (Brighton, 2001)},
mrnumber = {MR1991709 (2004f:05129)},
}
@article{BoHa2004,
author = {J-P. Bode and H. Harborth and M. Harborth},
year = 2004,
title = {King graph Ramsey numbers},
journal = {J. Combin. Math. Combin. Comput.},
volume = 50,
pages = {47-55},
mrnumber = {MR2075855},
}
@article{BoHa1999,
author = {J-P. Bode and H. Harborth and H. Weiss},
year = 1999,
title = {Independent knights on hexagon boards},
journal = {Congr. Numer.},
volume = 141,
pages = {31-35},
note = {Proc. 30th Southeastern Internat. Conf. on Combinatorics,
Graph Theory, and Computing (Boca Raton, FL, 1999)},
mrnumber = {MR1745222 (2000k:05201)},
}
@article{BoHi1999,
author = {J-P. Bode and A. M. Hinz},
year = 1999,
title = {Results and open problems on the Tower of Hanoi},
journal = {Congr. Numer.},
volume = 139,
pages = {113-122},
note = {Proc.30th Southeastern Internat. Conf.
on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1999)},
}
@article{Bod1991,
author = {H. L. Bodlaender},
year = 1991,
title = {On the complexity of some coloring games},
journal = {Internat. J. Found. Comput. Sci.},
volume = 2,
pages = {133-147},
mrnumber = {MR1143920 (92j:68042)},
}
@article{Bod1993,
author = {H. L. Bodlaender},
year = 1993,
title = {Complexity of path forming games},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 110,
pages = {215-245},
}
@incollection{Bod1993a,
author = {H. L. Bodlaender},
year = 1993,
title = {Kayles on special classes of graphs---an application of
Sprague-Grundy theory},
pages = {90-102},
publisher = {Springer, Berlin},
volume = 657,
booktitle = {Graph-Theoretic Concepts in Computer Science
\emph{(Wiesbaden-Naurod, 1992)}, \emph{Lecture Notes in Comput. Sci.}},
mrnumber = {MR1244129 (94i:90189)},
}
@article{BoKr1992,
author = {H. L. Bodlaender and D. Kratsch},
year = 1992,
title = {The complexity of coloring games on perfect graphs},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 106,
pages = {309-326},
}
@article{BoKr2002,
author = {H. L. Bodlaender and D. Kratsch},
year = 2002,
title = {Kayles and nimbers},
journal = {J. Algorithms},
volume = 43,
pages = {106-119},
mrnumber = {MR1900711 (2003d:05201)},
}
@article{BHK2001,
author = {T. Bohman and R. Holzman and D. Kleitman},
year = 2001,
title = {Six Lonely Runners},
journal = {Electr. J. Combin.},
volume = {8(2)},
pages = {\#R3, 49 pp.},
url = {http://www.combinatorics.org/},
note = {Volume in honor of Aviezri S. Fraenkel},
mrnumber = {MR1853254 (2002g:11095)},
}
@article{Bok1984,
author = {K. D. Boklan},
year = 1984,
title = {The $n$-number game},
journal = {Fibonacci Quart.},
volume = 22,
pages = {152-155},
}
@article{BoLe2005,
author = {B. Bollob\'as and I. Leader},
year = 2005,
title = {The devil and the angel in three dimensions},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = {},
pages = {},
note = {to appear},
}
@article{BoSz1998,
author = {B. Bollob\'as and T. Szab\'o},
year = 1998,
title = {The oriented cycle game},
journal = {Discrete Math.},
volume = 186,
pages = {55-67},
}
@article{Boo1998,
author = {D. L. Book},
title = {What the Hex},
journal = {The Washington Post},
year = {1998, Sept. 9-th},
volume = {},
pages = {H02},
}
@article{Bor1921,
author = {E. Borel},
year = 1921,
title = {La th\'eorie du jeu et les \'equations integrales \`a
noyau symmetrique gauche},
journal = {C. R. Acad. Sci. Paris},
volume = 173,
pages = {1304-1308},
}
@article{BoGu1996,
author = {E. Boros and V. Gurvich},
year = 1996,
title = {Perfect graphs are kernel solvable},
journal = {Discrete Math.},
volume = 159,
pages = {35-55},
}
@article{BoGu1998,
author = {E. Boros and V. Gurvich},
year = 1998,
title = {A corrected version of the Duchet kernel conjecture},
journal = {Discrete Math.},
volume = 179,
pages = {231-233},
}
@article {BoGu2006,
AUTHOR = {Boros, E. and Gurvich, V.},
TITLE = {Perfect graphs, kernels, and cores of cooperative games},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {306},
YEAR = {2006},
NUMBER = {19-20},
PAGES = {2336--2354},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05C20 (91A12 91A43)},
MRNUMBER = {MR2261906 (2007g:05069)},
MRREVIEWER = {Hortensia Galeana-S{\'a}nchez},
}
@article {BSM2006,
AUTHOR = {Borowiecki, Mieczys{\l}aw and Jendrol', Stanislav and
Kr{\'a}l, Daniel and Mi{\v{s}}kuf, Jozef},
TITLE = {List coloring of {C}artesian products of graphs},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {306},
YEAR = {2006},
PAGES = {1955--1958},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05C15},
MRNUMBER = {MR2251575 (2007b:05067)},
}
@article {BS2007,
AUTHOR = {Borowiecki, Mieczys{\l}aw and Sidorowicz, El{\.z}bieta},
TITLE = {Generalised game colouring of graphs},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {307},
YEAR = {2007},
NUMBER = {11-12},
PAGES = {1225--1231},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05C15 (05C75)},
MRNUMBER = {MR2311092},
MRREVIEWER = {Ewa Drgas-Burchardt},
}
@article {MR2302533,
AUTHOR = {Borowiecki, M. and Sidorowicz, E. and Tuza, Zs.},
TITLE = {Game list colouring of graphs},
JOURNAL = {Electron. J. Combin.},
FJOURNAL = {Electronic Journal of Combinatorics},
VOLUME = {14},
YEAR = {2007},
NUMBER = {1},
PAGES = {\#R26, 11 pp.},
ISSN = {1077-8926},
MRCLASS = {05C15},
MRNUMBER = {MR2302533},
}
@article {MR2037334,
AUTHOR = {Boudreau, E. and Hartnell, B. and Schmeisser, K. and Whiteley,
J.},
TITLE = {A game based on vertex-magic total labelings},
JOURNAL = {Australas. J. Combin.},
FJOURNAL = {The Australasian Journal of Combinatorics},
VOLUME = {29},
YEAR = {2004},
PAGES = {67--73},
ISSN = {1034-4942},
MRCLASS = {91A43 (05C78 91A05)},
MRNUMBER = {MR2037334 (2004k:91059)},
}
@article{Bou1902,
author = {C. L. Bouton},
year = 1902,
title = {Nim, a game with a complete mathematical theory},
journal = {Ann. of Math.},
volume = 3,
number = 2,
pages = {35-39},
}
@article {MR2312431,
AUTHOR = {Bowditch, Brian H.},
TITLE = {The angel game in the plane},
JOURNAL = {Combin. Probab. Comput.},
FJOURNAL = {Combinatorics, Probability and Computing},
VOLUME = {16},
YEAR = {2007},
PAGES = {345--362},
ISSN = {0963-5483},
MRCLASS = {91A46 (05A99 05C25 91A05)},
MRNUMBER = {MR2312431 (2008a:91036)},
MRREVIEWER = {Kimmo Eriksson},
}
@incollection{Boy1981,
author = {J. Boyce},
year = 1981,
title = {A Kriegspiel endgame},
pages = {28-36},
editor = {D. A. Klarner},
publisher = {Wadsworth Internat., Belmont, CA},
booktitle = {The Mathematical Gardner},
}
@article{BrKi1995,
author = {S. J. Brams and D. M. Kilgour},
year = 1995,
title = {The box problem: to switch or not to switch},
journal = {Math. Mag.},
volume = 68,
number = 1,
pages = {27-34},
}
@book{Bra1981,
author = {G. Brandreth},
title = {The Bumper Book of Indoor Games},
publisher = {Victorama, Chancellor Press},
year = 1981,
}
@article{BUv2000,
author = {D. M. Breuker and J. W. H. M. Uiterwijk and H. J. van den Herik},
title = {Solving $8\times 8$ Domineering},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 230,
year = 2000,
pages = {195-206},
mrnumber = {MR1725637 (2001i:68148)},
}
@article{BrLo1995,
author = {D. M. Broline and D. E. Loeb},
title = {The combinatorics of Mancala-type games: Ayo, Tchoukaillon,
and $1/\pi$},
journal = {UMAP J.},
volume = 16,
number = 1,
year = 1995,
pages = {21-36},
}
@article{Bro1976,
author = {A. Brousseau},
year = 1976,
title = {Tower of Hanoi with more pegs},
journal = {J. Recr. Math.},
volume = 8,
pages = {169-176},
}
@article{BHMS2005,
author = {A. E. Brouwer and G. Horv\'{a}th and I.
Moln\'{a}r-S\'{a}ska and C. Szab\'{o}},
year = 2005,
title = {On three-rowed chomp},
journal = {Integers, Electr. J. of Combinat. Number Theory},
volume = 5,
pages = {\#G07, 11 pp., Comb. Games Sect.},
url = {http://www.integers-ejcnt.org/vol5.html},
mrnumber = {MR2192255 (2006g:11051)},
}
@book{Bro2000,
author = {C. Browne},
title = {HEX Strategy: Making the Right Connections},
publisher = {A K Peters, Natick, MA},
year = 2000,
}
@book{Bro2005,
author = {C. Browne},
title = {Connection Games: Variations on a Theme},
publisher = {A K Peters, Natick, MA},
year = 2005,
}
@article{DBLP:journals/cg/Browne06,
author = {Cameron Browne},
title = {Fractal board games.},
journal = {Computers {\&} Graphics},
volume = {30},
number = {1},
year = {2006},
pages = {126-133},
ee = {http://dx.doi.org/10.1016/j.cag.2005.10.016},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{BrPl1993,
author = {R. A. Brualdi and V. S. Pless},
year = 1993,
title = {Greedy codes},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 64,
pages = {10-30},
}
@article{BrDi1975,
author = {A. A. Bruen and R. Dixon},
year = 1975,
title = {The $n$-queen problem},
journal = {Discrete Math.},
volume = 12,
pages = {393-395},
}
@article{BrWe1970,
author = {J. Bruno and L. Weinberg},
year = 1970,
title = {A constructive graph-theoretic solution of the Shannon
switching game},
journal = {IEEE Trans. Circuit Theory},
volume = {CT-17},
pages = {74--81},
}
@incollection {BuVa1966,
AUTHOR = {Bucan, G. P. and Varvak, L. P.},
TITLE = {On the question of games on a graph},
BOOKTITLE = {Algebra and Math. Logic: Studies in Algebra (Russian)},
PAGES = {122--138},
PUBLISHER = {Izdat. Kiev. Univ., Kiev},
YEAR = {1966},
MRNUMBER = {MR0207584 (34 \#7399)},
}
@article {MR2242834,
AUTHOR = {Bukh, Boris},
TITLE = {Maximum pebbling number of graphs of diameter three},
JOURNAL = {J. Graph Theory},
FJOURNAL = {Journal of Graph Theory},
VOLUME = {52},
YEAR = {2006},
PAGES = {353--357},
ISSN = {0364-9024},
CODEN = {JGTHDO},
MRCLASS = {05C35},
MRNUMBER = {MR2242834 (2007i:05090)},
MRREVIEWER = {Sergiy Butenko},
}
@article{BuLe1980,
author = {P. Buneman and L. Levy},
year = 1980,
title = {The towers of Hanoi problem},
journal = {Inform. Process. Lett.},
volume = 10,
pages = {243-244},
}
@article{BCM1997,
author = {A. P. Burger and E. J. Cockayne and C. M. Mynhardt},
year = 1997,
title = {Domination and irredundance in the queen's graph},
journal = {Discrete Math.},
volume = 163,
pages = {47-66},
mrnumber = {MR1428557 (97m:05130)},
}
@article{BM1999,
author = {A. P. Burger and C. M. Mynhardt},
year = 1999,
title = {Queens on hexagonal boards},
journal = {J. Combin. Math. Combin. Comput.},
volume = 31,
pages = {97-111},
note = {paper in honour of Stephen T. Hedetniemi},
mrnumber = {MR1726950 (2000h:05158)},
}
@article{BM2000a,
author = {A. P. Burger and C. M. Mynhardt},
year = 2000,
title = {Properties of dominating sets of the queens graph $Q\sb {4k+3}$},
journal = {Util. Math.},
volume = 57,
pages = {237-253},
mrnumber = {MR1760187 (2000m:05166)},
}
@article{BM2000b,
author = {A. P. Burger and C. M. Mynhardt},
year = 2000,
title = {Small irredundance numbers for queens graphs},
journal = {J. Combin. Math. Combin. Comput.},
volume = 33,
pages = {33-43},
note = {paper in honour of Ernest J. Cockayne},
mrnumber = {MR1772752 (2001c:05106)},
}
@article{BM2000c,
author = {A. P. Burger and C. M. Mynhardt},
year = 2000,
title = {Symmetry and domination in queens graphs},
journal = {Bull. Inst. Combin. Appl.},
volume = 29,
pages = {11-24},
}
@article{BM2002,
author = {A. P. Burger and C. M. Mynhardt},
year = 2002,
title = {An upper bound for the minimum number of queens covering
the $n\times n$ chessboard},
journal = {Discrete Appl. Math.},
volume = 121,
pages = {51-60},
}
@article{BM2003,
author = {A. P. Burger and C. M. Mynhardt},
year = 2003,
title = {An improved upper bound for queens domination numbers},
journal = {Discrete Math.},
volume = 266,
pages = {119-131},
}
@article{BMC1994,
author = {A. P. Burger and C. M. Mynhardt and E. J. Cockayne},
year = 1994,
title = {Domination numbers for the queen's graph},
journal = {Bull. Inst. Combin. Appl.},
volume = 10,
pages = {73-82},
}
@article{BMC2001,
author = {A. P. Burger and C. M. Mynhardt and E. J. Cockayne},
year = 2001,
title = {Queens graphs for chessboards on the torus},
journal = {Australas. J. Combin.},
volume = 24,
pages = {231-246},
}
@inproceedings{Bur2001,
author = {M. Buro},
title = {Simple Amazon endgames and their connection to Hamilton
circuits in cubic subgrid graphs},
booktitle = {Proc.\ 2nd Intern.\ Conference on Computers and
Games CG'2000},
organization = {Hamamatsu, Japan, Oct.\ 2000, Lecture Notes in Computer
Science, Springer},
year = 2001,
volume= {2063},
editor = {T. Marsland and I. Frank},
pages = {251-261},
mrnumber = {MR1909614},
}
@misc{Bus1967,
author = {D. W. Bushaw},
year = 1967,
title = {On the name and history of Nim},
howpublished = {\emph{Washington Math.} {\bf 11}, Oct. 1966. Reprinted in:
{\it NY State Math. Teachers J.}, {\bf 17}, pp. 52--55},
}
@article{ByHe1996,
author = {P. J. Byrne and R. Hesse},
year = 1996,
title = {A Markov chain analysis of jai alai},
journal = {Math. Mag.},
volume = 69,
pages = {279-283},
}
@article{Byr2003,
author = {S. Byrnes},
year = 2003,
title = {Poset game periodicity},
journal = {Integers, Electr. J. of Combinat. Number Theory},
volume = 3,
pages = {\#G3, 16 pp., Comb. Games Sect.},
url = {http://www.integers-ejcnt.org/vol3.html},
mrnumber = {MR2036487 (2005c:91031)},
}
@article{CCL1992,
author = {J.-Y. Cai and A. Condon and R. J. Lipton},
year = 1992,
title = {On games of incomplete information},
journal = {Theoret. Comput. Sci.},
volume = 103,
pages = {25-38},
}
@article{CaZh2001,
author = {L. Cai and X. Zhu},
year = 2001,
title = {Game chromatic index of $k$-degenerate graphs},
journal = {J. Graph Theory},
volume = 36,
pages = {144-155},
mrnumber = {MR1814531 (2002b:05058)},
}
@article {Cai2002,
AUTHOR = {Cairns, Grant},
TITLE = {Pillow chess},
JOURNAL = {Math. Mag.},
FJOURNAL = {Mathematics Magazine},
VOLUME = {75},
YEAR = {2002},
PAGES = {173--186},
ISSN = {0025-570X},
CODEN = {MAMGA8},
MRCLASS = {91A05 (05A99 91A43)},
MRNUMBER = {MR2075210 (2005b:91011)},
}
@incollection{Cal1996,
author = {D. Calistrate},
year = 1996,
title = {The reduced canonical form of a game},
pages = {409-416},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1427979 (97m:90122)},
}
@incollection{CPW2002,
author = {D. Calistrate and M. Paulhus and D. Wolfe},
year = 2002,
title = {On the lattice structure of finite games},
pages = {25-30},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1973001},
}
@article{Cam2004,
author = {G. Campbell},
year = 2004,
title = {On optimal play in the game of Hex},
journal = {Integers, Electr. J. of Combinat. Number Theory},
volume = 4,
url = {http://www.integers-ejcnt.org/vol4.html},
pages = {\#G2, 23 pp., Comb. Games Sect.},
mrnumber = {MR2056016 (2005c:91032)},
}
@article{CaHa1992,
author = {C. Cannings and J. Haigh},
year = 1992,
title = {Montreal solitaire},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 60,
pages = {50-66},
}
@article{CaSt2004,
author = {J. Carlson and D. Stolarski},
year = 2004,
title = {The correct solution to Berlekamp's switching game},
journal = {Discrete Math.},
volume = 287,
pages = {145-150},
mrnumber = {MR2094708 (2005d:05005)},
}
@article{Cha1989,
author = {T-H. Chan},
year = 1989,
title = {A statistical analysis of the towers of Hanoi problem},
journal = {Intern. J. Computer Math.},
volume = 28,
pages = {57-65},
}
@article {MR2404560,
AUTHOR = {Chan, Melody and Godbole, Anant P.},
TITLE = {Improved pebbling bounds},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {308},
YEAR = {2008},
PAGES = {2301--2306},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05C35},
MRNUMBER = {MR2404560},
}
@incollection{ChTs2002,
author = {A. Chan and A. Tsai},
year = 2002,
title = {$1\times n$ Konane: a summary of results},
pages = {331-339},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1973021},
}
@article{CKS1981,
author = {A. K. Chandra and D. C. Kozen and L. J. Stockmeyer},
year = 1981,
title = {Alternation},
journal = {J. Assoc. Comput. Mach.},
volume = 28,
pages = {114-133},
}
@inproceedings{ChSt1976,
author = {A. K. Chandra and L. J. Stockmeyer},
year = 1976,
title = {Alternation},
booktitle = {Proc. 17th Ann. Symp. Foundations of Computer Science
\emph{(Houston, TX, Oct. 1976)}},
organization = {IEEE Computer Soc., Long Beach, CA},
pages = {98-108},
}
@article {MR2262608,
AUTHOR = {Chang, Hungyung and Zhu, Xuding},
TITLE = {The {$d$}-relaxed game chromatic index of {$k$}-degenerated
graphs},
JOURNAL = {Australas. J. Combin.},
FJOURNAL = {The Australasian Journal of Combinatorics},
VOLUME = {36},
YEAR = {2006},
PAGES = {73--82},
ISSN = {1034-4942},
MRCLASS = {05C15 (91A46)},
MRNUMBER = {MR2262608},
MRREVIEWER = {Fengming Dong},
}
@article{CHSV1995,
author = {G. Chartrand and F. Harary and M. Schultz and D. W. VanderJagt},
year = 1995,
title = {Achievement and avoidance of a strong orientation of a graph},
journal = {Congr. Numer.},
volume = 108,
pages = {193-203},
}
@article{Cha1972,
author = {S. M. Chase},
year = 1972,
title = {An implemented graph algorithm for winning Shannon switching games},
journal = {Commun. Assoc. Comput. Mach.},
volume = 15,
pages = {253-256},
}
@article{CLP2000,
author = {M. Chastand and F. Laviolette and N. Polat},
year = 2000,
title = {On constructible graphs, infinite bridged graphs and weakly
cop-win graphs},
journal = {Discrete Math.},
volume = 224,
pages = {61-78},
mrnumber = {MR1781285 (2002g:05152)},
}
@article{CSS1997,
author = {G. Chen and R. H. Schelp and W. E. Shreve},
year = 1997,
title = {A new game chromatic number},
journal = {European J. Combin.},
volume = 18,
pages = {1-9},
}
@article{Che1997,
author = {V. Chepoi},
year = 1997,
title = {Bridged graphs are cop-win graphs: an algorithmic proof},
journal = {J. Combin. Theory \emph{(Ser.~B)}},
volume = 69,
pages = {97-100},
}
@article{Chl1986,
author = {B. S. Chlebus},
year = 1986,
title = {Domino-tiling games},
journal = {J. Comput. System Sci.},
volume = 32,
pages = {374-392},
}
@article {MR1951379,
AUTHOR = {Chou, Chun-Yen and Wang, Weifan and Zhu, Xuding},
TITLE = {Relaxed game chromatic number of graphs},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {262},
YEAR = {2003},
PAGES = {89--98},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05C15 (91A43)},
MRNUMBER = {MR1951379 (2003m:05062)},
}
@article{GNCG1997,
author = {J. D. Christensen and M. Tilford},
year = 1997,
title = {Unsolved Problems: David Gale's subset take-away game},
journal = {Amer. Math. Monthly},
volume = 104,
pages = {762-766},
note = {Unsolved Problems Section},
}
@article{Chu1989,
author = {F. R. K. Chung},
year = 1989,
title = {Pebbling in hypercubes},
journal = {SIAM J. Disc. Math.},
volume = 2,
pages = {467-472},
}
@article{CCG1988,
author = {F. R. K. Chung and J. E. Cohen and R. L. Graham},
year = 1988,
title = {Pursuit-evasion games on graphs},
journal = {J. Graph Theory},
volume = 12,
pages = {159-167},
}
@article{ChEl2002,
author = {F. Chung and R. B. Ellis},
year = 2002,
title = {A chip-firing game and Dirichlet eigenvalues},
journal = {Discrete Math.},
volume = 257,
pages = {341-355},
mrnumber = {MR1935732 (2003i:05087)},
}
@article{CGMO1995,
author = {F. Chung and R. Graham and J. Morrison and A. Odlyzko},
year = 1995,
title = {Pebbling a chessboard},
journal = {Amer. Math. Monthly},
volume = 102,
pages = {113-123},
}
@techreport{Chv1973,
author = {V. Chv\'atal},
year = 1973,
title = {On the computational complexity of finding a kernel},
type = {Report},
number = {No. CRM-300},
institution = {Centre de Recherches Math\'ematiques, Universit\'e de Montr\'eal},
}
@incollection{Chv1981,
author = {V. Chv\'atal},
year = 1981,
title = {Cheap, middling or dear},
pages = {44-50},
editor = {D. A. Klarner},
publisher = {Wadsworth Internat., Belmont, CA},
booktitle = {The Mathematical Gardner},
}
@article{Chv1983,
author = {V. Chv\'atal},
year = 1983,
title = {Mastermind},
journal = {Combinatorica},
volume = 3,
pages = {325-329},
}
@article{ChEr1978,
author = {V. Chv\'atal and P. Erd\H{o}s},
year = 1978,
title = {Biased positional games},
journal = {Ann. Discrete Math.},
volume = 2,
note = {Algorithmic Aspects of Combinatorics, (B. Alspach, P.
Hell and D. J. Miller, eds.), Qualicum Beach, BC, Canada, 1976, North-Holland},
pages = {221-229},
}
@incollection {CiDe2003,
AUTHOR = {Cicalese, Ferdinando and Deppe, Christian},
TITLE = {Quasi-perfect minimally adaptive {$q$}-ary search with
unreliable tests},
BOOKTITLE = {Algorithms and Computation},
SERIES = {Lecture Notes in Comput. Sci.},
VOLUME = {2906},
PAGES = {527--536},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {2003},
MRCLASS = {68R05 (91A05 94A15)},
MRNUMBER = {MR2088232 (2005d:68101)},
}
@incollection {CDM2004,
AUTHOR = {Cicalese, Ferdinando and Deppe, Christian and Mundici,
Daniele},
TITLE = {{$Q$}-ary {U}lam-{R}\'enyi game with weighted constrained
lies},
BOOKTITLE = {Computing and Combinatorics},
SERIES = {Lecture Notes in Comput. Sci.},
VOLUME = {3106},
PAGES = {82--91},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {2004},
MRCLASS = {68P10 (05A15 91A46 94A62)},
MRNUMBER = {MR2162023 (2006c:68037)},
}
@incollection {MR1729129,
AUTHOR = {Cicalese, Ferdinando and Mundici, Daniele},
TITLE = {Optimal binary search with two unreliable tests and minimum
adaptiveness},
BOOKTITLE = {Algorithms---ESA '99 (Prague)},
SERIES = {Lecture Notes in Comput. Sci.},
VOLUME = {1643},
PAGES = {257--266},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {1999},
MRCLASS = {68P10 (94B65)},
MRNUMBER = {MR1729129 (2000i:68035)},
}
@incollection {MR1793099,
AUTHOR = {Cicalese, Ferdinando and Mundici, Daniele and Vaccaro, Ugo},
TITLE = {Least adaptive optimal search with unreliable tests},
BOOKTITLE = {Algorithm Theory---SWAT 2000 (Bergen)},
SERIES = {Lecture Notes in Comput. Sci.},
VOLUME = {1851},
PAGES = {549--562},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {2000},
MRCLASS = {91A05 (94B65)},
MRNUMBER = {MR1793099 (2001k:91005)},
MRREVIEWER = {T. Aaron Gulliver},
}
@article{CMV2002,
author = {F. Cicalese and D. Mundici and U. Vaccaro},
year = 2002,
title = {Least adaptive optimal search with unreliable tests},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 270,
pages = {877-893},
mrnumber = {MR1871101 (2003g:94052)},
}
@article {CiVa2000a,
AUTHOR = {Cicalese, Ferdinando and Vaccaro, Ugo},
TITLE = {An improved heuristic for the ``{U}lam-{R}\'enyi game''},
JOURNAL = {Inform. Process. Lett.},
FJOURNAL = {Information Processing Letters},
VOLUME = {73},
YEAR = {2000},
PAGES = {119--124},
ISSN = {0020-0190},
CODEN = {IFPLAT},
MRCLASS = {91A40 (68P10 94B60)},
MRNUMBER = {MR1741817 (2000m:91026)},
}
@article {CiVa2000b,
AUTHOR = {Cicalese, Ferdinando and Vaccaro, Ugo},
TITLE = {Optimal strategies against a liar},
JOURNAL = {Theoret. Comput. Sci.},
FJOURNAL = {Theoretical Computer Science},
VOLUME = {230},
YEAR = {2000},
PAGES = {167--193},
ISSN = {0304-3975},
CODEN = {TCSDI},
MRCLASS = {91A46 (05A99 90B40)},
MRNUMBER = {MR1725636 (2001g:91040)},
MRREVIEWER = {O. A. Malafeyev},
}
@article {CiVa2003,
AUTHOR = {Cicalese, Ferdinando and Vaccaro, Ugo},
TITLE = {Binary search with delayed and missing answers},
JOURNAL = {Inform. Process. Lett.},
FJOURNAL = {Information Processing Letters},
VOLUME = {85},
YEAR = {2003},
PAGES = {239--247},
ISSN = {0020-0190},
CODEN = {IFPLAT},
MRCLASS = {68P10},
MRNUMBER = {MR1952901 (2003m:68031)},
}
@article{Cin2005,
author = {A. Cincotti},
year = 2005,
title = {Three-player partizan games},
journal = {Theoret. Comput. Sci.},
volume = 332,
pages = {367-389},
mrnumber = {MR2122510 (2005j:91018)},
}
@article{Cin2008,
author = {A. Cincotti},
year = 2008,
title = {The game of Cutblock},
journal = {Integers, Electr. J. of Combinat. Number Theory},
volume = 8,
pages = {\#G06, 12 pp., Comb. Games Sect.},
url = {http://www.integers-ejcnt.org/vol8.html},
mrnumber = {**MR pending},
}
@incollection{Cla1996,
author = {C. Clark},
year = 1996,
title = {On achieving channels in a bipolar game},
pages = {23-27},
publisher = {Amer. Math. Soc., Providence, RI},
volume = 34,
booktitle = {African Americans in Mathematics \emph{(Piscataway, NJ, 1996),
DIMACS Ser. Discrete Math. Theoret. Comput. Sci.}},
}
@article{Cla1986,
author = {D. S. Clark},
year = 1986,
title = {Fibonacci numbers as expected values in a game of chance},
journal = {Fibonacci Quart.},
volume = 24,
pages = {263-267},
}
@article{ClNo2000,
author = {N. E. Clarke and R. J. Nowakowski},
year = 2000,
title = {Cops, robber, and photo radar},
journal = {Ars Combin.},
volume = 56,
pages = {97-103},
mrnumber = {MR1768605 (2001e:91040)},
}
@article{ClNo2001,
author = {N. E. Clarke and R. J. Nowakowski},
year = 2001,
title = {Cops, robber and traps},
journal = {Util. Math.},
volume = 60,
pages = {91-98},
mrnumber = {MR1863432 (2002i:91014)},
}
@article{ClNo2005,
author = {N. E. Clarke and R. J. Nowakowski},
year = 2005,
title = {Tandem-win graphs},
journal = {Discrete Math.},
volume = 299,
pages = {56-64},
mrnumber = {MR2168695},
}
@article{CHH1997,
author = {T. A. Clarke and R. A. Hochberg and G. H. Hurlbert},
year = 1997,
title = {Pebbling in diameter two graphs and products of paths},
journal = {J. Graph Theory},
volume = 25,
pages = {119-128},
}
@article{Cla1884,
author = {{N. Claus (=E. Lucas)}},
year = 1884,
title = {La tour d'Hanoi, jeu de calcul},
journal = {Science et Nature},
volume = 1,
pages = {127-128},
}
@article{Cla2001,
author = {A. Clausing},
year = 2001,
title = {Das Trisentis Spiel (The Trisentis game)},
journal = {Math. Semesterberichte},
volume = 48,
pages = {49-66},
mrnumber = {MR1950212 (2003k:91045)},
}
@article{Coc1990,
author = {E. J. Cockayne},
year = 1990,
title = {Chessboard domination problems},
journal = {Discrete Math.},
volume = 86,
pages = {13-20},
}
@article{CoHe1986,
author = {E. J. Cockayne and S. T. Hedetniemi},
year = 1986,
title = {On the diagonal queens domination problem},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 42,
pages = {137-139},
}
@article{CoMy2001,
author = {E. J. Cockayne and C. M. Mynhardt},
year = 2001,
title = {Properties of queens graphs and the irredundance number
of $Q\sb 7$},
journal = {Australas. J. Combin.},
volume = 23,
pages = {285-299},
mrnumber = {MR1815019 (2002a:05189)},
}
@article{CoDa1969,
author = {A. J. Cole and A. J. T. Davie},
year = 1969,
title = {A game based on the Euclidean algorithm and a winning strategy for it},
journal = {Math. Gaz.},
volume = 53,
pages = {354-357},
}
@article{Col1978,
author = {D. B. Coleman},
year = 1978,
title = {Stretch: a geoboard game},
journal = {Math. Mag.},
volume = 51,
pages = {49-54},
}
@article{Col2005,
author = {D. Collins},
year = 2005,
title = {Variations on a theme of Euclid},
journal = {Integers, Electr. J. of Combinat. Number Theory},
volume = 5,
pages = {\#G3, 12 pp., Comb. Games Sect.},
url = {http://www.integers-ejcnt.org/vol5.html},
mrnumber = {MR2139166 (2005k:91080)},
}
@article {MR2382351,
AUTHOR = {Collins, David and Lengyel, Tam{\'a}s},
TITLE = {The game of 3-{E}uclid},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {308},
YEAR = {2008},
PAGES = {1130--1136},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {91A46 (91A06)},
MRNUMBER = {MR2382351},
}
@book{Con1989,
author = {A. Condon},
year = 1989,
title = {Computational Models of Games},
series = {ACM Distinguished Dissertation},
publisher = {MIT Press, Cambridge, MA},
}
@article{Con1991,
author = {A. Condon},
year = 1991,
title = {Space-bounded probabilistic game automata},
journal = {J. Assoc. Comput. Mach.},
volume = 38,
pages = {472-494},
}
@article{Con1992,
author = {A. Condon},
year = 1992,
title = {The complexity of Stochastic games},
journal = {Information and Computation},
volume = 96,
pages = {203-224},
}
@incollection{Con1993,
author = {A. Condon},
year = 1993,
title = {On algorithms for simple stochastic games},
pages = {51-71},
publisher = {Amer. Math. Soc., Providence, RI},
booktitle = {Advances in Computational Complexity Theory \emph{(New
Brunswick, NJ, 1990), DIMACS Ser. Discrete Math. Theoret. Comput. Sci.}},
volume = 13,
}
@inproceedings{CFLS1993,
author = {A. Condon and J. Feigenbaum and C. Lund and P. Shor},
year = 1993,
title = {Probabilistically checkable debate systems and approximation
algorithms for PSPACE-hard functions},
booktitle = {Proc. 25th Ann. ACM Symp. Theory of Computing, \emph{Assoc.
Comput. Mach., New York, NY}},
pages = {305-314},
}
@article{CoLa1988,
author = {A. Condon and R. E. Ladner},
year = 1988,
title = {Probabilistic game automata},
journal = {J. Comput. System Sci.},
volume = 36,
pages = {452-489},
note = {preliminary version in: Proc. Structure in complexity theory
(Berkeley, CA, 1986), Lecture Notes in Comput. Sci., Vol. 223, Springer,
Berlin, pp. 144--162},
}
@article {MR0109092,
AUTHOR = {Connell, Ian G.},
TITLE = {A generalization of {W}ythoff's game},
JOURNAL = {Canad. Math. Bull.},
FJOURNAL = {Canadian Mathematical Bulletin. Bulletin Canadien de
Math\'ematiques},
VOLUME = {2},
YEAR = {1959},
PAGES = {181--190},
ISSN = {0008-4395},
MRCLASS = {90.00},
MRNUMBER = {MR0109092 (21 \#7804)},
MRREVIEWER = {M. Dresher},
}
@article {MR0109093,
AUTHOR = {Connell, Ian G.},
TITLE = {Some properties of {B}eatty sequences {I}},
JOURNAL = {Canad. Math. Bull.},
FJOURNAL = {Canadian Mathematical Bulletin. Bulletin Canadien de
Math\'ematiques},
VOLUME = {2},
YEAR = {1959},
PAGES = {190--197},
ISSN = {0008-4395},
MRCLASS = {90.00 (10.00)},
MRNUMBER = {MR0109093 (21 \#7805)},
MRREVIEWER = {M. Dresher},
}
@techreport{Con1972,
author = {J. H. Conway},
year = 1972,
title = {All numbers great and small},
institution = {Univ. of Calgary Math. Dept.},
type = {Res. Paper},
number = {No. 149},
}
@article{Con1977,
author = {J. H. Conway},
year = 1977,
title = {All games bright and beautiful},
journal = {Amer. Math. Monthly},
volume = 84,
pages = {417-434},
}
Conway, J. H. $M\sb {13}$. Surveys in combinatorics, 1997 (London), 1--11, London Math. Soc. Lecture Note Ser., 241, Cambridge Univ. Press, Cambridge, 1997.
@article{Con1978,
author = {J. H. Conway},
year = 1978,
title = {A gamut of game theories},
journal = {Math. Mag.},
volume = 51,
pages = {5-12},
}
@article{Con1978a,
author = {J. H. Conway},
year = 1978,
title = {Loopy Games},
journal = {Ann. Discrete Math.},
volume = 3,
note = {Proc. Symp. Advances in Graph Theory, Cambridge Combinatorial
Conf. (B. Bollob\'as, ed.), Cambridge, May 1977},
pages = {55-74},
}
@article{Con1990,
author = {J. H. Conway},
year = 1990,
title = {Integral lexicographic codes},
journal = {Discrete Math.},
volume = 83,
pages = {219-235},
}
@incollection{Con1991a,
author = {J. H. Conway},
year = 1991,
title = {More ways of combining games},
pages = {57-71},
editor = {R. K. Guy},
publisher = {Amer. Math. Soc., Providence, RI},
volume = 43,
booktitle = {Combinatorial Games, \emph{Proc. Symp. Appl. Math.}},
}
@incollection{Con1991b,
author = {J. H. Conway},
year = 1991,
title = {Numbers and games},
pages = {23-34},
editor = {R. K. Guy},
publisher = {Amer. Math. Soc., Providence, RI},
volume = 43,
booktitle = {Combinatorial Games, \emph{Proc. Symp. Appl. Math.}},
}
@incollection{Con1994,
author = {J. H. Conway},
year = 1994,
title = {The surreals and the reals. Real numbers, generalizations of
the reals, and theories of continua},
pages = {93-103},
editor = {},
publisher = {Kluwer Acad. Publ., Dordrecht},
volume = 242,
booktitle = {Synthese Lib.}
}
@incollection{Con1996,
author = {J. H. Conway},
year = 1996,
title = {The angel problem},
pages = {3-12},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}
@incollection{Con1997,
author = {J. H. Conway},
year = 1997,
title = {$M\sb {13}$},
pages = {1-11},
publisher = {London Math. Soc., Lecture Note Ser. 241, Cambridge Univ.
Press, Cambridge},
booktitle = {Surveys in combinatorics},
}
@book{Con2001,
author = {J. H. Conway},
year = 2001,
title = {On Numbers and Games},
publisher = {A K Peters, Natick, MA},
note = {2nd edition; translation of 1st edition (1976) into
German: {\it \"Uber Zahlen und Spiele} by Brigitte Kunisch, Friedr.
Vieweg \& Sohn, Braunschweig, 1983},
}
@incollection{Con2002,
author = {J. H. Conway},
year = 2002,
title = {More infinite games},
pages = {31-36},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1973002},
}
@incollection{Con2003,
author = {J. H. Conway},
year = 2003,
title = {Integral lexicographic codes},
pages = {185-189},
editor = {S. Katok and S. Tabachnikov},
publisher = {Amer. Math. Soc.},
volume = {},
booktitle = {MASS selecta},
mrnumber = {MR2027176},
}
@article{CoCo1973,
author = {J. H. Conway and H. S. M. Coxeter},
year = 1973,
title = {Triangulated polygons and frieze patterns},
journal = {Math. Gaz.},
volume = 57,
pages = {87-94; 175-183},
}
@article{CoSl1986,
author = {J. H. Conway and N. J. A. Sloane},
year = 1986,
title = {Lexicographic codes: error-cor\-rec\-ting codes from game theory},
journal = {IEEE Trans. Inform. Theory},
volume = {IT-32},
pages = {337-348},
}
@article{CoSh1979,
AUTHOR = {Cook, Michael L. and Shader, Leslie E.},
TITLE = {A strategy for the {R}amsey game ``{TRITIP}''},
BOOKTITLE = {Proceedings of the Tenth Southeastern Conference on
Combinatorics, Graph Theory and Computing (Florida Atlantic
Univ., Boca Raton, Fla., 1979)},
SERIES = {Congress. Numer., XXIII--XXIV},
journal = {Congr. Numer.},
volume = 23,
PAGES = {315--324, Utilitas Math.},
PUBLISHER = {Utilitas Math.},
ADDRESS = {Winnipeg, Man.},
YEAR = {1979},
note = {Proc. 10th Southeastern Conf. on Combinatorics,
Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1979)},
MRCLASS = {90D05 (05C55)},
MRNUMBER = {MR561058 (83e:90167)},
MRREVIEWER = {Richard K. Guy},
}
@article{Cop1993,
author = {M. Copper},
year = 1993,
title = {Graph theory and the game of sprouts},
journal = {Amer. Math. Monthly},
volume = 100,
pages = {478-482},
}
@book{CoPa1991,
author = {M. Cornelius and A. Parr},
year = 1991,
title = {What's Your Game?},
publisher = {Cambridge University Press, Cambridge},
}
@inproceedings{Cov1987,
author = {T. Cover},
title = {Pick the largest number},
booktitle = {Open Problems in Communication and Computation},
organization = {Springer-Verlag, New York},
year = 1987,
volume= {},
editor = {T. M. Cover and B. Gopinath},
pages = {152},
}
@article{Cox1953,
author = {H. S. M. Coxeter},
year = 1953,
title = {The golden section, phyllotaxis and Wythoff's game},
journal = {Scripta Math.},
volume = 19,
pages = {135-143},
}
@inproceedings{Cras2001,
author = {M. Cr\^{a}\c{s}maru},
year = 2001,
title = {On the complexity of Tsume-Go},
booktitle = {Proc. Intern. Conference on Computers and Games CG'1998,
Tsukuba, Japan, Nov.\ 1998},
editor = {H. J. van den Herik},
volume = {LNCS 1558},
pages = {222-231},
publisher = {Lecture Notes in Computer Science, Springer},
}
@inproceedings{CrTr2001,
author = {M. Cr\^{a}\c{s}maru and J. Tromp},
title = {Ladders are PSPACE-complete},
booktitle = {Proc.\ 2nd Intern.\ Conference on Computers and
Games CG'2000},
organization = {Hamamatsu, Japan, Oct.\ 2000, Lecture Notes in Computer
Science, Springer},
year = 2001,
volume= {2063},
editor = {T. Marsland and I. Frank},
pages = {241-249},
mrnumber = {MR1909613},
}
@article{Cre1987,
author = {J. W. Creely},
year = 1987,
title = {The length of a two-number game},
journal = {Fibonacci Quart.},
volume = 25,
pages = {174-179},
}
@article{Cre1988,
author = {J. W. Creely},
year = 1988,
title = {The length of a three-number game},
journal = {Fibonacci Quart.},
volume = 26,
pages = {141-143},
}
@article{Cro1964,
author = {H. T. Croft},
year = 1964,
title = {`Lion and man': a postscript},
journal = {J. London Math. Soc.},
volume = 39,
pages = {385-390},
}
@article{Cro1956,
author = {D. W. Crowe},
year = 1956,
title = {The $n$-dimensional cube and the tower of Hanoi},
journal = {Amer. Math. Monthly},
volume = 63,
pages = {29-30},
}
@article{CCFHPST2005,
author = {B. Crull and T. Cundiff and P. Feltman and G. H. Hurlbert
and L. Pudwell and Z. Szaniszlo and Z. Tuza},
year = 2005,
title = {The cover pebbling number of graphs},
journal = {Discrete Math.},
volume = 296,
pages = {15-23},
mrnumber = {MR2148478},
}
@article{Csi1980,
author = {L. Csirmaz},
year = 1980,
title = {On a combinatorial game with an application to Go-Moku},
journal = {Discrete Math.},
volume = 29,
pages = {19-23},
}
@article {MR1909151,
AUTHOR = {Csirmaz, L.},
TITLE = {Connected graph game},
JOURNAL = {Studia Sci. Math. Hungar.},
FJOURNAL = {Studia Scientiarum Mathematicarum Hungarica. A Quarterly of
the Hungarian Academy of Sciences},
VOLUME = {39},
YEAR = {2002},
PAGES = {129--136},
ISSN = {0081-6906},
CODEN = {SSMHAX},
MRCLASS = {91A43 (05C40)},
MRNUMBER = {MR1909151 (2003d:91028)},
MRREVIEWER = {Rong Si Chen},
}
@article{CsNa1979,
author = {L. Csirmaz and Zs. Nagy},
year = 1979,
title = {On a generalization of the game Go-Moku II},
journal = {Studia Sci. Math. Hung.},
volume = 14,
pages = {461-469},
}
@article{Cso2005,
author = {P. Csorba},
year = 2005,
title = {On the biased $n$-in-a-row game},
journal = {Discrete Math.},
volume = 503,
pages = {100-111},
}
@incollection{Cul1999,
author = {J. Culberson},
title = {Sokoban is PSPACE complete},
booktitle = {Fun With Algorithms},
series = {Proceedings in Informatics},
volume = 4,
publisher = {Carleton Scientific},
address = {University of Waterloo, Waterloo, Ont.},
year = 1999,
pages = {65-76},
note = {Conference took place on the island of Elba, June 1998}
}
@article{CuEc1982,
author = {P. Cull and Ecklund, Jr., E. F.},
year = 1982,
title = {On the towers of Hanoi and generalized towers of Hanoi problems},
journal = {Congr. Numer.},
volume = 35,
pages = {229-238},
}
@article{CuEc1985,
author = {P. Cull and Ecklund, Jr., E. F.},
year = 1985,
title = {Towers of Hanoi and analysis of algorithms},
journal = {Amer. Math. Monthly},
volume = 92,
pages = {407-420},
}
@article{CuGe1985,
author = {P. Cull and C. Gerety},
year = 1985,
title = {Is towers of Hanoi really hard?},
journal = {Congr. Numer.},
volume = 47,
pages = {237-242},
}
@article{CuNea1999,
author = {P. Cull and I. Nelson},
year = 1999,
title = {Error-correcting codes on the towers of Hanoi graphs},
journal = {Discrete Math.},
volume = {208/209},
pages = {157-175},
}
@article{CuNeb1999,
author = {P. Cull and I. Nelson},
year = 1999,
title = {Perfect codes, NP-completeness, and towers of Hanoi graphs},
journal = {Bull. Inst. Combin. Appl.},
volume = 26,
pages = {13-38},
}
@article{CEHK2002,
author = {A. Czygrinow and N. Eaton and G. Hurlbert and P. M. Kayll},
year = 2002,
title = {On pebbling threshold functions for graph sequences},
journal = {Discrete Math.},
volume = 247,
pages = {93-105},
mrnumber = {MR1877652 (2002m:05058)},
}
@article{CzHu2003,
author = {A. Czygrinow and G.Hurlbert},
year = 2003,
title = {Pebbling in dense graphs},
journal = {Australas. J. Combin.},
volume = 28,
pages = {201-208},
}
@article{CHKT2002,
author = {A. Czygrinow and G. Hurlbert and H. A. Kierstead and
W. T. Trotter},
year = 2002,
title = {A note on graph pebbling},
journal = {Graphs Combin.},
volume = 18,
pages = {219-225},
mrnumber = {MR1913664 (2004d:05170)},
}
@article {CLP1991,
AUTHOR = {Czyzowicz, Jurek and Lakshmanan, K. B. and Pelc, Andrzej},
TITLE = {Searching with a forbidden lie pattern in responses},
JOURNAL = {Inform. Process. Lett.},
FJOURNAL = {Information Processing Letters},
VOLUME = {37},
YEAR = {1991},
PAGES = {127--132},
ISSN = {0020-0190},
CODEN = {IFPLAT},
MRCLASS = {68P10 (68Q25 90D35)},
MRNUMBER = {MR1095694 (92e:68027)},
MRREVIEWER = {Peter B. Gibbons},
}
@article {CLP1994,
AUTHOR = {Czyzowicz, Jurek and Lakshmanan, K. B. and Pelc, Andrzej},
TITLE = {Searching with local constraints on error patterns},
JOURNAL = {European J. Combin.},
FJOURNAL = {European Journal of Combinatorics},
VOLUME = {15},
YEAR = {1994},
PAGES = {217--222},
ISSN = {0195-6698},
MRCLASS = {05A99},
MRNUMBER = {MR1273940 (95a:05005)},
MRREVIEWER = {J. Spencer},
}
@article {CMP1989,
AUTHOR = {Czyzowicz, Jurek and Mundici, Daniele and Pelc, Andrzej},
TITLE = {Ulam's searching game with lies},
JOURNAL = {J. Combin. Theory Ser. A},
FJOURNAL = {Journal of Combinatorial Theory. Series A},
VOLUME = {52},
YEAR = {1989},
PAGES = {62--76},
ISSN = {0097-3165},
CODEN = {JCBTA7},
MRCLASS = {94A99 (05A05 90D99)},
MRNUMBER = {MR1008160 (90k:94026)},
MRREVIEWER = {D. J. Kleitman},
}
@article {CMP1988,
AUTHOR = {Czyzowicz, Jurek and Pelc, Andrzej and Mundici, Daniele},
TITLE = {Solution of {U}lam's problem on binary search with two lies},
JOURNAL = {J. Combin. Theory Ser. A},
FJOURNAL = {Journal of Combinatorial Theory. Series A},
VOLUME = {49},
YEAR = {1988},
PAGES = {384--388},
ISSN = {0097-3165},
CODEN = {JCBTA7},
MRCLASS = {94A99 (05A99)},
MRNUMBER = {MR964397 (90k:94025)},
MRREVIEWER = {D. J. Kleitman},
}
@article{DaKl1977,
author = {G. Danaraj and V. Klee},
year = 1977,
title = {The connectedness game and the $c$-comp\-le\-xi\-ty of certain graphs},
journal = {SIAM J. Appl. Math.},
volume = 32,
pages = {431-442},
}
@inproceedings{DaLa1998,
author = {C. Darby and R. Laver},
title = {Countable length {R}amsey games},
booktitle = {Set Theory: Techniques and Applications. \emph{Proc.
of the conferences, Curacao, Netherlands Antilles, June 26--30,
1995 and Barcelona, Spain, June 10--14, 1996}},
year = 1998,
editor = {Carlos Augusto {Di Prisco} and others},
pages = {41-46},
publisher = {Kluwer, Dordrecht},
}
@article{Dav1970,
author = {A. L. Davies},
year = 1970,
title = {Rotating the fifteen puzzle},
journal = {Math. Gaz.},
volume = 54,
pages = {237-240},
}
@article{Dav1963,
author = {M. Davis},
year = 1963,
title = {Infinite games of perfect information},
journal = {Ann. of Math. Stud., Princeton},
volume = 52,
pages = {85-101},
}
@article{Daw1992,
author = {R. W. Dawes},
year = 1992,
title = {Some pursuit-evasion problems on grids},
journal = {Inform. Process. Lett.},
volume = 43,
pages = {241-247},
}
@article{Daw1934,
author = {T. R. Dawson},
year = 1934,
title = {Problem 1603},
journal = {Fairy Chess Review},
pages = {94},
note = dec,
}
@misc{Daw1935,
author = {T. R. Dawson},
year = 1935,
title = {Caissa's Wild Roses},
note = {reprinted in: {\it Five Classics of Fairy Chess}, Dover, 1973},
}
@article{Bru1972,
author = {N. G. de Bruijn},
year = 1972,
title = {A solitaire game and its relation to a finite field},
journal = {J. Recr. Math.},
volume = 5,
pages = {133-137},
}
@incollection{Bru1981,
author = {N. G. de Bruijn},
year = 1981,
title = {Pretzel Solitaire as a pastime for the lonely mathematician},
pages = {16-24},
editor = {D. A. Klarner},
publisher = {Wadsworth Internat., Belmont, CA},
booktitle = {The Mathematical Gardner},
}
@article{Car1970,
author = {F. de Carteblanche},
year = 1970,
title = {The princess and the roses},
journal = {J. Recr. Math.},
volume = 3,
pages = {238-239},
}
@article{Car1974,
author = {F. deCarte Blanche},
year = 1974,
title = {The roses and the princes},
journal = {J. Recr. Math.},
volume = 7,
pages = {295-298},
}
@article{DeL1971,
author = {A. P. DeLoach},
year = 1971,
title = {Some investigations into the game of SIM},
journal = {J. Recr. Math.},
volume = 4,
pages = {36-41},
}
@inproceedings{Dem2001,
author = {E. D. Demaine},
year = 2001,
title = {Playing games with algorithms: algorithmic combinatorial
game theory},
editor = {J. Sgall and A. Pultr and P. Kolman},
pages = {18-32},
publisher = {Springer, Berlin},
volume = {2136},
booktitle = {Mathematical Foundations of Computer Science},
series = {Lecture Notes in Comput. Sci.},
mrnumber = {MR1906998 (2003d:68076)},
}
@incollection{DDE2002,
author = {E. D. Demaine and M. L. Demaine and D. Eppstein},
year = 2002,
title = {Phutball Endgames are Hard},
pages = {351-360},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1973023 (2004b:91042)},
}
@article{DDF2004,
author = {E. D. Demaine and M. L. Demaine and R. Fleischer},
year = 2004,
title = {Solitaire clobber},
journal = {Theoret. Comp. Sci.},
volume = {313},
pages = {325-338},
note = {special issue of Dagstuhl Seminar ``Algorithmic Combinatorial
Game Theory'', Feb. 2002},
mrnumber = {MR2056930},
}
@incollection{DDFHv2008,
author = {E. D. Demaine and M. L. Demaine and R. Fleischer and
R. A. Hearn and T. von Oertzen},
year = 2008,
title = {The complexity of Dyson telescopes},
pages = {},
editor = {M. H. Albert and R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {},
booktitle = {Games of No Chance III, \emph{Proc. BIRS Workshop on
Combinatorial Games, July, 2005, Banff, Alberta, Canada, MSRI Publ.}},
}
@inproceedings{DDO2000,
author = {E.D. Demaine and M. L. Demaine and J. O'Rourke},
title = {PushPush and Push-1 are NP-hard in 2D},
booktitle = {Proc. 12th Annual Canadian Conf. on Computational Geometry},
year = 2000,
pages = {17-20},
publisher = {Fredericton, New Brunswick, Canada},
}
@incollection{DDV2002,
author = {E. D. Demaine and M. L. Demaine and H. A. Verrill},
year = 2002,
title = {Coin-moving puzzles},
pages = {405-431},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1973108 (2004b:91043)},
}
@article{DFFN2004,
author = {E. D. Demaine and R. Fleischer and A. S. Fraenkel and
R. J. Nowakowski},
year = 2004,
title = {Open problems at the 2002 Dagstuhl Seminar on algorithmic
combinatorial game theory},
journal = {Theoret. Comp. Sci.},
volume = {313},
pages = {539-543},
note = {special issue of Dagstuhl Seminar ``Algorithmic Combinatorial
Game Theory'' (Appendix B), Feb. 2002},
mrnumber = {MR2056945},
}
@inproceedings{DH2008,
author = {E. Demaine and R. A. Hearn},
year = 2008,
title = {Constraint Logic: A Uniform Framework for Modeling Computation
as Games},
booktitle = {Proc. 23rd Annual IEEE Conf. on Computational Complexity},
address = {Univ. of Maryland, College Park},
pages = {},
note = {to appear},
}
@incollection{DeHe2008,
author = {E. D. Demaine and R. A. Hearn},
year = 2008,
title = {Playing games with algorithms: algorithmic combinatorial
game theory},
pages = {},
editor = {M. H. Albert and R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {},
booktitle = {Games of No Chance III, \emph{Proc. BIRS Workshop on
Combinatorial Games, July, 2005, Banff, Alberta, Canada, MSRI Publ.}},
}
@inproceedings{DHH2002,
author = {E. D. Demaine and R. A. Hearn and M. Hoffmann},
year = 2002,
title = {Push-2-f is PSPACE-Complete},
booktitle = {Proc. 14th Canad. Conf. Computational Geometry},
pages = {31-35},
organization = {Lethbridge, Alberta, Canada},
}
@article{DeMa2007,
author = {J. DeMaio},
year = 2007,
title = {Which chessboards have a closed knight's tour within the cube?},
journal = {Electr. J. Combin.},
volume = {14},
pages = {\#R32, 9 pp.},
url = {http://www.combinatorics.org/},
}
@article{Par1884,
author = {H. de Parville},
year = 1884,
title = {La tour d'Hano\" {\i} et la question du Tonkin},
journal = {La Nature},
volume = 12,
pages = {285-286},
}
@article{Dep2000,
author = {C. Deppe},
year = 2000,
title = {Solution of Ulam's searching game with three lies or an
optimal adaptive strategy for binary three-error-correcting codes},
journal = {Discrete Math.},
volume = 224,
pages = {79-98},
mrnumber = {MR1781286 (2001j:94054)},
}
@article{Dep2004,
author = {C. Deppe},
year = 2004,
title = {Strategies for the Renyi-Ulam game with fixed number of lies},
journal = {Theoret. Comput. Sci.},
volume = 314,
pages = {45-55},
mrnumber = {MR2033744 (2004k:05012)},
}
@article{Des1953,
author = {B. Descartes},
year = 1953,
title = {Why are series musical?},
journal = {Eureka},
volume = 16,
pages = {18-20},
note = {reprinted {\it ibid.} {\bf 27} (1964) 29--31},
}
@inproceedings{DeTh1996,
author = {W. Deuber and S. Thomass\'e},
year = 1996,
title = {Grundy Sets of Partial Orders},
booktitle = {Technical Report No. 96-123},
number = {Diskrete Strukturen in der Mathematik},
pages = {},
address = {Universit\"at Bielefeld},
}
@misc{Dew1984,
author = {A. K. Dewdney},
year = {1984 -- 1991$\ $},
title = {Computer Recreations},
howpublished = {a column in Scientific American (May, 1984 -- September 1991)},
}
@book{Dew1988,
author = {A. K. Dewdney},
year = 1988,
title = {The Armchair Universe: An Exploration of Computer Worlds},
publisher = {W. H. Freeman and Company, New York},
}
@book{Dew1989,
author = {A. K. Dewdney},
year = 1989,
title = {The Turing Omnibus: 61 Excursions in Computer Science},
publisher = {Computer Science Press, Rockville, MD},
}
@book{Dew1993,
author = {A. K. Dewdney},
year = 1993,
title = {The $($new$)$ Turing Omnibus: 66 Excursions in Computer Science},
publisher = {Computer Science Press, New York},
}
@inproceedings{DGW1992,
author = {A. Dhagat and P. G\'{a}cs and P. Winkler},
title = {On playing "twenty questions" with a liar},
booktitle = {Proc.\ Third Annual ACM-SIAM Sympos.\ on
Discrete Algorithms},
year = 1992,
pages = {16-22},
publisher = {(Orlando, FL, 1992), ACM, New York},
}
@article{DiWa1981,
author = {C. S. Dibley and W. D. Wallis},
year = 1981,
title = {The effect of starting position in jai-alai},
journal = {Congr. Numer.},
volume = 32,
pages = {253-259},
note = {Proc. 12-th Southeastern Conf. on Combinatorics, Graph
Theory and Computing, Vol. I (Baton Rouge, LA, 1981)},
}
@misc{Did1995,
author = {C. G. Diderich},
year = 1995,
title = {Bibliography on minimax game theory, sequential and parallel
algorithms},
url = {http://diwww.epfl.ch/$\sim$diderich/bibliographies.html},
}
@article{DiLe1994,
author = {R. Diestel and I. Leader},
year = 1994,
title = {Domination games on infinite graphs},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 132,
pages = {337-345},
}
@article {DiZh1999,
AUTHOR = {Dinski, Thomas and Zhu, Xuding},
TITLE = {A bound for the game chromatic number of graphs},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {196},
YEAR = {1999},
NUMBER = {1-3},
PAGES = {109--115},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05C15},
MRNUMBER = {MR1664506 (99k:05077)},
MRREVIEWER = {O. V. Borodin},
}
@inproceedings{DoWi2001,
author = {Y. Dodis and P. Winkler},
title = {Universal configurations in light-flipping games},
booktitle = {Proc.\ 12th Annual ACM-SIAM Sympos.\ on
Discrete Algorithms },
year = 2001,
pages = {926-927},
publisher = {(Washington, DC, 2001), ACM, New York},
}
@article{Doe2001,
author = {B. Doerr},
year = 2001,
title = {Vector balancing games with aging},
journal = {J. Combin. Theory Ser. A},
volume = 95,
pages = {219-233},
mrnumber = {MR2154483},
}
@book{Dom1964,
author = {A. P. Domoryad},
year = 1964,
title = {Mathematical Games and Pastimes},
note = {translated by H. Moss},
publisher = {Pergamon Press, Oxford},
}
@article{DoZw1999,
author = {D. Dor and U. Zwick},
year = 1999,
title = {SOKOBAN and other motion planning problems},
pages = {215-228},
volume = 13,
journal = {Comput. Geom.},
}
@article{DDG2008,
author = {P. Dorbec and E. Duch\^ene and S. Gravier},
year = 2008,
title = {Solitaire clobber played on Hamming graphs},
journal = {Integers, Electr. J. of Combinat. Number Theory},
volume = 8,
pages = {\#G03, 21 pp., Comb. Games Sect.},
url = {http://www.integers-ejcnt.org/vol5.html},
mrnumber = {**MR pending},
}
@article{doSi2008,
author = {C. P. dos Santos and J. N. Silva},
year = 2008,
title = {Konane has infinite Nim-dimension},
journal = {Integers, Electr. J. of Combinat. Number Theory},
volume = 8,
pages = {\#G02, 6 pp., Comb. Games Sect.},
url = {http://www.integers-ejcnt.org/vol5.html},
mrnumber = {**MR pending},
}
@article{Dre1951,
author = {M. Dresher},
year = 1951,
title = {Games of strategy},
pages = {93-99},
volume = 25,
journal = {Math. Mag.},
}
@article{DFP1999,
author = {A. Dress and A. Flammenkamp and N. Pink},
year = 1999,
title = {Additive periodicity of the Sprague-Grundy function of certain
Nim games},
pages = {249-270},
volume = 22,
journal = {Adv. in Appl. Math.},
}
@article{Dru2005,
author = {G. C. Drummond-Cole},
year = 2005,
title = {Positions of value *2 in
generalized domineering and chess},
journal = {Integers, Electr. J. of Combinat. Number Theory},
volume = 5,
pages = {\#G6, 13 pp., Comb. Games Sect.},
url = {http://www.integers-ejcnt.org/vol5.html},
mrnumber = {MR2192254},
}
@article{DuGr2008,
author = {E. Duch\^ene and S. Gravier},
year = 2008,
title = {Geometrical extensions of Wythoff's game},
journal = {Discrete Math.},
volume = {},
pages = {},
note = {to appear},
}
@article {MR2401268,
AUTHOR = {Duch{\^e}ne, Eric and Rigo, Michel},
TITLE = {A morphic approach to combinatorial games: the {T}ribonacci
case},
JOURNAL = {Theor. Inform. Appl.},
FJOURNAL = {Theoretical Informatics and Applications. Informatique
Th\'eorique et Applications},
VOLUME = {42},
YEAR = {2008},
PAGES = {375--393},
ISSN = {0988-3754},
MRCLASS = {91A46 (68Q45 68R15)},
MRNUMBER = {MR2401268},
}
@article{Duc1980,
author = {P. Duchet},
year = 1980,
title = {Graphes noyau-parfaits},
pages = {93-101},
volume = 9,
journal = {Ann. Discrete Math.},
}
@article{Duc1987,
author = {P. Duchet},
year = 1987,
title = {A sufficient condition for a digraph to be kernel-perfect},
journal = {J. Graph Theory},
volume = 11,
pages = {81-85},
}
@article{Duc1987a,
author = {P. Duchet},
year = 1987,
title = {Parity graphs are kernel-M-solvable},
journal = {J. Combin. Theory \emph{(Ser.~B)}},
volume = 43,
pages = {121-126},
}
@article{DuMe1981,
author = {P. Duchet and H. Meyniel},
year = 1981,
title = {A note on kernel-critical graphs},
journal = {Discrete Math.},
volume = 33,
pages = {103-105},
}
@article{DuMe1983,
author = {P. Duchet and H. Meyniel},
year = 1983,
title = {Une g\'en\'eralisation du th\'eor\`eme de Ri\-chard\-son sur
l'existence de noyaux dans le graphes orient\'es},
journal = {Discrete Math.},
volume = 43,
pages = {21-27},
}
@article{DuMe1993,
author = {P. Duchet and H. Meyniel},
year = 1993,
title = {Kernels in directed graphs: a poison game},
journal = {Discrete Math.},
volume = 115,
pages = {273-276},
}
@book{Dud1958,
author = {H. E. Dudeney},
year = 1958,
title = {The Canterbury Puzzles and Other Curious Problems},
edition = {4th},
publisher = {Dover, Mineola, NY},
note = {1st edn: W. Heinemann, 1907},
}
@book{Dud1970,
author = {H. E. Dudeney},
year = 1970,
title = {Amusements in Mathematics},
publisher = {Dover, Mineola, NY},
note = {1st edn: Dover, 1917, reprinted by Dover in 1959},
}
@incollection{DKW2008,
author = {A. Duffy and G. Kolpin and D. Wolfe},
year = 2008,
title = {Ordinal partizan End Nim},
pages = {},
editor = {M. H. Albert and R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {},
booktitle = {Games of No Chance III, \emph{Proc. BIRS Workshop on
Combinatorial Games, July, 2005, Banff, Alberta, Canada, MSRI Publ.}},
}
@article{DuSp2004,
author = {I. Dumitriu and J. Spencer},
year = 2004,
title = {A halfliar's game},
journal = {Theoret. Comp. Sci.},
volume = {313},
pages = {353-369},
note = {special issue of Dagstuhl Seminar ``Algorithmic Combinatorial
Game Theory'', Feb. 2002},
mrnumber = {MR2056932},
}
@article {MR2176424,
AUTHOR = {Dumitriu, Ioana and Spencer, Joel},
TITLE = {The liar game over an arbitrary channel},
JOURNAL = {Combinatorica},
FJOURNAL = {Combinatorica. An International Journal on Combinatorics and
the Theory of Computing},
VOLUME = {25},
YEAR = {2005},
NUMBER = {5},
PAGES = {537--559},
ISSN = {0209-9683},
MRCLASS = {91A05 (05A99 68P30 91A46)},
MRNUMBER = {MR2176424 (2006m:91003)},
MRREVIEWER = {Robert B. Ellis},
}
@article {MR2206379,
AUTHOR = {Dumitriu, Ioana and Spencer, Joel},
TITLE = {The two-batch liar game over an arbitrary channel},
JOURNAL = {SIAM J. Discrete Math.},
FJOURNAL = {SIAM Journal on Discrete Mathematics},
VOLUME = {19},
YEAR = {2005},
NUMBER = {4},
PAGES = {1056--1064 (electronic)},
ISSN = {0895-4801},
MRCLASS = {91A46 (91A05 94B25)},
MRNUMBER = {MR2206379 (2006m:91037)},
MRREVIEWER = {Wensong Chu},
}
@article {MR2316815,
AUTHOR = {Dunn, Charles},
TITLE = {The relaxed game chromatic index of {$k$}-degenerate graphs},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {307},
YEAR = {2007},
NUMBER = {14},
PAGES = {1767--1775},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05C15 (91A46)},
MRNUMBER = {MR2316815 (2007m:05085)},
MRREVIEWER = {Xuding Zhu},
}
@article {DuKi2004a,
AUTHOR = {Dunn, Charles and Kierstead, H. A.},
TITLE = {A simple competitive graph coloring algorithm. {II}},
NOTE = {Dedicated to Adrian Bondy and U. S. R. Murty},
JOURNAL = {J. Combin. Theory Ser. B},
FJOURNAL = {Journal of Combinatorial Theory. Series B},
VOLUME = {90},
YEAR = {2004},
NUMBER = {1},
PAGES = {93--106},
ISSN = {0095-8956},
CODEN = {JCBTB8},
MRCLASS = {05C15},
MRNUMBER = {MR2041319 (2005h:05072)},
MRREVIEWER = {Sergiy Butenko},
}
@article {DuKi2004b,
AUTHOR = {Dunn, Charles and Kierstead, H. A.},
TITLE = {A simple competitive graph coloring algorithm. {III}},
JOURNAL = {J. Combin. Theory Ser. B},
FJOURNAL = {Journal of Combinatorial Theory. Series B},
VOLUME = {92},
YEAR = {2004},
NUMBER = {1},
PAGES = {137--150},
ISSN = {0095-8956},
CODEN = {JCBTB8},
MRCLASS = {05C15 (91A43)},
MRNUMBER = {MR2078498 (2007b:05069)},
MRREVIEWER = {Xuding Zhu},
}
@article {DuKi2004c,
AUTHOR = {Dunn, Charles and Kierstead, Hal A.},
TITLE = {The relaxed game chromatic number of outerplanar graphs},
JOURNAL = {J. Graph Theory},
FJOURNAL = {Journal of Graph Theory},
VOLUME = {46},
YEAR = {2004},
NUMBER = {1},
PAGES = {69--78},
ISSN = {0364-9024},
CODEN = {JGTHDO},
MRCLASS = {05C15},
MRNUMBER = {MR2051470 (2004m:05097)},
MRREVIEWER = {R. H. Schelp},
}
@article{DuFr1989,
author = {N. Duvdevani and A. S. Fraenkel},
year = 1989,
title = {Properties of $k$-Welter's game},
journal = {Discrete Math.},
volume = 76,
pages = {197-221},
}
@article{Edm1965,
author = {J. Edmonds},
year = 1965,
title = {Lehman's switching game and a theorem of Tutte and Nash--Williams},
journal = {J. Res. Nat. Bur. Standards},
volume = {69B},
pages = {73-77},
}
@article{EhSt1996,
author = {R. Ehrenborg and E. Steingr\'\i{}msson},
year = 1996,
title = {Playing Nim on a simplicial complex},
journal = {Electr. J. Combin.},
volume = 3,
number = {1},
pages = {\#R9, 33 pp.},
url = {http://www.combinatorics.org/},
}
@article{EhMy1979,
author = {A. Ehrenfeucht and J. Mycielski},
year = 1979,
title = {Positional strategies for mean payoff games},
journal = {Internat. J. Game Theory},
volume = 8,
pages = {109-113},
}
@incollection{Elk1996,
author = {N. D. Elkies},
year = 1996,
title = {On numbers and endgames: combinatorial game theory in chess
endgames},
pages = {135-150},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1427963},
}
@incollection{Elk2002,
author = {N. D. Elkies},
year = 2002,
title = {Higher nimbers in pawn endgames on large chessboards},
pages = {61-78},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1973005 (2004c:91029)},
}
@article {EPV2005,
AUTHOR = {Ellis, Robert B. and Ponomarenko, Vadim and Yan, Catherine H.},
TITLE = {The {R}\'enyi-{U}lam pathological liar game with a fixed
number of lies},
JOURNAL = {J. Combin. Theory Ser. A},
FJOURNAL = {Journal of Combinatorial Theory. Series A},
VOLUME = {112},
YEAR = {2005},
PAGES = {328--336},
ISSN = {0097-3165},
CODEN = {JCBTA7},
MRCLASS = {91A46 (05A99)},
MRNUMBER = {MR2177490 (2006g:91040)},
MRREVIEWER = {Kimmo Eriksson},
}
@article {ElYa2004,
AUTHOR = {Ellis, Robert B. and Yan, Catherine H.},
TITLE = {Ulam's pathological liar game with one half-lie},
JOURNAL = {Int. J. Math. Math. Sci.},
FJOURNAL = {International Journal of Mathematics and Mathematical
Sciences},
YEAR = {2004},
PAGES = {1523--1532},
ISSN = {0161-1712},
MRCLASS = {91A46 (05A99)},
MRNUMBER = {MR2085073 (2005c:91033)},
}
@article{ENO2007,
author = {J. W. Emert and R. B. Nelson and F. W. Owens},
year = 2007,
title = {Multiple towes of Hanoi with a path transition graph},
journal = {Congr. Numer.},
volume = 188,
pages = {59-64},
note = {Proc. 38-th Southeastern Intern. Conf. on Combinatorics,
Graph Theory and Computing (Boca Raton, Fl, 2007)},
}
@article{Eng1972,
author = {D. Engel},
title = {{DIM}: three-dimensional {S}im},
journal = {J. Recr. Math.},
year = 1972,
volume = 5,
pages = {274-275},
}
@article {MR2359600,
AUTHOR = {Engelhardt, Matthias R.},
TITLE = {A group-based search for solutions of the {$n$}-queens
problem},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {307},
YEAR = {2007},
PAGES = {2535--2551},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05C85 (05-04 05C69 91A46)},
MRNUMBER = {MR2359600 (2008g:05204)},
MRREVIEWER = {William D. Weakley},
}
@incollection {MR2301136,
AUTHOR = {Engels, Birgit and Kamphans, Tom},
TITLE = {Randolph's robot game is {NP}-hard!},
BOOKTITLE = {CTW2006---Cologne-Twente Workshop on Graphs and Combinatorial
Optimization},
SERIES = {Electron. Notes Discrete Math.},
VOLUME = {25},
PAGES = {49--53 (electronic)},
PUBLISHER = {Elsevier},
ADDRESS = {Amsterdam},
YEAR = {2006},
MRCLASS = {68Q17 (68T40)},
MRNUMBER = {MR2301136},
}
@article{EpFe1980,
author = {R. J. Epp and T. S. Ferguson},
year = 1980,
title = {A note on take-away games},
journal = {Fibonacci Quart.},
volume = 18,
pages = {300-303},
}
@incollection{Epp2002,
author = {D. Eppstein},
year = 2002,
title = {Searching for spaceships},
pages = {433-453},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
}
@book{Eps1977,
author = {R. A. Epstein},
year = 1977,
title = {Theory of Gambling and Statistial Logic},
publisher = {Academic Press, New York, NY},
}
@article{Er1982,
author = {M. C. Er},
year = 1982,
title = {A representation approach to the tower of Hanoi problem},
journal = {Comput. J.},
volume = 25,
pages = {442-447},
}
@article{Er1983,
author = {M. C. Er},
year = 1983,
title = {An analysis of the generalized towers of Hanoi problem},
journal = {BIT},
volume = 23,
pages = {429-435},
}
@article{Er1983a,
author = {M. C. Er},
year = 1983,
title = {An iterative solution to the generalized towers of Hanoi problem},
journal = {BIT},
volume = 23,
pages = {295-302},
}
@article{Er1984,
author = {M. C. Er},
year = 1984,
title = {A generalization of the cyclic towers of Hanoi},
journal = {Intern. J. Comput. Math.},
volume = 15,
pages = {129-140},
}
@article{Er1984a,
author = {M. C. Er},
year = 1984,
title = {The colour towers of Hanoi: a generalization},
journal = {Comput. J.},
volume = 27,
pages = {80-82},
}
@article{Er1984b,
author = {M. C. Er},
year = 1984,
title = {The cyclic towers of Hanoi: a representation approach},
journal = {Comput. J.},
volume = 27,
pages = {171-175},
}
@article{Er1984c,
author = {M. C. Er},
year = 1984,
title = {The generalized colour towers of Hanoi: an iterative algorithm},
journal = {Comput. J.},
volume = 27,
pages = {278-282},
}
@article{Er1984d,
author = {M. C. Er},
year = 1984,
title = {The generalized towers of Hanoi problem},
journal = {J. Inform. Optim. Sci.},
volume = 5,
pages = {89-94},
}
@article{Er1985,
author = {M. C. Er},
year = 1985,
title = {The complexity of the generalized cyclic towers of Hanoi problem},
journal = {J. Algorithms},
volume = 6,
pages = {351-358},
}
@article{Er1987a,
author = {M. C. Er},
year = 1987,
title = {A general algorithm for finding a shortest path between two
$n$-configurations},
journal = {Information Sciences},
volume = 42,
pages = {137-141},
}
@article{Er1987b,
author = {M. C. Er},
year = 1987,
title = {A time and space efficient algorithm for the cyclic Towers of Hanoi
problem},
journal = {J. Inform. Process.},
volume = 9,
pages = {163-165},
}
@article{Er1988,
author = {M. C. Er},
year = 1988,
title = {A minimal space algorithm for solving the towers of Hanoi problem},
journal = {J. Inform. Optim. Sci.},
volume = 9,
pages = {183-191},
}
@article{Er1989,
author = {M. C. Er},
year = 1989,
title = {A linear space algorithm for solving the Towers of Hanoi
problem by using a virtual disc.},
journal = {Inform. Sci.},
volume = 47,
pages = {47-52},
}
@inproceedings{EST1992,
author = {C. Erbas and S. Sarkeshik and M. M. Tanik},
year = 1992,
title = {Different perspectives of the $N$-queens problem},
booktitle = {Proc. ACM Computer Science Conf., \emph{Kansas City, MO}},
pages = {99-108},
}
@article{ErTa1994,
author = {C. Erbas and M. M. Tanik},
year = 1994,
title = {Parallel memory allocation and data alignment in SIMD machines},
journal = {Parallel Algorithms and Applications},
volume = 4,
pages = {139-151},
note = {preliminary version appeared under the title: Storage schemes
for parallel memory systems and the $N$-queens problem, in: Proc. 15th
Ann. Energy Tech. Conf., Houston, TX, Amer. Soc. Mech. Eng., Vol. 43,
1992, pp. 115--120},
}
@article{ETA1992,
author = {C. Erbas and M. M. Tanik and Z. Aliyazicioglu},
year = 1992,
title = {Linear conguence equations for the solutions of the $N$-queens problem},
journal = {Inform. Process. Lett.},
volume = 41,
pages = {301-306},
}
@article{EFHK2004,
author = {P. L. Erd\"{o}s and U. Faigle and W. Hochst\"{a}ttler and W. Kern},
year = 2004,
title = {Note on the game chromatic index of trees},
journal = {Theoret. Comp. Sci.},
volume = {313},
pages = {371-376},
note = {special issue of Dagstuhl Seminar ``Algorithmic Combinatorial
Game Theory'', Feb. 2002},
mrnumber = {MR2056933},
}
@article{EHHL1987,
author = {P. Erd\H{o}s and W. R. Hare and S. T. Hedetniemi and
R. C. Laskar},
year = 1987,
title = {On the equality of the Grundy and ochromatic
numbers of a graph},
journal = {J. Graph Theory},
volume = 11,
pages = {157-159},
}
@article{EHLP2003,
author = {P. Erd\H{o}s and S. T. Hedetniemi and R. C. Laskar and
G. C. E. Prins},
year = 2003,
title = {On the equality of the partial Grundy and upper ochromatic
numbers of graphs},
journal = {Discrete Math.},
volume = 272,
pages = {53-64},
mrnumber = {MR2019200 (2004i:05048)},
}
@article{ErSe1973,
author = {P. Erd\H{o}s and J. L. Selfridge},
year = 1973,
title = {On a combinatorial game},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 14,
pages = {298-301},
}
@incollection{Eri1996a,
author = {J. Erickson},
year = 1996,
title = {New toads and frogs results},
pages = {299-310},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}
@incollection{Eri1996b,
author = {J. Erickson},
year = 1996,
title = {Sowing games},
pages = {287-297},
editor = {R. J. Nowa\-kowski},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}
@article{ErHa1983,
author = {M. Erickson and F. Harary},
year = 1983,
title = {Picasso animal achievement games},
journal = {Bull. Malaysian Math. Soc.},
volume = 6,
pages = {37-44},
}
@article{EEE2000,
author = {N. Eriksen and H. Eriksson and K. Eriksson},
year = 2000,
title = {Diagonal checker-jumping and Eulerian numbers for color-signed
permutations},
journal = {Electr. J. Combin.},
volume = 7,
pages = {\#R3, 11 pp.},
url = {http://www.combinatorics.org/}
}
@article{Eri1995,
author = {H. Eriksson},
year = 1995,
title = {Pebblings},
journal = {Electr. J. Combin.},
volume = 2,
pages = {\#R7, 18 pp.},
url = {http://www.combinatorics.org/},
}
@article{EEKSW2001,
author = {H. Eriksson and K. Eriksson and J. Karlander and L. Svensson
and J. W\"{a}stlund},
year = 2001,
title = {Sorting a bridge hand},
journal = {Discrete Math.},
volume = 241,
pages = {289-300},
note = {Selected papers in honor of Helge Tverberg}
}
@article {EES2001,
AUTHOR = {Eriksson, Henrik and Eriksson, Kimmo and Sj{\"o}strand, Jonas},
TITLE = {Note on the lamp lighting problem},
NOTE = {Special issue in honor of Dominique Foata's 65th birthday
(Philadelphia, PA, 2000)},
JOURNAL = {Adv. in Appl. Math.},
FJOURNAL = {Advances in Applied Mathematics},
VOLUME = {27},
YEAR = {2001},
PAGES = {357--366},
ISSN = {0196-8858},
MRCLASS = {68Q80 (05C50)},
MRNUMBER = {MR1868970 (2002i:68082)},
MRREVIEWER = {Klaus Sutner},
}
@article{ErLi1995,
author = {H. Eriksson and B. Lindstr\"om},
year = 1995,
title = {Twin jumping checkers in $\IZ^d$},
journal = {European J. Combin.},
volume = 16,
pages = {153-157},
}
@article{Eri1991,
author = {K. Eriksson},
year = 1991,
title = {No polynomial bound for the chip firing game on directed graphs},
journal = {Proc. Amer. Math. Soc.},
volume = 112,
pages = {1203-1205},
}
@article{Eri1992,
author = {K. Eriksson},
year = 1992,
title = {Convergence of Mozes' game of numbers},
journal = {Linear Algebra Appl.},
volume = 166,
pages = {151-165},
}
@article{Eri1994a,
author = {K. Eriksson},
year = 1994,
title = {Node firing games on graphs},
journal = {Contemp. Math.},
volume = 178,
pages = {117-127},
}
@article{Eri1994b,
author = {K. Eriksson},
year = 1994,
title = {Reachability is decidable in the numbers game},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 131,
pages = {431-439},
}
@article{Eri1995a,
author = {K. Eriksson},
year = 1995,
title = {The numbers game and Coxeter groups},
journal = {Discrete Math.},
volume = 139,
pages = {155-166},
}
@article{Eri1996c,
author = {K. Eriksson},
year = 1996,
title = {Chip-firing games on mutating graphs},
journal = {SIAM J. Discrete Math.},
volume = 9,
pages = {118-128},
}
@article{Eri1996d,
author = {K. Eriksson},
year = 1996,
title = {Strong convergence and a game of numbers},
journal = {European J. Combin.},
volume = 17,
pages = {379-390},
}
@article{Eri1996e,
author = {K. Eriksson},
year = 1996,
title = {Strong convergence and the polygon property of 1-player games},
journal = {Discrete Math.},
volume = 153,
pages = {105-122},
note = {Proc. 5th Conf. on Formal Power Series and Algebraic
Combinatorics (Florence 1993)},
}
@article {MR1439041,
AUTHOR = {Ernst, Michael D.},
TITLE = {Playing {K}onane mathematically: a combinatorial
game-theoretic analysis},
JOURNAL = {UMAP J.},
FJOURNAL = {The UMAP Journal. The Journal of Undergraduate Mathematics and
its Applications},
VOLUME = {16},
YEAR = {1995},
NUMBER = {2},
PAGES = {95--121},
ISSN = {0197-3622},
MRCLASS = {90D46 (05A99)},
MRNUMBER = {MR1439041},
}
@article {Eti1991,
AUTHOR = {Etienne, Gwihen},
TITLE = {Tableaux de {Y}oung et solitaire bulgare},
JOURNAL = {J. Combin. Theory \rm({Ser. A})},
FJOURNAL = {Journal of Combinatorial Theory. \rm{Series A}},
VOLUME = {58},
YEAR = {1991},
PAGES = {181--197},
ISSN = {0097-3165},
CODEN = {JCBTA7},
MRCLASS = {05E99 (05E10)},
MRNUMBER = {MR1129115 (93a:05134)},
MRREVIEWER = {Andrea Brini},
}
@article{Ett,
author = {J. M. Ettinger},
year = 2000,
title = {A metric for positional games},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 230,
pages = {207-219},
mrnumber = {MR1725638 (2001g:91041)},
}
@article{Euw,
author = {M. Euwe},
year = 1929,
title = {Mengentheoretische Betrachtungen \"{u}ber das Schachspiel},
journal = {Proc. Konin. Akad. Wetenschappen},
volume = 32,
pages = {633-642},
}
@article{Eva1974,
author = {R. J. Evans},
year = 1974,
title = {A winning opening in reverse Hex},
journal = {J. Recr. Math.},
volume = 7,
pages = {189-192},
}
@article{Eva1975,
author = {R. J. Evans},
year = {1975--76},
title = {Some variants of Hex},
journal = {J. Recr. Math.},
volume = 8,
pages = {120-122},
}
@article{Eva1979,
author = {R. J. Evans},
year = 1979,
title = {Silverman's game on intervals},
journal = {Amer. Math. Monthly},
volume = 86,
pages = {277-281},
}
@article{EvHe1992,
author = {R. J. Evans and G. A. Heuer},
year = 1992,
title = {Silverman's game on discrete sets},
journal = {Linear Algebra Appl.},
volume = 166,
pages = {217-235},
}
@article{EvTa1976,
author = {S. Even and R. E. Tarjan},
year = 1976,
title = {A combinatorial problem which is complete in polynomial space},
journal = {J. Assoc. Comput. Mach.},
volume = 23,
pages = {710-719},
note = {also appeared in Proc. 7th Ann. ACM Symp. Theory of Computing
(Albuquerque, NM, 1975), Assoc. Comput. Mach., New York, NY, 1975, pp. 66--71},
}
@article{Exo1980,
author = {G. Exoo},
title = {A new way to play {R}amsey games},
journal = {J. Recr. Math.},
year = {1980-81},
volume = 13,
number = 2,
pages = {111-113},
}
@article{FKKT1993,
author = {U. Faigle and W. Kern and H. Kierstead and W. T. Trotter},
year = 1993,
title = {On the game chromatic number of some classes of graphs},
journal = {Ars Combin.},
volume = 35,
pages = {143-150},
}
@article{FKK1998,
author = {U. Faigle and W. Kern and J. Kuipers},
year = 1998,
title = {Computing the nucleolus of min-cost spanning tree games is NP-hard},
journal = {Internat. J. Game Theory},
volume = 27,
pages = {443-450},
}
@book{Fal1961,
author = {E. Falkener},
year = 1961,
title = {Games Ancient and Oriental and How to Play Them},
publisher = {Dover, New York, NY. (Published previously by Longmans Green, 1892.)},
}
@article{FaSc1986,
author = {B.-J. Falkowski and L. Schmitz},
year = 1986,
title = {A note on the queens' problem},
journal = {Inform. Process. Lett.},
volume = 23,
pages = {39-46},
}
@article{Far2003,
author = {G. E. Farr},
year = 2003,
title = {The Go polynomials of a graph},
journal = {Theoret. Comp. Sci.},
volume = 306,
pages = {1-18},
mrnumber = {MR2000162 (2004e:05074)},
}
@article{FGR2005,
author = {J. Farrell and M. Gardner and T. Rodgers},
year = 2005,
title = {Configuration games},
journal = {{\rm in:} Tribute to a Mathemagician{\rm ,}},
chapter = {},
note = {honoring Martin Gardner (B. Cipra, E. D. Demaine,
M. L. Demaine and T. Rodgers, eds.),
A K Peters, Wellesley, MA, pp. 93-99.},
publisher = {},
}
@article{Fed1990,
author = {T. Feder},
year = 1990,
title = {Toetjes},
journal = {Amer. Math. Monthly},
volume = 97,
pages = {785-794},
}
@article {MR2191279,
AUTHOR = {Feder, Tom{\'a}s and Subi, Carlos},
TITLE = {Disks on a tree: analysis of a combinatorial game},
JOURNAL = {SIAM J. Discrete Math.},
FJOURNAL = {SIAM Journal on Discrete Mathematics},
VOLUME = {19},
YEAR = {2005},
PAGES = {543--552 (electronic)},
ISSN = {0895-4801},
MRCLASS = {05A99 (82C20)},
MRNUMBER = {MR2191279 (2006i:05022)},
MRREVIEWER = {Deepak Dhar},
}
@article{FFFS2004,
author = {S. P. Fekete and R. Fleischer and A. S. Fraenkel and M. Schmitt},
year = 2004,
title = {Traveling salesmen in the presence of competition},
journal = {Theoret. Comp. Sci.},
volume = {313},
pages = {377-392},
note = {special issue of Dagstuhl Seminar ``Algorithmic Combinatorial
Game Theory'', Feb. 2002},
mrnumber = {MR2056934 (2005a:90168)},
}
@article{Fer1974,
author = {T. S. Ferguson},
year = 1974,
title = {On sums of graph games with last player losing},
journal = {Internat. J. Game Theory},
volume = 3,
pages = {159-167},
}
@article{Fer1984,
author = {T. S. Ferguson},
year = 1984,
title = {Mis\`ere annihilation games},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 37,
pages = {205-230},
}
@article{Fer1989,
author = {T. S. Ferguson},
year = 1989,
title = {Who solved the secretary problem?},
journal = {Statistical Science},
volume = 4,
pages = {282-296},
}
@article{Fer1992,
author = {T. S. Ferguson},
year = 1992,
title = {Mate with bishop and knight in kriegspiel},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 96,
pages = {389-403},
}
@article{Fer1998,
author = {T. S. Ferguson},
year = 1998,
title = {Some chip transfer games},
journal = {Theoret. Comp. Sci. \emph{(Math Games)}},
volume = 191,
pages = {157-171},
}
@article{Fer2001,
author = {T. S. Ferguson},
year = 2001,
title = {Another form of matrix Nim},
journal = {Electr. J. Combin.},
volume = {8(2)},
pages = {\#R9, 9 pp.},
url = {http://www.combinatorics.org/},
note = {Volume in honor of Aviezri S. Fraenkel},
mrnumber = {MR1853260 (2002g:91046)},
}
@article{FiHa1983,
author = {A. S. Finbow and B. L. Hartnell},
year = 1983,
title = {A game related to covering by stars},
journal = {Ars Combinatoria},
volume = {16-A},
pages = {189-198},
}
@article{FiGu2007,
author = {A. Fink and R. Guy},
year = 2007,
title = {The Number-pad Game},
journal = {Coll. Math. J.},
volume = {38},
pages = {260--264},
mrnumber = {MR2340919},
}
@inproceedings{FiWr1993,
author = {M. J. Fischer and R. N. Wright},
year = 1993,
title = {An application of game-theoretic techniques to cryptography},
pages = {99-118},
volume = 13,
booktitle = {Advances in Computational Complexity Theory \emph{(New
Brunswick, NJ, 1990), DIMACS Ser. Discrete Math. Theoret. Comput. Sci.}},
}
@article{FiSl1989,
author = {P. C. Fishburn and N. J. A. Sloane},
year = 1989,
title = {The solution to Berlekamp's switching game},
journal = {Discrete Math.},
volume = 74,
pages = {263-290},
}
@article{FiRy1992,
author = {D. C. Fisher and J. Ryan},
year = 1992,
title = {Optimal strategies for a generalized ``scissors, paper, and stone" game},
journal = {Amer. Math. Monthly},
volume = 99,
pages = {935-942},
}
@article{FiRy1995,
author = {D. C. Fisher and J. Ryan},
year = 1995,
title = {Probabilities within optimal strategies for tournament games},
journal = {Discrete Appl. Math.},
volume = 56,
pages = {87-91},
}
@article{FiRy1995a,
author = {D. C. Fisher and J. Ryan},
year = 1995,
title = {Tournament games and positive tournaments},
journal = {J. Graph Theory},
volume = 19,
pages = {217-236},
}
@article{FiNo2001,
author = {S. L. Fitzpatrick and R. J. Nowakowski},
year = 2001,
title = {Copnumber of graphs with strong isometric dimension two},
journal = {Ars Combin.},
volume = 59,
pages = {65-73},
mrnumber = {MR1832198 (2002b:05053)},
}
@article{FlBa2002,
author = {G. W. Flake and E. B. Baum},
year = 2002,
title = {{\it Rush Hour\/} is PSPACE-complete, or "Why you should
generously tip parking lot attendants"},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 270,
pages = {895-911},
mrnumber = {MR1871102 (2002h:68068)},
}
@phdthesis{Fla1996,
author = {A. Flammenkamp},
year = 1996,
title = {Lange Perioden in Subtraktions-Spielen},
school= {University of Bielefeld},
}
@article{FHR2003,
author = {A. Flammenkamp and A. Holshouser and H. Reiter},
year = 2003,
title = {Dynamic one-pile blocking Nim},
journal = {Electr. J. Combinatorics},
volume = 10,
pages = {\#N4, 6 pp.},
url = {http://www.combinatorics.org/},
mrnumber = {MR1975777 (2004b:05027)},
}
@article{Fla1978,
author = {J. A. Flanigan},
year = 1978,
title = {Generalized two-pile Fibonacci nim},
journal = {Fibonacci Quart.},
volume = 16,
pages = {459-469},
}
@article{Fla1981,
author = {J. A. Flanigan},
year = 1981,
title = {On the distribution of winning moves in random game trees},
journal = {Bull. Austr. Math. Soc.},
volume = 24,
pages = {227-237},
}
@article{Fla1981a,
author = {J. A. Flanigan},
year = 1981,
title = {Selective sums of loopy partizan graph games},
journal = {Internat. J. Game Theory},
volume = 10,
pages = {1-10},
}
@article{Fla1982,
author = {J. A. Flanigan},
year = 1982,
title = {A complete analysis of black-white Hackendot},
journal = {Internat. J. Game Theory},
volume = 11,
pages = {21-25},
}
@article{Fla1982a,
author = {J. A. Flanigan},
year = 1982,
title = {One-pile time and size dependent take-away games},
journal = {Fibonacci Quart.},
volume = 20,
pages = {51-59},
}
@article{Fla1983,
author = {J. A. Flanigan},
year = 1983,
title = {Slow joins of loopy games},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 34,
pages = {46-59},
}
@inproceedings{FlTr2006,
author = {R. Fleischer and G. Trippen},
title = {Kayles on the way to the stars},
booktitle = {Proc.\ 4th Intern.\ Conference on Computers and
Games CG'2004},
organization = {Bar-Ilan University, Ramat-Gan, Israel, July 2004, Lecture Notes in Computer
Science Vol. 3846, Springer},
year = 2006,
volume= {},
editor = {H. J. van den Herik and Y. Bj\"ornsson and N. S. Netanyahu},
pages = {232-245},
}
@article{Fly1973,
author = {J. O. Flynn},
year = 1973,
title = {Lion and man: the boundary constraint},
journal = {SIAM J. Control},
volume = 11,
pages = {397-411},
}
@article{Fly1974a,
author = {J. O. Flynn},
year = 1974,
title = {Lion and man: the general case},
journal = {SIAM J. Control},
volume = 12,
pages = {581-597},
}
@article{Fly1974b,
author = {J. O. Flynn},
year = 1974,
title = {Some results on max-min pursuit},
journal = {SIAM J. Control},
volume = 12,
pages = {53-69},
}
@article{Fom1998,
author = {F. V. Fomin},
year = 1998,
title = {Helicopter search problems, bandwidth and pathwidth},
journal = {Discrete Appl. Math.},
volume = 85,
pages = {59-70},
}
@article{Fom1999,
author = {F. V. Fomin},
year = 1999,
title = {Note on a helicopter search problem on graphs},
journal = {Discrete Appl. Math.},
volume = 95,
pages = {241-249},
note = {Proc. Conf. on Optimal Discrete Structures and Algorithms ---
ODSA '97 (Rostock)}
}
@article{FoPe1996,
author = {F. V. Fomin and N. N. Petrov},
year = 1996,
title = {Pursuit-evasion and search problems on graphs},
journal = {Congr. Numer.},
volume = 122,
pages = {47-58},
note = {Proc. 27-th Southeastern Intern. Conf. on Combinatorics,
Graph Theory and Computing (Baton Rouge, LA, 1996)}
}
@article{FoJo1984,
author = {L. R. Foulds and D. G. Johnson},
year = 1984,
title = {An application of graph theory and integer programming:
chessboard non-attacking puzzles},
journal = {Math. Mag.},
volume = 57,
pages = {95-104},
}
@incollection{Fra1974,
author = {A. S. Fraenkel},
year = 1974,
title = {Combinatorial games with an annihilation rule},
pages = {87-91},
editor = {J. P. LaSalle},
publisher = {Amer. Math. Soc., Providence, RI},
volume = 20,
booktitle = {The Influence of Computing on Mathematical Research and
Education, {\rm Missoula MT, August 1973}, \emph{Proc. Symp. Appl. Math.,}},
}
@article{Fra1977,
author = {A. S. Fraenkel},
year = 1977,
title = {The particles and antiparticles game},
journal = {Comput. Math. Appl.},
volume = 3,
pages = {327-328},
}
@article{Fra1980,
author = {A. S. Fraenkel},
year = 1980,
title = {From Nim to Go},
journal = {Ann. Discrete Math.},
volume = 6,
note = {Proc. Symp. on Combinatorial Mathematics, Combinatorial
Designs and Their Applications (J. Srivastava, ed.), Colorado State
Univ., Fort Collins, CO, June 1978},
pages = {137-156},
}
@article{Fra1981,
author = {A. S. Fraenkel},
year = 1981,
title = {Planar kernel and Grundy with $d\leq 3$, $d_{out}\leq 2$,
$d_{in}\leq 2$ are NP-complete},
journal = {Discrete Appl. Math.},
volume = 3,
pages = {257-262},
}
@article{Fra1982,
author = {A. S. Fraenkel},
year = 1982,
title = {How to beat your Wythoff games' opponent on three fronts},
journal = {Amer. Math. Monthly},
volume = 89,
pages = {353-361},
}
@article{Fra1983,
author = {A. S. Fraenkel},
year = 1983,
title = {15 Research problems on games},
journal = {Discrete Math.},
note = {in "Research Problems" section, Vols. {\bf 43-46}},
}
@article{Fra1984,
author = {A. S. Fraenkel},
year = 1984,
title = {Wythoff games, continued fractions, cedar trees and Fibonacci searches},
journal = {Theoret. Comput. Sci.},
volume = 29,
pages = {49-73},
note = {an earlier version appeared in Proc. 10th Internat. Colloq.
on Automata, Languages and Programming (J. Diaz, ed.), Vol. 154,
Barcelona, July 1983, Lecture Notes in Computer Science,
Springer Verlag, Berlin, 1983, pp. 203--225},
}
@article{Fra1988,
author = {A. S. Fraenkel},
year = 1988,
title = {The complexity of chess, Letter to the Editor},
journal = {J. Recr. Math.},
volume = 20,
pages = {13-14},
}
@incollection{Fra1991,
author = {A. S. Fraenkel},
year = 1991,
title = {Complexity of games},
pages = {111-153},
editor = {R. K. Guy},
publisher = {Amer. Math. Soc., Providence, RI},
volume = 43,
booktitle = {Combinatorial Games, \emph{Proc. Symp. Appl. Math.}},
}
@article{Fra1994,
author = {A. S. Fraenkel},
year = 1994,
title = {Even kernels},
journal = {Electr. J. Combinatorics},
volume = 1,
pages = {\#R5, 13 pp.},
url = {http://www.combinatorics.org/},
}
@article {MR1138949,
AUTHOR = {Fraenkel, Aviezri S.},
TITLE = {Iterated floor function, algebraic numbers, discrete chaos,
{B}eatty subsequences, semigroups},
JOURNAL = {Trans. Amer. Math. Soc.},
FJOURNAL = {Transactions of the American Mathematical Society},
VOLUME = {341},
YEAR = {1994},
PAGES = {639--664},
ISSN = {0002-9947},
CODEN = {TAMTAM},
MRCLASS = {11B83 (11B39 11Z50 58F13)},
MRNUMBER = {MR1138949 (94d:11011)},
MRREVIEWER = {{\v{S}}tefan Porubsk{\'y}},
}
@incollection{Fra1994a,
author = {A. S. Fraenkel},
year = 1994,
title = {Recreation and depth in combinatorial games},
pages = {176-194},
editor = {R. K. Guy and R. E. Woodrow},
publisher = {Math. Assoc. of America, Washington, DC},
booktitle = {The Lighter Side of Mathematics, \emph{Proc. E. Strens
Memorial Conf. on Recr. Math. and its History, Calgary, 1986, Spectrum
Series}},
}
@incollection{Fra1996,
author = {A. S. Fraenkel},
year = 1996,
title = {Error-correcting codes derived from combinatorial games},
pages = {417-431},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}
@incollection{Fra1996a,
author = {A. S. Fraenkel},
year = 1996,
title = {Scenic trails ascending from sea-level Nim to alpine chess},
pages = {13-42},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}
@article{Fra1997,
author = {A. S. Fraenkel},
year = 1997,
title = {Combinatorial game theory foundations applied to digraph kernels},
journal = {Electr. J. Combinatorics},
volume = 4,
number = {2},
pages = {\#R10, 17 pp.},
note = {Volume in honor of Herbert Wilf},
url = {http://www.combinatorics.org/},
}
@article{Fra1998a,
author = {A. S. Fraenkel},
year = 1998,
title = {Heap games, numeration systems and sequences},
journal = {Ann. Comb.},
volume = 2,
pages = {197-210},
note = {an earlier version appeared in: {\em Fun With
Algorithms\/}, Vol.~4 of {\it Proceedings in Informatics\/} (E. Lodi,
L. Pagli and N. Santoro, eds.), Carleton Scientific, University of
Waterloo, Waterloo, Ont., pp. 99--113, 1999. Conference took place on the
island of Elba, June 1998.},
mrnumber = {MR1681514 (2000b:91001)},
}
@article{Fra1998b,
author = {A. S. Fraenkel},
year = 1998,
title = {Multivision: an intractable impartial game with a linear winning strategy},
journal = {Amer. Math. Monthly},
volume = 105,
pages = {923-928},
}
@article{Fra2000,
author = {A. S. Fraenkel},
year = 2000,
title = {Recent results and questions in combinatorial game complexities},
journal = {Theoret. Comput. Sci.},
volume = 249,
pages = {265-288},
note = {Conference version in: Proc. AWOCA98 --- Ninth Australasian
Workshop on Combinatorial Algorithms, C.S. Iliopoulos, ed., Perth,
Western Australia, 27--30 July, 1998, special AWOCA98 issue, pp. 124-146},
mrnumber = {MR1798313 (2001j:91033)},
}
@inproceedings{Fra2001,
author = {A. S. Fraenkel},
year = 2001,
title = {Virus versus mankind},
booktitle = {Proc.\ 2nd Intern.\ Conference on Computers and
Games CG'2000},
organization = {Hamamatsu, Japan, Oct.\ 2000, Lecture Notes in Computer
Science, Springer},
volume= {2063},
pages = {204--213},
editor = {T. Marsland and I. Frank},
}
@article{Fra2002a,
author = {A. S. Fraenkel},
year = 2002,
title = {Arrays, numeration systems and Frankenstein games},
journal = {Theoret. Comput. Sci.},
volume = 282,
pages = {271-284},
note = {special`` Fun With Algorithms" issue},
mrnumber = {MR1909052 (2003h:91036)},
}
@article{Fra2002b,
author = {A. S. Fraenkel},
year = 2002,
title = {Mathematical chats between two physicists},
journal = {{\rm in:} Puzzler's Tribute: a Feast for the Mind{\rm ,}},
chapter = {},
note = {honoring Martin Gardner (D. Wolfe and T. Rodgers, eds.),
A K Peters, Natick, MA, pp. 383-386},
publisher = {},
}
@incollection{Fra2002c,
author = {A. S. Fraenkel},
year = 2002,
title = {Two-player games on cellular automata},
pages = {279-306},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1973018 (2004b:91004)},
}
@article{Fra2004a,
author = {A. S. Fraenkel},
year = 2004,
title = {Complexity, appeal and challenges of combinatorial games},
journal = {Theoret. Comp. Sci.},
volume = {313},
pages = {393-415},
note = {Expanded version of a keynote address at Dagstuhl Seminar
``Algorithmic Combinatorial Game Theory'', Feb. 2002, special
issue on Algorithmic Combinatorial Game Theory},
mrnumber = {MR2056935},
}
@article{Fra2004b,
author = {A. S. Fraenkel},
year = 2004,
title = {New games related to old and new sequences},
journal = {Integers, Electr. J of Combinat. Number Theory},
volume = {4},
pages = {\#G6, 18 pp., Comb. Games Sect.},
url = {http://www.integers-ejcnt.org/vol4.html},
note = {1st version
in Proc.10-th Advances in Computer Games (ACG-10 Conf.),
H. J. van den Herik, H. Iida and E. A. Heinz eds., Graz, Austria,
Nov.\ 2003, Kluwer, pp. 367-382},
mrnumber = {MR2042724},
}
@article{Fra2005,
author = {A. S. Fraenkel},
year = 2005,
title = {Euclid and Wythoff games},
journal = {Discrete Math.},
volume = {304},
pages = {65-68},
mrnumber = {MR2184445 (2006f:91006)},
}
@article{Fra2006,
author = {A. S. Fraenkel},
year = 2006,
title = {Nim is easy, chess is hard --- but why??},
journal = {J. Internat. Computer Games Assoc.},
volume = {29},
number = {4},
pages = {203-206},
note = {earlier version appeared in Plus Mag. {\rm
(}electronic{\rm )}, pluschat section,\hfill\break
http://plus.maths.org/issue40/editorial/index.html},
}
@inbook{Fra2007a,
author = {A. S. Fraenkel},
year = 2007,
title = {The Raleigh game, {\rm in: Combinatorial Number Theory}},
publisher = {de Gruyter},
pages = {199-208},
note = {Proc.\ Integers Conference, Carrollton, Georgia, October 27-30,2005,
in celebration of the 70th birthday of Ronald Graham. B.\ Landman,
M.\ Nathanson, J.\ Ne\v{s}et\v{r}il, R.\ Nowakowski, C. Pomerance eds.,
also appeared in {\it Integers, Electr.\ J.\ of Combinat.\ Number Theory\/}
{\bf 7(2)}, special volume in honor of Ron Graham, \#A13, 11 pp.},
url = {http://www.integers-ejcnt.org/vol7(2).html},
MRNUMBER = {MR2337047 (2008e:91021)},
}
@article{Fra2007b,
author = {A. S. Fraenkel},
year = 2007,
title = {Why are games exciting and stimulating?},
journal = {Math Horizons},
volume = {},
pages = {5-7; 32-33},
note = {special issue: ``Games, Gambling, and Magic" February. German
translation by Niek Neuwahl, poster-displayed at traveling exhibition
``Games \& Science, Science \& Games'', opened in G\"{o}ttingen
July 17 -- Aug 21, 2005},
}
@article{Fra2008a,
author = {A. S. Fraenkel},
year = 2008,
title = {Games played by Boole and Galois},
journal = {Discrete Appl. Math.},
volume = {156},
pages = {420-427},
mrnumber = {**MR pending},
}
@inbook{Fra2009,
author = {A. S. Fraenkel},
year = 2009,
title = {The cyclic Butler University game, {\rm in: Mathematical
Wizardry for a Gardner, Volume honoring Martin Gardner}},
pages = {},
publisher = {A K Peters, Natick, MA},
note = {E. Pegg Jr, A. H. Schoen, and T. Rodgers, eds., to appear},
}
@article{FrBo1973,
author = {A. S. Fraenkel and I. Borosh},
year = 1973,
title = {A generalization of Wythoff's game},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 15,
pages = {175-191},
}
@inproceedings{FGJSY1978,
author = {A. S. Fraenkel and M. R. Garey and D. S. Johnson and T.
Schaefer and Y. Yesha},
year = 1978,
title = {The complexity of checkers on an $n\times n$
board --- preliminary report},
booktitle = {Proc. 19th Ann. Symp. Foundations of Computer Science
\emph{(Ann Arbor, MI, Oct. 1978)}},
organization = {IEEE Computer Soc., Long Beach, CA},
pages = {55-64},
}
@article{FrGo1987,
author = {A. S. Fraenkel and E. Goldschmidt},
year = 1987,
title = {Pspace-hardness of some combinatorial games},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 46,
pages = {21-38},
}
@article{FrHa1989,
author = {A. S. Fraenkel and F. Harary},
year = 1989,
title = {Geodetic contraction games on graphs},
journal = {Internat. J. Game Theory},
volume = 18,
pages = {327-338},
}
@article{FrHe1980,
author = {A. S. Fraenkel and H. Herda},
year = 1980,
title = {Never rush to be first in playing Nimbi},
journal = {Math. Mag.},
volume = 53,
pages = {21-26},
}
@article{FJKS1995,
author = {A. S. Fraenkel and A. Jaffray and A. Kotzig and G. Sabidussi},
year = 1995,
title = {Modular Nim},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 143,
pages = {319-333},
}
@article {FrKi1994,
AUTHOR = {Fraenkel, A. S. and Kimberling, Clark},
TITLE = {Generalized {W}ythoff arrays, shuffles and interspersions},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {126},
YEAR = {1994},
PAGES = {137--149},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {11B83 (05A99)},
MRNUMBER = {MR1264482 (95c:11028)},
MRREVIEWER = {Volker Strehl},
}
@inbook{FrKo2007,
author = {A. S. Fraenkel and A. Kontorovich},
year = 2007,
title = {The Sierpi\'{n}ski sieve of Nim-varieties and binomial
coefficients, {\rm in: Combinatorial Number Theory}},
publisher = {de Gruyter},
pages = {209-227},
note = {Proc.\ Integers Conference, Carrollton, Georgia, October 27-30,2005,
in celebration of the 70th birthday of Ronald Graham. B.\ Landman,
M.\ Nathanson, J.\ Ne\v{s}et\v{r}il, R.\ Nowakowski, C. Pomerance eds.,
appeared also in {\it Integers, Electr.\ J.\ of Combinat.\ Number Theory\/} {\bf 7(2)},
special volume in honor of Ron Graham, \*A14, 19 pp.},
url = {http://www.integers-ejcnt.org/vol7(2).html},
MRNUMBER = {MR2337048},
}
@article{FrKo1987,
author = {A. S. Fraenkel and A. Kotzig},
year = 1987,
title = {Partizan octal games: partizan subtraction games},
journal = {Internat. J. Game Theory},
volume = 16,
pages = {145-154},
}
@article{FrKr2004,
author = {A. S. Fraenkel and D. Krieger},
year = 2004,
title = {The structure of complementary sets of integers: a 3-shift
theorem},
journal = {Internat. J. Pure and Appl. Math.},
volume = {10},
pages = {1-49},
mrnumber = {MR2020683 (2004h:05012)},
}
@article{FrLi1981,
author = {A. S. Fraenkel and D. Lichtenstein},
year = 1981,
title = {Computing a perfect strategy for $n\times n$ chess requires
time exponential in $n$},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 31,
pages = {199-214},
MRNUMBER = {MR629595 (83b:68044)},
note = {preliminary version in Proc. 8th Internat. Colloq. Automata,
Languages and Programming (S. Even and O. Kariv, eds.), Vol. 115, Acre,
Israel, 1981, Lecture Notes in Computer Science, Springer
Verlag, Berlin, pp. 278--293},
}
@article{FLN1988,
author = {A. S. Fraenkel and M. Loebl and J. Ne\v{s}et\v{r}il},
year = 1988,
title = {Epidemiography II.~Games with a dozing yet winning player},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 49,
pages = {129-144},
}
@article{FrLo1989,
author = {A. S. Fraenkel and M. Lorberbom},
year = 1989,
title = {Epidemiography with various growth functions},
journal = {Discrete Appl. Math.},
volume = 25,
pages = {53-71},
note = {special issue on Combinatorics and Complexity}
}
@article{FrLo1991,
author = {A. S. Fraenkel and M. Lorberbom},
year = 1991,
title = {Nimhoff games},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 58,
pages = {1-25},
}
@article{FrNe1985,
author = {A. S. Fraenkel and J. Ne\v{s}et\v{r}il},
year = 1985,
title = {Epidemiography},
journal = {Pacific J. Math.},
volume = 118,
pages = {369-381},
}
@article{FrOz1998,
author = {A. S. Fraenkel and M. Ozery},
year = 1998,
title = {Adjoining to Wythoff's game its $P$-positions as moves},
journal = {Theoret. Comput. Sci.},
volume = 205,
pages = {283-296},
}
@article{FrPe1975,
author = {A. S. Fraenkel and Y. Perl},
year = 1975,
title = {Constructions in combinatorial games with cycles},
journal = {Coll. Math. Soc. J\'anos Bolyai},
volume = 10,
note = {Proc. Internat. Colloq. on Infinite and Finite Sets, Vol.~2
(A. Hajnal, R. Rado and V. T. S\'os, eds.) Keszthely, Hungary, 1973, North-Holland},
pages = {667-699},
}
@article{FrRa2001,
author = {A. S. Fraenkel and O. Rahat},
year = 2001,
title = {Infinite cyclic impartial games},
journal = {Theoret. Comput. Sci.},
volume = 252,
publisher = {Springer},
pages = {13-22},
note = {special "Computers and Games" issue; first version appeared in
Proc. 1st Intern. Conf. on Computer Games CG'98, {\rm Tsukuba, Japan, Nov.
1998,} \emph{Lecture Notes in Computer Science}, Vol. 1558, Springer,
pp. 212-221, 1999.},
mrnumber = {MR1715689 (2000m:91028)},
}
@inproceedings{FrRa2003,
author = {A. S. Fraenkel and O. Rahat},
year = 2003,
title = {Complexity of error-correcting codes derived from
combinatorial games},
booktitle = {Proc. Intern. Conference on Computers and Games CG'2002,
Edmonton, Alberta, Canada, July 2002,},
editor = {Y. Bj\"{o}rnsson and M. M\"{u}ller and J. Schaeffer},
volume = {LNCS 2883},
pages = {201-21},
publisher = {Lecture Notes in Computer Science, Springer},
}
@incollection{FrRe2008,
author = {A. S. Fraenkel and E. Reisner},
year = 2008,
title = {The game of End-Wythoff},
pages = {},
editor = {M. H. Albert and R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {},
booktitle = {Games of No Chance III, \emph{Proc. BIRS Workshop on
Combinatorial Games, July, 2005, Banff, Alberta, Canada, MSRI Publ.}},
}
@article{FrSc1991,
author = {A. S. Fraenkel and E. R. Scheinerman},
year = 1991,
title = {A deletion game on hypergraphs},
journal = {Discrete Appl. Math.},
volume = 30,
pages = {155-162},
}
@article{FSU1993,
author = {A. S. Fraenkel and E. R. Scheinerman and D. Ullman},
year = 1993,
title = {Undirected edge geography},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 112,
pages = {371-381},
}
@article{FrSi1993,
author = {A. S. Fraenkel and S. Simonson},
year = 1993,
title = {Geography},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 110,
pages = {197-214},
}
@article{FrTa1975,
author = {A. S. Fraenkel and U. Tassa},
year = 1975,
title = {Strategy for a class of games with dynamic ties},
journal = {Comput. Math. Appl.},
volume = 1,
pages = {237-254},
}
@article{FrTa1982,
author = {A. S. Fraenkel and U. Tassa},
year = 1982,
title = {Strategies for compounds of partizan games},
journal = {Math. Proc. Camb. Phil. Soc.},
volume = 92,
pages = {193-204},
}
@article{FTY1978,
author = {A. S. Fraenkel and U. Tassa and Y. Yesha},
year = 1978,
title = {Three annihilation games},
journal = {Math. Mag.},
volume = 51,
pages = {13-17},
note = {special issue on Recreational Math.}
}
@article{FrYe1976,
author = {A. S. Fraenkel and Y. Yesha},
year = 1976,
title = {Theory of annihilation games},
journal = {Bull. Amer. Math. Soc.},
volume = 82,
pages = {775-777},
}
@article{FrYe1979,
author = {A. S. Fraenkel and Y. Yesha},
year = 1979,
title = {Complexity of problems in games, graphs and algebraic equations},
journal = {Discrete Appl. Math.},
volume = 1,
pages = {15-30},
}
@article{FrYe1982,
author = {A. S. Fraenkel and Y. Yesha},
year = 1982,
title = {Theory of annihilation games --- I},
journal = {J. Combin. Theory \emph{(Ser.~B)}},
volume = 33,
pages = {60-86},
}
@article{FrYe1986,
author = {A. S. Fraenkel and Y. Yesha},
year = 1986,
title = {The generalized Sprague--Grundy function and its
invariance under certain mappings},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 43,
pages = {165-177},
}
@article{FrZu2001,
author = {A. S. Fraenkel and D. Zusman},
year = 2001,
title = {A new heap game},
journal = {Theoret. Comput. Sci.},
volume = 252,
pages = {5-12},
note = {special "Computers and Games" issue; first version appeared in
Proc. 1st Intern. Conf. on Computer Games CG'98, {\rm Tsukuba, Japan, Nov.
1998,} \emph{Lecture Notes in Computer Science}, Vol. 1558, Springer,
pp. 205-211, 1999.},
mrnumber = {MR1715688 (2000m:91027)},
}
@article{Fra1981a,
author = {C. N. Frangakis},
year = 1981,
title = {A backtracking algorithm to generate all kernels of a directed graph},
journal = {Intern. J. Comput. Math.},
volume = 10,
pages = {35-41},
}
@article{Fra1987,
author = {P. Frankl},
year = 1987,
title = {Cops and robbers in graphs with large girth and Cayley graphs},
journal = {Discrete Appl. Math.},
volume = 17,
pages = {301-305},
}
@article{Fra1987a,
author = {P. Frankl},
year = 1987,
title = {On a pursuit game on Cayley graphs},
journal = {Combinatorica},
volume = 7,
pages = {67-70},
}
@article{FrTo2003,
author = {P. Frankl and N. Tokushige},
year = 2003,
title = {The game of $n$-times nim},
journal = {Discrete Math.},
volume = 260,
pages = {205-209},
mrnumber = {MR1948387 (2003m:05017)},
}
@article{FHW2005,
author = {W. Fraser and S. Hirshberg and D. Wolfe},
year = 2005,
title = {The structure of the distributive lattice of games born
by day n},
journal = {Integers, Electr. J of Combinat. Number Theory},
volume = {5(2)},
pages = {\#A06, 11 pp.},
url = {http://www.integers-ejcnt.org/vol5(2).html},
mrnumber = {MR2192084 (2006g:91041)},
}
@article{Fre1973,
author = {D. Fremlin},
year = 1973,
title = {Well-founded games},
journal = {Eureka},
volume = 36,
pages = {33-37},
}
@incollection{FHHMWJMW1995,
author = {G. H. Fricke and S. M. Hedetniemi and S. T. Hedetniemi and A.
A. McRae and C. K. Wallis and M. S. Jacobson and H. W. Martin and W. D.
Weakley},
year = 1995,
title = {Combinatorial problems on chessboards: a brief survey},
pages = {507-528},
editor = {Y. Alavi and A. Schwenk},
publisher = {Wiley},
volume = 1,
booktitle = {Graph Theory, Combinatorics, and Algorithms: \emph{Proc. 7th
Quadrennial Internat. Conf. on the Theory and Applications of Graphs}},
}
@article {MR2340612,
AUTHOR = {Friedman, Eric J. and Landsberg, Adam Scott},
TITLE = {Nonlinear dynamics in combinatorial games: renormalizing
{C}homp},
JOURNAL = {Chaos},
FJOURNAL = {Chaos. An Interdisciplinary Journal of Nonlinear Science},
VOLUME = {17},
YEAR = {2007},
NUMBER = {2},
PAGES = {023117 1-14},
ISSN = {1054-1500},
CODEN = {CHAOEH},
MRCLASS = {91A43 (37N99 82C99)},
MRNUMBER = {MR2340612},
}
@incollection{FrLa2008,
author = {E. J. Friedman and A. S. Landsberg},
year = 2008,
title = {On the geometry of combinatorial games:
a renormalization approach},
pages = {},
editor = {M. H. Albert and R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {},
booktitle = {Games of No Chance III, \emph{Proc. BIRS Workshop on
Combinatorial Games, July, 2005, Banff, Alberta, Canada, MSRI Publ.}},
}
@article {FKPS2005,
AUTHOR = {Frieze, Alan and Krivelevich, Michael and Pikhurko, Oleg and
Szab{\'o}, Tibor},
TITLE = {The game of {J}umble{G}},
JOURNAL = {Combin. Probab. Comput.},
FJOURNAL = {Combinatorics, Probability and Computing},
VOLUME = {14},
YEAR = {2005},
PAGES = {783--793},
ISSN = {0963-5483},
MRCLASS = {05C99 (91A43)},
MRNUMBER = {MR2174656 (2006k:05207)},
MRREVIEWER = {Paul A. Dreyer, Jr.},
}
@article{Fuk2003a,
author = {M. Fukuyama},
title = {A Nim game played on graphs},
journal = {Theoret. Comput. Sci.},
year = 2003,
volume = 304,
pages = {387-399},
mrnumber = {MR1992342 (2004f:91041)},
}
@article{Fuk2003b,
author = {M. Fukuyama},
title = {A Nim game played on graphs II},
journal = {Theoret. Comput. Sci.},
year = 2003,
volume = 304,
pages = {401-419},
mrnumber = {MR1992343 (2004g:91036)},
}
@article{Fun1971,
author = {W. W. Funkenbusch},
title = {{SIM} as a game of chance},
journal = {J. Recr. Math.},
year = 1971,
volume = 4,
number = 4,
pages = {297-298},
month = oct,
}
@article{FuSe1994,
author = {Z. F\"uredi and {\'A}. Seress},
year = 1994,
title = {Maximal triangle-free graphs with restrictions on the degrees},
journal = {J. Graph Theory},
volume = 18,
pages = {11-24},
}
@article{GaWe1992,
author = {H. N. Gabow and H. H. Westermann},
year = 1992,
title = {Forests, frames, and games: algorithms for matroid sums and
applications},
journal = {Algorithmica},
volume = 7,
pages = {465-497},
}
@article{Gal1974,
author = {D. Gale},
year = 1974,
title = {A curious Nim-type game},
journal = {Amer. Math. Monthly},
volume = 81,
pages = {876-879},
}
@article{Gal1979,
author = {D. Gale},
year = 1979,
title = {The game of Hex and the Brouwer fixed-point theorem},
journal = {Amer. Math. Monthly},
volume = 86,
pages = {818-827},
}
@article{Gale1986,
author = {D. Gale},
year = 1986,
title = {Problem 1237 (line-drawing game)},
journal = {Math. Mag.},
volume = 59,
pages = {111},
note = {solution by J. Hutchinson and S. Wagon, {\it ibid.} {\bf 60} (1987) 116},
}
@article{Gal1991-,
author = {D. Gale},
year = {1991 -- 1996},
title = {Mathematical Entertainments},
journal = {Math. Intelligencer},
volume = {13 - 18},
pages = {},
note = {column on mathematical games and gems, Winter 1991 -- Fall 1996},
}
@book{Gale1998,
author = {D. Gale},
year = 1998,
title = {Tracking the Automatic Ant and Other Mathematical Explorations},
publisher = {Springer-Verlag, New York},
note = {A collection of Mathematical Entertainments columns from
The Mathematical Intelligencer},
}
@article{GaNe1982,
author = {D. Gale and A. Neyman},
year = 1982,
title = {Nim-type games},
journal = {Internat. J. Game Theory},
volume = 11,
pages = {17-20},
}
@article{GPST1995,
author = {D. Gale and J. Propp and S. Sutherland and S. Troubetzkoy},
year = 1995,
title = {Further travels with my ant},
journal = {Math. Intelligencer},
volume = {17 {\rm issue 3}},
pages = {48-56},
}
@article{GaSt1953,
author = {D. Gale and F. M. Stewart},
year = 1953,
title = {Infinite games with perfect information},
journal = {Ann. of Math. Stud. \emph{(Contributions to the Theory of
Games), Princeton}},
volume = 2,
number = 28,
pages = {245-266},
}
@article{Gal1982,
author = {H. Galeana-S\'{a}nchez},
year = 1982,
title = {A counterexample to a conjecture of Meyniel on kernel-perfect graphs},
journal = {Discrete Math.},
volume = 41,
pages = {105-107},
}
@article{Gal1986a,
author = {H. Galeana-S\'{a}nchez},
year = 1986,
title = {A theorem about a conjecture of Meyniel on kernel-perfect graphs},
journal = {Discrete Math.},
volume = 59,
pages = {35-41},
}
@article {Gal1988,
AUTHOR = {Galeana-S{\'a}nchez, Hortensia},
TITLE = {A new method to extend kernel-perfect graphs to kernel-perfect
critical graphs},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {69},
YEAR = {1988},
PAGES = {207--209},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05C20},
MRNUMBER = {MR937787 (89d:05086)},
MRREVIEWER = {Carsten Thomassen},
}
@article {Gal1990,
AUTHOR = {Galeana-S{\'a}nchez, Hortensia},
TITLE = {On the existence of {$(k,l)$}-kernels in digraphs},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {85},
YEAR = {1990},
PAGES = {99--102},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05C20},
MRNUMBER = {MR1078316 (91h:05056)},
}
@article{Gal1992,
author = {H. Galeana-S\'{a}nchez},
year = 1992,
title = {On the existence of kernels and $h$-kernels in directed graphs},
journal = {Discrete Math.},
volume = 110,
pages = {251--255},
}
@article{Gal1995,
author = {H. Galeana-S\'{a}nchez},
year = 1995,
title = {$B_1$ and $B_2$-orientable graphs in kernel theory},
journal = {Discrete Math.},
volume = 143,
pages = {269-274},
}
@article {{Gal1996,
AUTHOR = {Galeana-S{\'a}nchez, H.},
TITLE = {On claw-free {$M$}-oriented critical kernel-imperfect
digraphs},
JOURNAL = {J. Graph Theory},
FJOURNAL = {Journal of Graph Theory},
VOLUME = {21},
YEAR = {1996},
PAGES = {33--39},
ISSN = {0364-9024},
CODEN = {JGTHDO},
MRCLASS = {05C20},
MRNUMBER = {MR1363686 (96h:05089)},
}
@article {Gal1998,
AUTHOR = {Galeana-S{\'a}nchez, Hortensia},
TITLE = {Kernels in edge-colored digraphs},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {184},
YEAR = {1998},
PAGES = {87--99},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05C20},
MRNUMBER = {MR1609359 (99a:05055)},
MRREVIEWER = {Mat{\'u}{\v{s}} Harminc},
}
@article{Gal2000,
author = {H. Galeana-S\'{a}nchez},
year = 2000,
title = {Semikernels modulo $F$ and kernels in digraphs},
journal = {Discrete Math.},
volume = 218,
pages = {61-71},
MRNUMBER = {MR1754327 (2001d:05068)},
}
@article{Gal2002,
author = {H. Galeana-S\'{a}nchez},
year = 2002,
title = {Kernels in digraphs with covering number at most 3},
journal = {Discrete Math.},
volume = 259,
pages = {121-135},
mrnumber = {MR1948776 (2003m:05090)},
}
@article {Gal2004,
AUTHOR = {Galeana-S{\'a}nchez, Hortensia},
TITLE = {Some sufficient conditions on odd directed cycles of bounded
length for the existence of a kernel},
JOURNAL = {Discuss. Math. Graph Theory},
FJOURNAL = {Discussiones Mathematicae. Graph Theory},
VOLUME = {24},
YEAR = {2004},
PAGES = {171--182},
ISSN = {1234-3099},
MRCLASS = {05C20},
MRNUMBER = {MR2120561 (2005m:05104)},
MRREVIEWER = {Mat{\'u}{\v{s}} Harminc},
}
@article {Gal2006,
AUTHOR = {Galeana-S{\'a}nchez, Hortensia},
TITLE = {Kernels and perfectness in arc-local tournament digraphs},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
note = {special issue: Creation and Recreation: A Tribute to the
Memory of Claude Berge},
VOLUME = {306},
YEAR = {2006},
NUMBER = {19-20},
PAGES = {2473--2480},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05C20},
MRNUMBER = {MR2261913 (2007g:05071)},
MRREVIEWER = {LeRoy B. Beasley},
}
@article{Gal2008,
author = {H. Galeana-S\'{a}nchez},
year = 2008,
title = {Kernels in edge-coloured orientations of nearly complete graphs},
journal = {Discrete Math.},
volume = 308,
pages = {4599--4607},
mrnumber = {**MR pending},
}
@article {GaGa2000,
AUTHOR = {Galeana-S{\'a}nchez, Hortensia and J. de J.
Garc{\'{\i}}a-Ruvalcaba},
TITLE = {Kernels in the closure of coloured digraphs},
JOURNAL = {Discuss. Math. Graph Theory},
FJOURNAL = {Discussiones Mathematicae. Graph Theory},
VOLUME = {20},
YEAR = {2000},
PAGES = {243--254},
ISSN = {1234-3099},
MRCLASS = {05C20 (05C15)},
MRNUMBER = {MR1817495 (2001m:05123)},
}
@article {MR1867488,
AUTHOR = {Galeana-S{\'a}nchez, Hortensia and Garc{\'{\i}}a-Ruvalcaba,
Jos{\'e} de Jes{\'u}s},
TITLE = {On graphs all of whose {$\{C\sb 3,T\sb 3\}$}-free arc
colorations are kernel-perfect},
JOURNAL = {Discuss. Math. Graph Theory},
FJOURNAL = {Discussiones Mathematicae. Graph Theory},
VOLUME = {21},
YEAR = {2001},
NUMBER = {1},
PAGES = {77--93},
ISSN = {1234-3099},
MRCLASS = {05C20 (05C15 05C45)},
MRNUMBER = {MR1867488 (2002j:05075)},
MRREVIEWER = {Mat{\'u}{\v{s}} Harminc},
}
@incollection {MR2324045,
AUTHOR = {Galeana-S{\'a}nchez, Hortensia and Guevara, Mucuy-kak},
TITLE = {Kernel perfect and critical kernel imperfect digraphs
structure},
BOOKTITLE = {6th Czech-Slovak International Symposium on Combinatorics,
Graph Theory, Algorithms and Applications},
SERIES = {Electron. Notes Discrete Math.},
VOLUME = {28},
PAGES = {401--408},
PUBLISHER = {Elsevier},
ADDRESS = {Amsterdam},
YEAR = {2007},
MRCLASS = {05C20},
MRNUMBER = {MR2324045},
}
@article {GaLi1998a,
AUTHOR = {Galeana-S{\'a}nchez, H. and Li, Xueliang},
TITLE = {Kernels in a special class of digraphs},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {178},
YEAR = {1998},
PAGES = {73--80},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05C20},
MRNUMBER = {MR1483740 (98f:05073)},
}
@article {GaLi1998b,
AUTHOR = {Galeana-S{\'a}nchez, H. and Li, Xueliang},
TITLE = {Semikernels and {$(k,l)$}-kernels in digraphs},
JOURNAL = {SIAM J. Discrete Math.},
FJOURNAL = {SIAM Journal on Discrete Mathematics},
VOLUME = {11},
YEAR = {1998},
PAGES = {340--346 (electronic)},
ISSN = {0895-4801},
MRCLASS = {05C20},
MRNUMBER = {MR1617163 (99c:05078)},
MRREVIEWER = {Mat{\'u}{\v{s}} Harminc},
}
@article{GaNe1984,
author = {H. Galeana-S\'{a}nchez and V. Neumann-Lara},
year = 1984,
title = {On kernels and semikernels of digraphs},
journal = {Discrete Math.},
volume = 48,
pages = {67-76},
}
@article {{GaNe1986,
AUTHOR = {Galeana-S{\'a}nchez, H. and Neumann Lara, V.},
TITLE = {On kernel-perfect critical digraphs},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {59},
YEAR = {1986},
PAGES = {257--265},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05C20 (05C40)},
MRNUMBER = {MR842278 (88b:05069)},
}
@article{GaNe1991a,
author = {H. Galeana-S\'{a}nchez and V. Neumann-Lara},
year = 1991,
title = {Extending kernel perfect digraphs to kernel perfect critical
digraphs},
journal = {Discrete Math.},
volume = 94,
pages = {181-187},
}
@article {GaNe1991b,
AUTHOR = {Galeana-S{\'a}nchez, H. and Neumann Lara, V.},
TITLE = {Orientations of graphs in kernel theory},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {87},
YEAR = {1991},
PAGES = {271--280},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05C75},
MRNUMBER = {MR1095472 (92d:05134)},
MRREVIEWER = {E. Olaru},
}
@article{GaNe1994,
author = {H. Galeana-S\'{a}nchez and V. Neumann-Lara},
year = 1994,
title = {New extensions of kernel perfect digraphs to kernel imperfect
critical digraphs},
journal = {Graphs Combin.},
volume = 10,
pages = {329-336},
}
@article {GaNe1998a,
AUTHOR = {Galeana-S{\'a}nchez, Hortensia and Neumann-Lara, V.},
TITLE = {New classes of critical kernel-imperfect digraphs},
JOURNAL = {Discuss. Math. Graph Theory},
FJOURNAL = {Discussiones Mathematicae. Graph Theory},
VOLUME = {18},
YEAR = {1998},
PAGES = {85--89},
ISSN = {1234-3099},
MRCLASS = {05C20},
MRNUMBER = {MR1646233 (99g:05087)},
MRREVIEWER = {Mat{\'u}{\v{s}} Harminc},
}
@article {GaNe1998b,
AUTHOR = {Galeana-S{\'a}nchez, Hortensia and Neumann-Lara, V.},
TITLE = {On the dichromatic number in kernel theory},
JOURNAL = {Math. Slovaca},
FJOURNAL = {Mathematica Slovaca},
VOLUME = {48},
YEAR = {1998},
PAGES = {213--219},
ISSN = {0139-9918},
MRCLASS = {05C20 (05C15)},
MRNUMBER = {MR1647678 (99k:05080)},
MRREVIEWER = {Mat{\'u}{\v{s}} Harminc},
}
@article {GaPa1998c,
AUTHOR = {Galeana-S{\'a}nchez, H. and Pastrana Ram{\'{\i}}rez, L.},
TITLE = {Kernels in edge coloured line digraph},
JOURNAL = {Discuss. Math. Graph Theory},
FJOURNAL = {Discussiones Mathematicae. Graph Theory},
VOLUME = {18},
YEAR = {1998},
PAGES = {91--98},
ISSN = {1234-3099},
MRCLASS = {05C20},
MRNUMBER = {MR1646234 (99g:05088)},
MRREVIEWER = {Mat{\'u}{\v{s}} Harminc},
}
@article {GPR1991,
AUTHOR = {Galeana-S{\'a}nchez, H. and Pastrana Ram{\'{\i}}rez, L. and
Rinc{\'o}n-Mej{\'{\i}}a, H. A.},
TITLE = {Semikernels, quasi kernels, and {G}rundy functions in the line
digraph},
JOURNAL = {SIAM J. Discrete Math.},
FJOURNAL = {SIAM Journal on Discrete Mathematics},
VOLUME = {4},
YEAR = {1991},
PAGES = {80--83},
ISSN = {0895-4801},
CODEN = {SJDMEC},
MRCLASS = {05C20 (05C78)},
MRNUMBER = {MR1090291 (92c:05068)},
MRREVIEWER = {David M. Berman},
}
@article {Gal2005,
AUTHOR = {Galeana-S{\'a}nchez, Hortensia and Ram{\'{\i}}rez, Laura
Pastrana and Rinc{\'o}n Mej{\'{\i}}a, Hugo Alberto},
TITLE = {Kernels in monochromatic path digraphs},
JOURNAL = {Discuss. Math. Graph Theory},
FJOURNAL = {Discussiones Mathematicae. Graph Theory},
VOLUME = {25},
YEAR = {2005},
PAGES = {407--417},
ISSN = {1234-3099},
MRCLASS = {05C20},
MRNUMBER = {MR2233005},
}
@article {GaRi1998,
AUTHOR = {Galeana-S{\'a}nchez, H. and Rinc{\'o}n-Mej{\'{\i}}a, H. A.},
TITLE = {A sufficient condition for the existence of {$k$}-kernels in
digraphs},
JOURNAL = {Discuss. Math. Graph Theory},
FJOURNAL = {Discussiones Mathematicae. Graph Theory},
VOLUME = {18},
YEAR = {1998},
PAGES = {197--204},
ISSN = {1234-3099},
MRCLASS = {05C20},
MRNUMBER = {MR1687843 (2000c:05074)},
MRREVIEWER = {Mat{\'u}{\v{s}} Harminc},
}
@article {GaRo2004,
AUTHOR = {Galeana-S{\'a}nchez, Hortensia and Rojas-Monroy, Roc{\'{\i}}o},
TITLE = {Kernels in pretransitive digraphs},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {275},
YEAR = {2004},
PAGES = {129--136},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05C20},
MRNUMBER = {MR2026280 (2004j:05059)},
}
@article {MR2251578,
AUTHOR = {Galeana-S{\'a}nchez, Hortensia and Rojas-Monroy, Roc{\'{\i}}o},
TITLE = {Kernels in quasi-transitive digraphs},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {306},
YEAR = {2006},
NUMBER = {16},
PAGES = {1969--1974},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05C20},
MRNUMBER = {MR2251578 (2007b:05092)},
}
@article {MR2273872,
AUTHOR = {Galeana-S{\'a}nchez, Hortensia and Rojas-Monroy, Roc{\'{\i}}o},
TITLE = {Extensions and kernels in digraphs and in edge-coloured
digraphs},
JOURNAL = {WSEAS Trans. Math.},
FJOURNAL = {WSEAS Transactions on Mathematics},
VOLUME = {6},
YEAR = {2007},
NUMBER = {2},
PAGES = {334--341},
ISSN = {1109-2769},
MRCLASS = {05C20 (05C15)},
MRNUMBER = {MR2273872},
MRREVIEWER = {Mat{\'u}{\v{s}} Harminc},
}
@incollection {MR2279176,
AUTHOR = {Galeana-S{\'a}nchez, Hortensia and Rojas-Monroy, Roc{\'{\i}}o},
TITLE = {Kernels in orientations of pretransitive orientable graphs},
BOOKTITLE = {Graph theory in Paris},
SERIES = {Trends Math.},
PAGES = {197--208},
PUBLISHER = {Birkh\"auser},
ADDRESS = {Basel},
YEAR = {2007},
MRCLASS = {05C20},
MRNUMBER = {MR2279176},
}
@article {GGHR2006,
AUTHOR = {Gallant, Robert P. and Gunther, Georg and Hartnell, Bert L.
and Rall, Douglas F.},
TITLE = {A game of edge removal on graphs},
JOURNAL = {J. Combin. Math. Combin. Comput.},
FJOURNAL = {Journal of Combinatorial Mathematics and Combinatorial
Computing},
VOLUME = {57},
YEAR = {2006},
PAGES = {75--82},
ISSN = {0835-3026},
MRCLASS = {05C99},
MRNUMBER = {MR2226684 (2006m:05245)},
}
@article{Gal1978,
author = {F. Galvin},
year = 1978,
title = {Indeterminacy of point-open games},
journal = {Bull. de l'Academie Polonaise des Sciences \emph{(Math. astr. et phys.)}},
volume = 26,
pages = {445-449},
}
@inproceedings{Gal1985,
author = {F. Galvin},
year = 1985,
title = {Stationary strategies in topological games},
booktitle = {Proc. Conf. on Infinitistic Mathematics \emph{(Lyon, 1984)}},
organization = {Publ. D\'ep. Math. Nouvelle S\'er. B, 85--2, Univ.
Claude-Bernard, Lyon},
pages = {41-43},
}
@incollection{Galv1990,
author = {F. Galvin},
year = 1990,
title = {Hypergraph games and the chromatic number},
booktitle = {A Tribute to Paul Erd\H os},
publisher = {Cambridge Univ Press, Cambridge},
pages = {201-206},
}
@article{GJM1978,
author = {F. Galvin and T. Jech and M. Magidor},
year = 1978,
title = {An ideal game},
journal = {J. Symbolic Logic},
volume = 43,
pages = {284-292},
}
@article{GaSc1992,
author = {F. Galvin and M. Scheepers},
year = 1992,
title = {A Ramseyan theorem and an infinite game},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 59,
pages = {125-129},
}
@article{GaTe1986,
author = {F. Galvin and R. Telg\'arsky},
year = 1986,
title = {Stationary strategies in topological games},
journal = {Topology Appl.},
volume = 22,
pages = {51-69},
}
@article{GaYel1995,
author = {B. B. Gan and Y. N. Yeh},
year = 1995,
title = {A nim-like game and dynamic recurrence relations},
journal = {Stud. Appl. Math.},
volume = 95,
pages = {213-228},
}
@article{GaPl1989,
author = {A. Gangolli and T. Plambeck},
year = 1989,
title = {A note on periodicity in some octal games},
journal = {Internat. J. Game Theory},
volume = 18,
pages = {311-320},
}
@article{Gan1988,
author = {T. E. Gantner},
year = 1988,
title = {The game of Quatrainment},
journal = {Math. Mag.},
volume = 61,
pages = {29-34},
}
@book{Gar1956,
author = {M. Gardner},
year = 1956,
title = {Mathematics, Magic and Mystery},
publisher = {Dover, New York, NY},
}
@misc{Gar1957,
author = {M. Gardner},
year = {Jan. 1957--Dec. 1981},
title = {Mathematical Games},
note = {a column in Scientific American; all 15 volumes of the column are on 1 CD-ROM,
available from MAA},
}
@book{Gar1959a,
author = {M. Gardner},
year = 1959,
title = {Fads and Fallacies in the Name of Science},
publisher = {Dover, NY},
}
@book{Gar1959b,
author = {M. Gardner},
year = 1959,
title = {Logic Machines and Diagrams},
publisher = {McGraw-Hill, NY},
}
@book{Gar1959c,
author = {M. Gardner},
year = 1959,
title = {Mathematical Puzzles of Sam Loyd},
publisher = {Dover, New York, NY},
}
@book{Gar1960,
author = {M. Gardner},
year = 1960,
title = {More Mathematical Puzzles of Sam Loyd},
publisher = {Dover, New York, NY},
}
@book{Gar1966,
author = {M. Gardner},
year = 1966,
title = {More Mathematical Puzzles and Diversions},
publisher = {Har\-monds\-worth, Middlesex, England (Penguin Books)},
note = {translated into German: {\it Ma\-the\-matische R\"atsel und Probleme},
Vieweg, Braunschweig, 1964},
}
@book{Gar1967,
editor = {M. Gardner},
year = 1967,
title = {536 Puzzles and Curious Problems},
note = {reissue of H. E. Dudeney's {\it Modern Puzzles} and {\it Puzzles and
Curious Problems}},
publisher = {Scribner's, NY},
}
@book{Gar1968,
author = {M. Gardner},
year = 1968,
title = {Logic Machines, Diagrams and Boolean Algebra},
publisher = {Dover, NY},
}
@book{Gar1970,
author = {M. Gardner},
year = 1970,
title = {Further Mathematical Diversions},
publisher = {Allen and Unwin, London},
}
@book{Gar1977,
author = {M. Gardner},
year = 1977,
title = {Mathematical Magic Show},
publisher = {Knopf, NY},
}
@book{Gar1978,
author = {M. Gardner},
year = 1978,
title = {Aha! Insight},
publisher = {Freeman, New York, NY},
}
@book{Gar1979,
author = {M. Gardner},
year = 1979,
title = {Mathematical Circus},
publisher = {Knopf, NY},
}
@book{Gar1981,
author = {M. Gardner},
year = 1981,
title = {Entertaining Science Experiments with Everyday Objects},
publisher = {Dover, NY},
}
@book{Gar1981a,
author = {M. Gardner},
year = 1981,
title = {Science Fiction Puzzle Tales},
publisher = {Potter},
}
@book{Gar1982,
author = {M. Gardner},
year = 1982,
title = {Aha! Gotcha!},
publisher = {Freeman, New York, NY},
}
@book{Gar1983,
author = {M. Gardner},
year = 1983,
title = {New Mathematical Diversions from Scientific American},
publisher = {University of Chicago Press, Chicago},
note = {before that appeared in 1971, Simon and Schuster, New York, NY.
First appeared in 1966},
}
@book{Gar1983a,
author = {M. Gardner},
year = 1983,
title = {Order and Surprise},
publisher = {Prometheus Books, Buffalo, NY},
}
@book{Gar1983b,
author = {M. Gardner},
year = 1983,
title = {Wheels, Life and Other Mathematical Amusements},
publisher = {Freeman, New York, NY},
}
@book{Gar1984,
author = {M. Gardner},
year = 1984,
title = {Codes, Ciphers and Secret Writing},
publisher = {Dover, NY},
}
@book{Gar1984a,
author = {M. Gardner},
year = 1984,
title = {Puzzles from Other Worlds},
publisher = {Random House},
}
@book{Gar1984b,
author = {M. Gardner},
year = 1984,
title = {The Magic Numbers of Dr. Matrix},
publisher = {Prometheus},
}
@book{Gar1984c,
author = {M. Gardner},
year = 1984,
title = {The Sixth Book of Mathematical Games},
publisher = {Univ. of Chi\-ca\-go Press. First appeared in 1971, Freeman,
New York, NY},
}
@book{Gar1986,
author = {M. Gardner},
year = 1986,
title = {Knotted Doughnuts and Other Mathematical Entertainments},
publisher = {Freeman, New York, NY},
}
@book{Gar1987,
author = {M. Gardner},
year = 1987,
title = {The Second Scientific American Book of Mathematical Puzzles and
Diversions},
publisher = {University of Chicago Press, Chicago. First appeared in 1961,
Simon and Schuster, NY},
}
@book{Gar1988,
author = {M. Gardner},
year = 1988,
title = {Hexaflexagons and Other Mathematical Diversions},
publisher = {University of Chicago Press, Chicago, 1988. A first version
appeared under the title {\it The Scientific American Book of Mathematical
Puzzles and Diversions}, Simon \& Schuster, 1959, NY},
}
@book{Gar1988a,
author = {M. Gardner},
year = 1988,
title = {Perplexing Puzzles and Tantalizing Teasers},
publisher = {Dover, NY},
}
@book{Gar1988b,
author = {M. Gardner},
year = 1988,
title = {Riddles of the Sphinx},
publisher = {Math. Assoc. of America, Washington, DC},
}
@book{Gar1988c,
author = {M. Gardner},
year = 1988,
title = {Time Travel and Other Mathematical Bewilderments},
publisher = {Freeman, New York, NY},
}
@book{Gar1989,
author = {M. Gardner},
year = 1989,
title = {How Not to Test a Psychic},
publisher = {Prometheus Books, Buffalo, NY},
}
@book{Gar1989a,
author = {M. Gardner},
year = 1989,
title = {Mathematical Carnival},
publisher = {2nd edition, Math. Assoc. of America, Washington, DC.
First appeared in 1975, Knopf, NY},
}
@book{Gar1990,
author = {M. Gardner},
year = 1990,
title = {The New Ambidextrous Universe},
publisher = {Freeman, New York, NY. First appeared in 1964, Basic Books,
then in 1969, New American Library},
}
@book{Gar1991,
author = {M. Gardner},
year = 1991,
title = {The Unexpected Hanging and Other Mathematical Diversions},
publisher = {University of Chicago Press. First appeared in 1969, Simon
and Schuster, NY},
note = {adapted from ``Further Mathematical Diversions"; translated into German:
{\it Logik Unterm Galgen}, Vieweg, Braunschweig, 1980},
}
@book{Gar1992,
author = {M. Gardner},
year = 1992,
title = {Fractal Music, Hypercards and More},
publisher = {Freeman, New York, NY},
}
@book{Gar1992a,
author = {M. Gardner},
year = 1992,
title = {On the Wild Side},
publisher = {Prometheus Books, Buffalo, NY},
}
@book{Gar1993,
author = {M. Gardner},
year = 1993,
title = {Book of Visual Illusions},
publisher = {Dover, NY},
}
@book{Gar1997,
author = {M. Gardner},
year = 1997,
title = {Penrose Tiles to Trapdoor Ciphers},
publisher = {The Math. Assoc. of America, Washington, DC. First
appeared in 1989, Freeman, New York, NY. Freeman, New York, NY},
}
@book{Gar1997a,
author = {M. Gardner},
year = 1997,
title = {The Last Recreations},
publisher = {Copernicus, NY},
}
@book{Gar2001,
author = {M. Gardner},
year = 2001,
title = {A Gardner's Workout: Training the Mind and Entertaining the Spirit},
publisher = {A K Peters, Natick, MA},
}
@book{GaJo1979,
author = {M. R. Garey and D. S. Johnson},
title = {Computers and Intractability: A Guide to the Theory of
NP-Completeness},
note = {Appendix A8: Games and Puzzles, pp. 254-258},
year = 1979,
publisher = {Freeman, San Francisco},
}
@incollection{Gas1996,
author = {R. Gasser},
year = 1996,
title = {Solving nine men's Morris},
pages = {101-114},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}
@article{GaSt2004,
author = {H. Gavel and P. Strimling},
year = 2004,
title = {Nim with a modular Muller twist},
journal = {Integers, Electr. J of Combinat. Number Theory},
volume = {4},
pages = {\#G4, 9 pp., Comb. Games Sect.},
url = {http://www.integers-ejcnt.org/vol4.html},
mrnumber = {MR2116010},
}
@article{Ger2000,
author = {B. Gerla},
year = 2000,
title = {Conditioning a state by \L ukasiewicz event: a probabilistic
approach to Ulam Games},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 230,
pages = {149-166},
mrnumber = {MR1725635 (2001e:03117)},
}
@incollection{GeKh2003,
author = {C. Germain and H. Kheddouci},
year = 2003,
title = {Grundy coloring for power graphs},
pages = {67-69},
editor = {D. Ray-Chaudhuri and A. Rao and B. Roy},
publisher = {Elsevier, Amsterdam},
volume = {15},
booktitle = {Electron. Notes Discrete Math.},
}
@inproceedings {MR582263,
AUTHOR = {Gervacio, Severino V.},
TITLE = {On graphs all of whose orientations have kernels},
BOOKTITLE = {Proceedings of the {F}irst {F}ranco-{S}outheast {A}sian
{M}athematical {C}onference ({S}ingapore, 1979), {V}ol.\ {II}},
JOURNAL = {Rend. Accad. Sci. Fis. Mat. Napoli (4)},
FJOURNAL = {Societ\`a Nazionale di Scienze, Lettere ed Arti in Napoli.
Rendiconto dell'Accademia delle Scienze Fisiche e Matematiche.
Serie IV},
VOLUME = 46,
YEAR = 1979,
PAGES = {259--263 (1980)},
ISSN = {0370-3568},
CODEN = {RASFAM},
MRCLASS = {05C75 (05C15)},
MRNUMBER = {MR582263 (83c:05103)},
}
@article{GiWe1997,
author = {P. B. Gibbons and J. A. Webb},
year = 1997,
title = {Some new results for the queens domination problem},
journal = {Australas. J. Combin.},
volume = 15,
pages = {145-160},
}
@article{GLT1980,
author = {J. R. Gilbert and T. Lengauer and R. E. Tarjan},
year = 1980,
title = {The pebbling problem is complete in polynomial space},
journal = {SIAM J. Comput.},
volume = 9,
pages = {513-524},
note = {preliminary version in Proc. 11th Ann. ACM Symp. Theory of
Computing (Atlanta, GA, 1979), Assoc. Comput. Mach., New York, NY, pp.
237--248},
}
@incollection{Gin2002,
author = {M. Ginsberg},
year = 2002,
title = {Alpha-beta pruning under partial orders},
pages = {37-48},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
}
@article{Gin1939,
author = {J. Ginsburg},
year = 1939,
title = {Gauss's arithmetization of the problem of 8 queens},
journal = {Scripta Math.},
volume = 5,
pages = {63-66},
}
@article{GoRe1995,
author = {A. S. Goldstein and E. M. Reingold},
year = 1995,
title = {The complexity of pursuit on a graph},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 143,
pages = {93-112},
}
@article {GoKl1997,
AUTHOR = {Goldwasser, John and Klostermeyer, William},
TITLE = {Maximization versions of ``lights out'' games in grids and
graphs},
NOTE = {Proc. 28th Southeastern Internat. Conf. on Combinatorics,
Graph Theory, and Computing (Boca Raton, FL, 1997)},
JOURNAL = {Congr. Numer.},
FJOURNAL = {Congressus Numerantium. A Conference Journal on Numerical
Themes},
VOLUME = {126},
YEAR = {1997},
PAGES = {99--111},
ISSN = {0384-9864},
MRCLASS = {05C85 (05C99)},
MRNUMBER = {MR1604979 (98j:05119)},
}
@article{Gol1991,
author = {E. Goles},
year = 1991,
title = {Sand piles, combinatorial games and cellular automata},
journal = {Math. Appl.},
volume = 64,
pages = {101-121},
}
@article{GoKi1993,
author = {E. Goles and M. A. Kiwi},
year = 1993,
title = {Games on line graphs and sand piles},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 115,
pages = {321-349 ($0$-player game)},
}
@article{GLMMP2004,
author = {E. Goles and M. Latapy and C. Magnien and M. Morvan and H D. Phan},
year = 2004,
title = {Sandpile models and lattices: a comprehensive survey},
journal = {Theoret. Comput. Sci.},
volume = 322,
pages = {383-407},
mrnumber = {MR2080235 (2005h:05013)},
}
@article{GoMa1997,
author = {E. Goles and M. Margenstern},
year = 1997,
title = {Universality of the chip-firing game},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 172,
pages = {121-134},
}
@article{GMP2002,
author = {E. Goles and M. Morvan and H D. Phan},
year = 2002,
title = {The structure of a linear chip firing game and related models},
journal = {Theoret. Comput. Sci.},
volume = 270,
pages = {827-841},
mrnumber = {MR1871097 (2002k:05013)},
}
@article{GoPr2000,
author = {E. Goles and E. Prisner},
year = 2000,
title = {Source reversal and chip firing on graphs},
journal = {Theoret. Comput. Sci.},
volume = 233,
pages = {287-295},
}
@article{Gol1966,
author = {S. W. Golomb},
year = 1966,
title = {A mathematical investigation of games of ``take-away"},
journal = {J. Combin. Theory},
volume = 1,
pages = {443-458},
}
@book{Gol1994,
author = {S. W. Golomb},
year = 1994,
title = {Polyominoes: Puzzles, Patterns, Problems, and Packings},
publisher = {Princeton University Press. Original edition: {\it
Polyominoes}, Scribner's, NY, 1965; Allen and Unwin, London, 1965},
}
@incollection{GoHa2002,
author = {S. W. Golomb and A. W. Hales},
year = 2002,
title = {Hypercube Tic-Tac-Toe},
pages = {167-182},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1973012 (2004c:91030)},
}
@book{Gon1986,
author = {H. Gonshor},
year = 1986,
title = {An Introduction to the Theory of Surreal Numbers},
publisher = {Cambridge University Press, Cambridge},
}
@article{GRH1994,
author = {D. M. Gordon and R. W. Robinson and F. Harary},
year = 1994,
title = {Minimum degree games for graphs},
journal = {Discrete Math.},
volume = 128,
pages = {151-163},
mrnumber = {MR1271861 (95b:05201)},
}
@article{Gra1990,
author = {E. Gr\"adel},
year = 1990,
title = {Domino games and complexity},
journal = {SIAM J. Comput.},
volume = 19,
pages = {787-804},
}
@article{Gra1985,
author = {S. B. Grantham},
year = 1985,
title = {Galvin's ``racing pawns" game and a well-ordering of trees},
journal = {Memoirs Amer. Math. Soc.},
volume = 53,
number = 316,
pages = {63 pp.},
}
@article{Gra2003,
author = {S. Gravier and M. Mhalla and E. Tannier},
year = 2003,
title = {On a modular domination game},
journal = {Theoret. Comput. Sci.},
volume = 306,
pages = {291-303},
mrnumber = {MR2000178 (2004i:91041)},
}
@book{GHR1995,
author = {R. Greenlaw and H. J. Hoover and W. L. Ruzzo},
year = 1995,
title = {Limits to Parallel Computation: $P$-completeness Theory},
publisher = {Oxford University Press, New York},
}
@article{Gro2004,
author = {J. P. Grossman},
year = 2004,
title = {Periodicity in one-dimensional peg duotaire},
journal = {Theoret. Comp. Sci.},
volume = {313},
pages = {417-425},
note = {special issue of Dagstuhl Seminar ``Algorithmic Combinatorial
Game Theory'', Feb. 2002},
mrnumber = {MR2056936 (2005b:91055)},
}
@incollection{GrNo2002,
author = {J. P. Grossman and R. J. Nowakowski},
year = 2002,
title = {One-dimensional Phutball},
pages = {361-367},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1973024},
}
@incollection{GrSi2008,
author = {J. P. Grossman and A. N. Siegel},
year = 2008,
title = {Reductions of partizan games},
pages = {},
editor = {M. H. Albert and R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {},
booktitle = {Games of No Chance III, \emph{Proc. BIRS Workshop on
Combinatorial Games, July, 2005, Banff, Alberta, Canada, MSRI Publ.}},
}
@article{Gr2000,
author = {J. W. Grossman},
year = 2000,
title = {A variant of Nim},
journal = {Math. Mag.},
volume = 73,
pages = {323-324},
note = {Problem No.~1580; originally posed {\it ibid.} {\bf 72} (1999) 325},
}
@article{Gru1964,
author = {P. M. Grundy},
year = 1964,
title = {Mathematics and Games},
journal = {Eureka},
volume = 27,
pages = {9-11},
note = {originally published: {\it ibid.} {\bf 2} (1939) 6--8},
}
@article{GrSm1956,
author = {P. M. Grundy and C. A. B. Smith},
year = 1956,
title = {Disjunctive games with the last player losing},
journal = {Proc. Camb. Phil. Soc.},
volume = 52,
pages = {527-533},
}
@book{GrBe1975,
author = {F. Grunfeld and R. C. Bell},
year = 1975,
title = {Games of the World},
publisher = {Holt, Rinehart and Winston},
}
@book{Gru1976,
author = {C. D. Grupp},
year = 1976,
title = {Brettspiele-Denkspiele},
publisher = {Humboldt-Taschenbuch\-ver\-lag, M\"unchen},
}
@article{GuZh1999,
author = {D. J. Guan and X. Zhu},
year = 1999,
title = {Game chromatic number of outerplanar graphs},
journal = {J. Graph Theory},
volume = 30,
pages = {67--70},
}
@article {MR1712332,
AUTHOR = {Guibas, Leonidas J. and Latombe, Jean-Claude and Lavalle,
Steven M. and Lin, David and Motwani, Rajeev},
TITLE = {A visibility-based pursuit-evasion problem},
JOURNAL = {Internat. J. Comput. Geom. Appl.},
FJOURNAL = {International Journal of Computational Geometry \&
Applications},
VOLUME = {9},
YEAR = {1999},
PAGES = {471--493},
ISSN = {0218-1959},
MRCLASS = {68U05 (68T40)},
MRNUMBER = {MR1712332 (2000e:68177)},
}
@article{GuOd1981,
author = {L. J. Guibas and A. M. Odlyzko},
year = 1981,
title = {String overlaps, pattern matching, and nontransitive games},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 30,
pages = {183-208},
}
@article{Gun1874,
author = {S. Gunther},
year = 1874,
title = {Zur mathematischen Theorie des Schachbretts},
journal = {Arch. Math. Physik},
volume = 56,
pages = {281-292},
}
@article {Gur2007,
AUTHOR = {Gurvich, Vladimir A.},
TITLE = {On the misere version of game {E}uclid and miserable games},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {307},
YEAR = {2007},
NUMBER = {9-10},
PAGES = {1199--1204},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {91A46 (05A99)},
MRNUMBER = {MR2292548 (2007k:91052)},
}
@inproceedings{Guy1976,
author = {R. K. Guy},
year = 1976,
title = {Packing $[1,n]$ with solutions of $ax+by=cz$; the unity of
combinatorics},
booktitle = {Atti Conv. Lincei \#17, Acad. Naz. Lincei, Tomo II},
address = {Rome},
pages = {173-179},
}
@article{Guy1976a,
author = {R. K. Guy},
year = 1976,
title = {Twenty questions concerning Conway's sylver coinage},
journal = {Amer. Math. Monthly},
volume = 83,
pages = {634-637},
}
@inproceedings{Guy1977,
author = {R. K. Guy},
year = 1977,
title = {Games are graphs, indeed they are trees},
booktitle = {Proc. 2nd Carib. Conf. Combin. and Comput., \emph{Letchworth
Press, Barbados}},
pages = {6-18},
}
@misc{Guy1977a,
author = {R. K. Guy},
year = 1977,
title = {She loves me, she loves me not; relatives of two games of Lenstra},
howpublished = {Een Pak met een Korte Broek (papers presented to H. W.
Lenstra), Mathematisch Centrum, Amsterdam},
}
@article{Guy1978,
author = {R. K. Guy},
year = 1978,
title = {Partizan and impartial combinatorial games},
journal = {Colloq. Math. Soc. J\'anos Bolyai},
volume = 18,
note = {Proc. 5th Hungar. Conf. Combin.\, Vol.~I (A. Hajnal and V.
T. S\'os, eds.), Keszthely, Hungary, 1976, North-Holland},
pages = {437-461},
}
@inproceedings{Guy1979,
author = {R. K. Guy},
year = 1979,
title = {Partizan Games},
booktitle = {Colloques Internationaux C. N. R. No. 260 --- Probl\`emes
Combinatoires et Th\'eorie des Graphes},
pages = {199-205},
}
@incollection{Guy1981,
author = {R. K. Guy},
year = 1981,
title = {Anyone for twopins?},
pages = {2-15},
editor = {D. A. Klarner},
publisher = {Wadsworth Internat., Belmont, CA},
booktitle = {The Mathematical Gardner},
}
@incollection{Guy1983,
author = {R. K. Guy},
year = 1983,
title = {Graphs and games},
pages = {269-295},
editor = {L. W. Beineke and R. J. Wilson},
volume = 2,
publisher = {Academic Press, London},
booktitle = {Selected Topics in Graph Theory},
}
@article{Guy1986,
author = {R. K. Guy},
year = 1986,
title = {John Isbell's game of beanstalk and John Conway's game of
beans-don't-talk},
journal = {Math. Mag.},
volume = 59,
pages = {259-269},
}
@book{Guy1989,
author = {R. K. Guy},
year = 1989,
title = {Fair Game},
series = {COMAP Math. Exploration Series},
publisher = {Arlington, MA},
}
@article{Guy1990,
author = {R. K. Guy},
year = 1990,
title = {A guessing game of Bill Sands, and Bernardo Recam\'an's Barranca},
journal = {Amer. Math. Monthly},
volume = 97,
pages = {314-315},
}
@incollection{Guy1991,
author = {R. K. Guy},
year = 1991,
title = {Mathematics from fun \& fun from mathematics; an informal
autobiographical history of combinatorial games},
pages = {287-295},
editor = {J. H. Ewing and F. W. Gehring},
publisher = {Springer Verlag, New York, NY},
booktitle = {Paul Halmos: Celebrating 50 Years of Mathematics},
}
@incollection{Guy1995,
author = {R. K. Guy},
year = 1995,
title = {Combinatorial games},
pages = {2117-2162},
editor = {R. L. Graham and M. Gr\"otschel and L. Lov\'asz},
publisher = {North-Holland, Amsterdam},
volume = {II},
booktitle = {Handbook of Combinatorics,},
}
@incollection{Guy1996a,
author = {R. K. Guy},
year = 1996,
title = {Impartial Games},
editor = {R. J. Nowa\-kowski},
pages = {61-78},
publisher = {Cambridge University Press, Cambridge},
note = {earlier version in: {\it Combinatorial Games}, Proc. Symp.
Appl. Math. (R. K. Guy, ed.), Vol. 43, Amer. Math. Soc., Providence,
RI, 1991, pp. 35--55},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}
@incollection{Guy1996b,
author = {R. K. Guy},
year = 1996,
title = {What is a game?},
editor = {R. J. Nowakowski},
pages = {43-60},
publisher = {Cambridge University Press, Cambridge},
note = {earlier version in: {\it Combinatorial Games}, Proc. Symp.
Appl. Math. (R. K. Guy, ed.), Vol. 43, Amer. Math. Soc., Providence, RI,
1991, pp. 1--21},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}
@incollection{Guy1996c,
author = {R. K. Guy},
year = 1996,
title = {Unsolved problems in combinatorial games},
editor = {R. J. Nowakowski},
pages = {475-491},
publisher = {Cambridge University Press, Cambridge},
note = {update with 52 problems of earlier version with 37 problems, in:
{\it Combinatorial Games}, Proc. Symp. Appl. Math. (R. K. Guy, ed.),
Vol. 43, Amer. Math. Soc., Providence, RI, 1991, pp. 183--189},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}
@article{Guy2007,
author = {R. K. Guy},
year = 2007,
title = {A parity subtraction game},
journal = {Crux Math.},
volume = {33},
pages = {37--39},
}
@incollection{GuNo1993,
author = {R. K. Guy and R. J. Nowakowski},
year = 1993,
title = {Mousetrap},
pages = {193-206},
editor = {},
publisher = {Bolyai Soc. Math. Stud., J\'{a}nos Bolyai Math. Soc., Budapest},
volume = {1},
booktitle = {Combinatorics, Paul Erd\"{o}s is eighty},
}
@incollection{GuNo2002,
author = {R. K. Guy and R. J. Nowakowski},
year = 2002,
title = {Unsolved problems in combinatorial games},
pages = {457-473},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
}
@article{GNCG1999,
author = {R. K. Guy and R. J. Nowakowski and I. Caines and C. Gates},
year = 1999,
title = {Unsolved Problems: periods in taking and splitting games},
journal = {Amer. Math. Monthly},
volume = 106,
pages = {359--361},
note = {Unsolved Problems Section},
}
@article{GuSm1956,
author = {R. K. Guy and C. A. B. Smith},
year = 1956,
title = {The $G$-values of various games},
journal = {Proc. Camb. Phil. Soc.},
volume = 52,
pages = {514-526},
}
@proceedings{GuWo1994,
editor = {R. K. Guy and R. E. Woodrow},
year = 1994,
title = {The Lighter Side of Mathematics, \emph{Proc. E. Strens
Memorial Conf. on Recr. Math. and its History, Calgary, 1986, Spectrum
Series}},
organization = {Math. Assoc. Amer., Washington, DC},
}
@article{Guz1990,
author = {W. Guzicki},
year = 1990,
title = {Ulam's searching game with two lies},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 54,
pages = {1-19},
}
@article{HLSW2002,
author = {G. Hahn and F. Laviolette and N. Sauer and R. E. Woodrow},
year = 2002,
title = {On cop-win graphs},
journal = {Discrete Math.},
volume = 258,
pages = {27-41},
mrnumber = {MR2002070 (2004f:05156)},
}
@article {HaMG2006,
AUTHOR = {Hahn, Ge{\v{n}}a and MacGillivray, Gary},
TITLE = {A note on {$k$}-cop, {$l$}-robber games on graphs},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {306},
YEAR = {2006},
NUMBER = {19-20},
PAGES = {2492--2497},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05C20},
MRNUMBER = {MR2261915 (2007d:05069)},
}
@article{HaNa1984,
author = {A. Hajnal and Zs. Nagy},
title = {Ramsey games},
journal = {Trans. American Math. Soc.},
year = 1984,
volume = 284,
pages = {815-827},
}
@article{Hal1983,
author = {D. R. Hale},
year = 1983,
title = {A variant of Nim and a function defined by Fibonacci representation},
journal = {Fibonacci Quart.},
volume = 21,
pages = {139-142},
}
@article{HaJe1963,
author = {A. W. Hales and R. I. Jewett},
year = 1963,
title = {Regularity and positional games},
journal = {Trans. Amer. Math. Soc.},
volume = 106,
pages = {222-229},
}
@article{HaSm1992,
author = {L. Halpenny and C. Smyth},
year = 1992,
title = {A classification of minimal standard-path $2\times 2$ switching networks},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 102,
pages = {329-354},
}
@article {HS-P2007,
AUTHOR = {Halupczok, Immanuel and Schlage-Puchta, Jan-Christoph},
TITLE = {Achieving snaky},
JOURNAL = {Integers, Electr. J. of Combinat. Number Theory},
FJOURNAL = {Integers. Electronic Journal of Combinatorial Number Theory},
VOLUME = {7},
YEAR = {2007},
PAGES = {\#G02, 28 pp.},
url = {http://www.integers-ejcnt.org/vol7.html},
ISSN = {1553-1732},
MRCLASS = {05B50 (91A46)},
MRNUMBER = {MR2282185 (2007i:05045)},
}
@article {HS-P2008,
AUTHOR = {Halupczok, Immanuel and Schlage-Puchta, Jan-Christoph},
TITLE = {Some strategies for higher dimensional animal achievement games},
JOURNAL = {Discrete Math.},
VOLUME = {308},
YEAR = {2008},
PAGES = {3470-3478},
mrnumber = {**MR pending},
}
@article{Ham1987,
author = {Y. O. Hamidoune},
year = 1987,
title = {On a pursuit game of Cayley digraphs},
journal = {Europ. J. Combin.},
volume = 8,
pages = {289-295},
}
@incollection{HaLa1985,
author = {Y. O. Hamidoune and Las Vergnas, M.},
year = 1985,
title = {The directed Shannon switching game and the one-way game},
pages = {391-400},
editor = {Y. Alavi and others},
publisher = {Wiley},
booktitle = {Graph Theory with Applications to Algorithms and
Computer Science},
}
@article{HaLa1986,
author = {Y. O. Hamidoune and Las Vergnas, M.},
year = 1986,
title = {Directed switching games on graphs and matroids},
journal = {J. Combin. Theory \emph{(Ser.~B)}},
volume = 40,
pages = {237-269},
}
@article{HaLa1987,
author = {Y. O. Hamidoune and Las Vergnas, M.},
year = 1987,
title = {A solution to the box game},
journal = {Discrete Math.},
volume = 65,
pages = {157-171},
}
@article{HaLa1988,
author = {Y. O. Hamidoune and Las Vergnas, M.},
year = 1988,
title = {A solution to the mis\`ere Shannon switching game},
journal = {Discrete Math.},
volume = 72,
pages = {163-166},
}
@article{Han1959,
author = {O. Hanner},
year = 1959,
title = {Mean play of sums of positional games},
journal = {Pacific J. Math.},
volume = 9,
pages = {81-99},
}
@article{Har1982,
author = {F. Harary},
year = 1982,
title = {Achievement and avoidance games for graphs},
journal = {Ann. Discrete Math.},
volume = 13,
pages = {111-119},
}
@article{Har2002,
author = {F. Harary},
year = 2002,
title = {Sum-free games},
journal = {{\rm in:} Puzzler's Tribute: a Feast for the Mind{\rm ,}},
chapter = {},
pages = {395-398},
note = {honoring Martin Gardner (D. Wolfe and T. Rodgers, eds.),
A K Peters, Natick, MA},
publisher = {},
}
@article{HaHa2000,
author = {F. Harary and H. Harborth and M. Seemann},
year = 2000,
title = {Handicap achievement for polyominoes},
journal = {Congr. Numer.},
volume = 145,
pages = {65-80},
note = {Proc. 31st Southeastern Internat. Conf. on Combinatorics,
Graph Theory, and Computing (Boca Raton, FL, 1999)},
mrnumber = {MR1817942 (2001m:05083)},
}
@article{HaPl1987,
author = {F. Harary and K. Plochinski},
year = 1987,
title = {On degree achievement and avoidance games for graphs},
journal = {Math. Mag.},
volume = 60,
pages = {316-321},
}
@article{HSW1985,
author = {F. Harary and B. Sagan and D. West},
year = 1985,
title = {Computer-aided analysis of monotonic sequence games},
journal = {Atti Accad. Peloritana Pericolanti Cl. Sci. Fis. Mat. Natur.},
volume = 61,
pages = {67-78},
}
@incollection{HSV2002,
author = {F. Harary and W. Slany and O. Verbitsky},
year = 2002,
title = {A symmetric strategy in graph avoidance games},
pages = {369-381},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = 42,
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1973105 (2004b:91036)},
}
@article{HSV2004,
author = {F. Harary and W. Slany and O. Verbitsky},
year = 2004,
title = {On the length of symmetry breaking-preserving games on graphs},
journal = {Theoret. Comp. Sci.},
volume = {313},
pages = {427-446},
note = {special issue of Dagstuhl Seminar ``Algorithmic Combinatorial
Game Theory", Feb. 2002},
mrnumber = {MR2056937 (2005a:91025)},
}
@article{HaSe1996,
author = {H. Harborth and M. Seemann},
year = 1996,
title = {Snaky is an edge-to-edge loser},
journal = {Geombinatorics},
volume = 5,
pages = {132-136},
mrnumber = {MR1380142},
}
@article{HaSe1997,
author = {H. Harborth and M. Seemann},
year = 1997,
title = {Snaky is a paving winner},
journal = {Bull. Inst. Combin. Appl.},
volume = 19,
pages = {71-78},
mrnumber = {MR1427578 (97g:05052)},
}
@article{HaSe2003,
author = {H. Harborth and M. Seemann},
year = 2003,
title = {Handicap achievement for squares},
journal = {J. Combin. Math. Combin. Comput.},
volume = 46,
pages = {47-52},
note = {15th MCCCC (Las Vegas, NV, 2001)},
mrnumber = {MR2004838 (2004g:05044)},
}
@article{Hay1977,
author = {P. J. Hayes},
year = 1977,
title = {A note on the towers of Hanoi problem},
journal = {Computer J.},
volume = 20,
pages = {282-285},
}
@incollection{Hay2008,
author = {R. B. Hayward},
year = 2008,
title = {A puzzling Hex primer},
pages = {},
editor = {M. H. Albert and R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {},
booktitle = {Games of No Chance III, \emph{Proc. BIRS Workshop on
Combinatorial Games, July, 2005, Banff, Alberta, Canada, MSRI Publ.}},
}
@article {MR2184213,
AUTHOR = {Hayward, Ryan and Bj{\"o}rnsson, Yngvi and Johanson, Michael
and Kan, Morgan and Po, Nathan and van Rijswijck, Jack},
TITLE = {Solving {$7\times7$} {H}ex with domination, fill-in, and
virtual connections},
JOURNAL = {Theoret. Comput. Sci.},
FJOURNAL = {Theoretical Computer Science},
VOLUME = {349},
YEAR = {2005},
NUMBER = {2},
PAGES = {123--139},
ISSN = {0304-3975},
CODEN = {TCSDI},
MRCLASS = {68T20 (91A43)},
MRNUMBER = {MR2184213 (2006f:68112)},
}
@article {HaRi2006,
AUTHOR = {Hayward, Ryan B. and van Rijswijck, Jack},
TITLE = {Hex and combinatorics},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
note = {special issue: Creation and Recreation: A Tribute to the
Memory of Claude Berge},
VOLUME = {306},
YEAR = {2006},
NUMBER = {19-20},
PAGES = {2515--2528},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {91A46 (00A08)},
MRNUMBER = {MR2261917 (2007e:91045)},
MRREVIEWER = {Anthony A. Mendes},
}
@article {MR1936946,
AUTHOR = {He, Wenjie and Hou, Xiaoling and Lih, Ko-Wei and Shao, Jiating
and Wang, Weifan and Zhu, Xuding},
TITLE = {Edge-partitions of planar graphs and their game coloring
numbers},
JOURNAL = {J. Graph Theory},
FJOURNAL = {Journal of Graph Theory},
VOLUME = {41},
YEAR = {2002},
NUMBER = {4},
PAGES = {307--317},
ISSN = {0364-9024},
CODEN = {JGTHDO},
MRCLASS = {05C70 (05C15)},
MRNUMBER = {MR1936946 (2003h:05153)},
MRREVIEWER = {Mike Daven},
}
@article{HWZ2004,
author = {W. He and J. Wu and X. Zhu},
year = 2004,
title = {Relaxed game chromatic number of trees and outerplanar graphs},
journal = {Discrete Math.},
volume = 281,
pages = {209-219},
mrnumber = {MR2047768 (2005a:05088)},
}
@article{Hea2005,
author = {R. A. Hearn},
year = 2005,
title = {The complexity of sliding block puzzles and plank puzzles},
journal = {{\rm in:} Tribute to a Mathemagician{\rm ,}},
chapter = {},
pages = {173-183},
note = {honoring Martin Gardner (B. Cipra, E. D. Demaine,
M. L. Demaine and T. Rodgers, eds.),
A K Peters, Wellesley, MA, pp. 93-99.},
publisher = {},
}
@article{Hea2006,
author = {R. A. Hearn},
year = 2006,
title = {TipOver is NP-complete},
journal = {Math. Intelligencer},
volume = 28,
note = {Number 3, Summer 2006},
pages = {10-14},
}
@incollection{Hea2008,
author = {R. A. Hearn},
year = 2008,
title = {Amazons, Konane, and Cross Purposes are PSPACE-complete},
pages = {},
editor = {M. H. Albert and R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {},
booktitle = {Games of No Chance III, \emph{Proc. BIRS Workshop on
Combinatorial Games, July, 2005, Banff, Alberta, Canada, MSRI Publ.}},
}
@incollection {MR2062475,
AUTHOR = {Hearn, Robert A. and Demaine, Erik D.},
TITLE = {The nondeterministic constraint logic model of computation:
reductions and applications},
BOOKTITLE = {Automata, Languages and Programming},
SERIES = {Lecture Notes in Comput. Sci.},
VOLUME = {2380},
PAGES = {401--413},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {2002},
MRCLASS = {68Q05 (68Q17 68U05)},
MRNUMBER = {MR2062475},
}
@article{HeDe2005,
author = {R. A. Hearn and E. D. Demaine},
year = 2005,
title = {PSPACE-completeness of sliding-block puzzles and other
problems through the nondeterministic constraint logic model of computation},
journal = {Theoret. Comput. Sci.},
volume = 343,
note = {special issue: Game Theory Meets Theoretical Computer Science},
pages = {72-96},
mrnumber = {MR2168845 (2006d:68070)},
}
@article{Hed1992,
author = {O. Heden},
year = 1992,
title = {On the modular $n$-queen problem},
journal = {Discrete Math.},
volume = 102,
pages = {155-161},
}
@article{Hed1993,
author = {O. Heden},
year = 1993,
title = {Maximal partial spreads and the modular $n$-queen problem},
journal = {Discrete Math.},
volume = 120,
pages = {75-91},
}
@article{Hed1995,
author = {O. Heden},
year = 1995,
title = {Maximal partial spreads and the modular $n$-queen problem II},
journal = {Discrete Math.},
volume = 142,
pages = {97-106},
}
@article{HHB1982,
author = {S. M. Hedetniemi and S. Hedetniemi and T. Beyer},
year = 1982,
title = {A linear algorithm for the Grundy (coloring) number of a tree},
journal = {Congr. Numer.},
volume = 36,
pages = {351-363},
}
@incollection{HHR1998,
author = {S. M. Hedetniemi and S. T. Hedetniemi and R. Reynolds},
year = 1998,
title = {Combinatorial problems on chessboards, II},
pages = {133-162},
editor = {{T. W. Haynes et al.}},
publisher = {M. Dekker, NY},
booktitle = {Domination in Graphs},
}
@article {MR2333136,
AUTHOR = {Hefetz, Dan and Krivelevich, Michael and Szab{\'o}, Tibor},
TITLE = {Avoider-enforcer games},
JOURNAL = {J. Combin. Theory Ser. A},
FJOURNAL = {Journal of Combinatorial Theory. Series A},
VOLUME = {114},
YEAR = {2007},
NUMBER = {5},
PAGES = {840--853},
ISSN = {0097-3165},
CODEN = {JCBTA7},
MRCLASS = {05C65 (91Axx)},
MRNUMBER = {MR2333136},
}
@article{HeLa2006,
author = {P. Hegarty and U. Larsson},
year = 2006,
title = {Permutations of the natural numbers with prescribed difference multisets},
journal = {Integers, Electr. J. of Combinat. Number Theory},
volume = 6,
pages = {\#A03, 25 pp.},
url = {http://www.integers-ejcnt.org/vol6.html},
}
@article{Hei1942,
author = {P. Hein},
year = 1942,
title = {Vil de lre Polygon?},
journal = {Politiken \emph{(description of Hex in this Danish
newspaper of Dec. 26)}},
}
@article{Hen1988,
author = {D. Hensley},
year = 1988,
title = {A winning strategy at Taxman},
journal = {Fibonacci Quart.},
volume = 26,
pages = {262-270},
}
@article{Hen1970,
author = {C. W. Henson},
year = 1970,
title = {Winning strategies for the ideal game},
journal = {Amer. Math. Monthly},
volume = 77,
pages = {836-840},
}
@article{DBLP:journals/compsec/Hernandez-CastroBER06,
author = {Julio C{\'e}sar Hern{\'a}ndez-Castro and
Ignacio Blasco-Lopez and
Juan M. Est{\'e}vez-Tapiador and
Arturo Ribagorda-Garnacho},
title = {Steganography in games: A general methodology and its application
to the game of Go.},
journal = {Computers {\&} Security},
volume = {25},
year = {2006},
pages = {64-71},
ee = {http://dx.doi.org/10.1016/j.cose.2005.12.001},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{Hes1999,
author = {R. I. Hess},
year = 1999,
title = {Puzzles from around the world},
journal = {{\rm in:} The Mathemagician and Pied Puzzler{\rm ,}},
chapter = {},
pages = {},
note = {honoring Martin Gardner; E. Berlekamp and T. Rodgers, eds.,
A K Peters, Natick, MA, pp. 53-84},
publisher = {},
}
@article{Heu1982,
author = {G. A. Heuer},
year = 1982,
title = {Odds versus evens in Silverman-type games},
journal = {Internat. J. Game Theory},
volume = 11,
pages = {183-194},
}
@article{Heu1989,
author = {G. A. Heuer},
year = 1989,
title = {Reduction of Silverman-like games to games on boun\-ded sets},
journal = {Internat. J. Game Theory},
volume = 18,
pages = {31-36},
}
@article{Heu2001,
author = {G. A. Heuer},
year = 2001,
title = {Three-part partition games on rectangles},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 259,
pages = {639-661},
}
@book{HeLe1995,
author = {G. A. Heuer and U. Leopold-Wildburger},
year = 1995,
title = {Silverman's game, A special class of two-person zero-sum
games, \emph{with a foreword by Reinhard Selten}},
series = {\emph{Lecture Notes in Economics and Mathematical Systems}},
volume = 424,
publisher = {Springer-Verlag, Berlin},
}
@article{HeRi1988,
author = {G. A. Heuer and W. D. Rieder},
year = 1988,
title = {Silverman games on disjoint discrete sets},
journal = {SIAM J. Disc. Math.},
volume = 1,
pages = {485-525},
}
@incollection{Hil1995,
author = {R. Hill},
year = 1995,
title = {Searching with lies},
pages = {41-70},
editor = {},
publisher = {Cambridge University Press, Cambridge},
volume = {218},
booktitle = {Surveys in Combinatorics},
}
@article{HiKa1992,
author = {R. Hill and J. P. Karim},
year = 1992,
title = {Searching with lies: the Ulam problem},
journal = {Discrete Math.},
volume = {106/107},
pages = {273-283},
}
@article{HiKr1991,
author = {T. P. Hill and U. Krengel},
year = 1991,
title = {Minimax-optimal stop rules and distributions in secretary problems},
journal = {Ann. Probab.},
volume = 19,
pages = {342-353},
}
@article{HiKr1992,
author = {T. P. Hill and U. Krengel},
year = 1992,
title = {On the game of Googol},
journal = {Internat. J. Game Theory},
volume = 21,
pages = {151-160},
}
@article{Hin1972,
author = {P. G. Hinman},
year = 1972,
title = {Finite termination games with tie},
journal = {Israel J. Math.},
volume = 12,
pages = {17-22},
}
@article{Hin1989,
author = {A. M. Hinz},
year = 1989,
title = {An iterative algorithm for the tower of Hanoi with four pegs},
journal = {Computing},
volume = 42,
pages = {133-140},
}
@article{Hin1989a,
author = {A. M. Hinz},
year = 1989,
title = {The tower of Hanoi},
journal = {Enseign. Math.},
volume = 35,
pages = {289-321},
}
@article{Hin1992,
author = {A. M. Hinz},
year = 1992,
title = {Pascal's triangle and the tower of Hanoi},
journal = {Amer. Math. Monthly},
volume = 99,
pages = {538-544},
}
@article{Hin1992a,
author = {A. M. Hinz},
year = 1992,
title = {Shortest paths between regular states of the tower of Hanoi},
journal = {Inform. Sci.},
volume = 63,
pages = {173-181},
}
@inproceedings{Hin1999,
author = {A. M. Hinz},
year = 1999,
title = {The tower of Hanoi},
booktitle = {Algebras and Combinatorics},
editor = {K. P. Shum and E. J. Taft and Z. X. Wan},
volume = {},
pages = {277-289},
publisher = {Springer, Singapore},
}
@article{HiPa2002,
author = {A. M. Hinz and D. Parisse},
year = 2002,
title = {On the planarity of Hanoi graphs},
journal = {Expo. Math.},
volume = 20,
pages = {263--268},
mrnumber = {MR1924112 (2003f:05034)},
}
@book{Hit1968a,
author = {S. Hitotumatu},
year = 1968,
title = {Sin Ishi tori g\=emu no s\=uri $[$The Theory of Nim-Like Games$]$},
publisher = {Morikita Publishing Co., Tokyo},
note = {(Japanese)}
}
@article{Hit1968b,
author = {S. Hitotumatu},
year = 1968,
title = {Some remarks on nim-like games},
journal = {Comment. Math. Univ. St. Paul},
volume = 17,
pages = {85-98},
}
@article{HoJo1999,
author = {D. G. Hoffman and P. D. Johnson},
year = 1999,
title = {Greedy colorings and the Grundy chromatic number of the $n$-cube},
journal = {Bull. Inst. Combin. Appl.},
volume = 26,
pages = {49-57},
}
@article{HLM1969,
author = {E. J. Hoffman and J. C. Loessi and R. C. Moore},
year = 1969,
title = {Construction for the solution of the $n$-queens problem},
journal = {Math. Mag.},
volume = 42,
pages = {66-72},
}
@article{HoHo2003,
author = {M. S. Hogan and D. G. Horrocks},
year = 2003,
title = {Geography played on an N-cycle times a 4-cycle},
journal = {Integers, Electr. J. of Combinat. Number Theory},
volume = 3,
pages = {\#G2, 12 pp., Comb. Games Sect.},
url = {http://www.integers-ejcnt.org/vol3.html},
mrnumber = {MR1985672 (2004b:91037)},
}
@article{Hol1957,
author = {J. C. Holladay},
year = 1957,
title = {Cartesian products of termination games},
journal = {Ann. of Math. Stud. \emph{(Contributions to the Theory of
Games), Princeton}},
volume = 3,
number = 39,
pages = {189-200},
}
@article{Hol1958,
author = {J. C. Holladay},
year = 1958,
title = {Matrix nim},
journal = {Amer. Math. Monthly},
volume = 65,
pages = {107-109},
}
@article{Hol1966,
author = {J. C. Holladay},
year = 1966,
title = {A note on the game of dots},
journal = {Amer. Math. Monthly},
volume = 73,
pages = {717-720},
}
@article{HoRe2001,
author = {A. Holshouser and H. Reiter},
year = 2001,
title = {A generalization of Beatty's Theorem},
journal = {Southwest J. Pure and Appl. Math.,},
volume = {{\rm issue 2}},
pages = {24-29}
}
@article{HRR2004,
author = {A. Holshouser and H. Reiter and J. Rudzinski},
year = 2004,
title = {Pilesize dynamic one-pile Nim and Beatty's theorem},
journal = {Integers, Electr. J. of Combinat. Number Theory},
volume = {4},
pages = {\#G3, 13 pp., Comb. Games Sect.},
url = {http://www.integers-ejcnt.org/vol4.html},
mrnumber = {MR2079848},
}
@article {MR2098189,
AUTHOR = {Holzer, Markus and Holzer, Waltraud},
TITLE = {{${\rm T}ANTRIX\sp {\rm TM}$} rotation puzzles are
intractable},
JOURNAL = {Discrete Appl. Math.},
FJOURNAL = {Discrete Applied Mathematics. The Journal of Combinatorial
Algorithms, Informatics and Computational Sciences},
VOLUME = {144},
YEAR = {2004},
PAGES = {345--358},
ISSN = {0166-218X},
CODEN = {DAMADU},
MRCLASS = {94C10 (68Q17)},
MRNUMBER = {MR2098189 (2005j:94043)},
MRREVIEWER = {Bruce Edward Litow},
}
@article{HoSc2004,
author = {M. Holzer and S. Schwoon},
year = 2004,
title = {Assembling molecules in ATOMIX is hard},
journal = {Theoret. Comp. Sci.},
volume = {313},
pages = {447-462},
note = {special issue of Dagstuhl Seminar ``Algorithmic Combinatorial
Game Theory'', Feb. 2002},
mrnumber = {MR2056938},
}
@article{HSS1984,
author = {J. E. Hopcroft and J. T. Schwartz and M. Sharir},
year = 1984,
title = {On the complexity of motion planning for multiple independent
objects: PSPACE-hardness of the "Warehouseman's problem"},
journal = {J. Robot. Res.},
volume = {3 {\rm issue 4}},
pages = {76-88},
}
@inbook{HoSe2007,
author = {B. Hopkins and J. A. Sellers},
year = 2007,
title = {Exact enumeration of Garden of Eden partitions},
publisher = {de Gruyter},
pages = {299-303},
note = {Proc.\ Integers Conference, Carrollton, Georgia, October 27-30,2005,
in celebration of the 70th birthday of Ronald Graham. B.\ Landman,
M.\ Nathanson, J.\ Ne\v{s}et\v{r}il, R.\ Nowakowski, C. Pomerance eds.,
appeared also in {\it Integers, Electr.\ J.\ of Combinat.\ Number Theory\/} {\bf 7(20)},
special volume in honor of Ron Graham, \#A19, 5 pp.},
url = {http://www.integers-ejcnt.org/vol7(2).html},
MRNUMBER = {MR2337053},
}
@book{Hor1986,
author = {E. Hordern},
year = 1986,
title = {Sliding Piece Puzzles},
publisher = {Oxford University Press, Oxford},
}
@article{HoNo2003,
author = {D. G. Horrocks and R. J. Nowakowski},
year = 2003,
title = {Regularity in the ${\cal G}-$ sequences of octal games with a pass},
journal = {Integers, Electr. J. of Combinat. Number Theory},
volume = 3,
pages = {\#G1, 10 pp., Comb. Games Sect.},
url = {http://www.integers-ejcnt.org/vol3.html},
mrnumber = {MR1985671 (2004d:91049)},
}
@article{HoTr2008,
author = {D. G. Horrocks and M. A. Trenton},
year = 2008,
title = {Subtraction with a Muller twist},
journal = {Integers, Electr. J. of Combinat. Number Theory},
volume = 8,
pages = {\#G05, 12 pp., Comb. Games Sect.},
url = {http://www.integers-ejcnt.org/vol8.html},
mrnumber = {**MR pending},
}
@article{HoNo2004,
author = {S. Howse and R. J. Nowakoski},
year = 2004,
title = {Periodicity and arithmetic-periodicity in hexadecimal games},
journal = {Theoret. Comp. Sci.},
volume = {313},
pages = {463-472},
note = {special issue of Dagstuhl Seminar ``Algorithmic Combinatorial
Game Theory'', Feb. 2002},
mrnumber = {MR2056939 (2005f:91037)},
}
@article {MR2356244,
AUTHOR = {Hsieh, Ming Yu and Tsai, Shi-Chun},
TITLE = {On the fairness and complexity of generalized {$k$}-in-a-row
games},
JOURNAL = {Theoret. Comput. Sci.},
FJOURNAL = {Theoretical Computer Science},
VOLUME = {385},
YEAR = {2007},
PAGES = {88--100},
ISSN = {0304-3975},
CODEN = {TCSDI},
MRCLASS = {68Q17 (91A46)},
MRNUMBER = {MR2356244},
}
@incollection{HuSh2002,
author = {S. Huddleston and J. Shurman},
year = 2002,
title = {Transfinite Chomp},
pages = {183-212},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1973013 (2004b:91046)},
}
@article{HuKr2008,
author = {P. Hunter and S. Kreutzer},
year = 2008,
title = {Digraph measures: Kelly decompositions, games, and orderings},
journal = {Theoret. Comput. Sci.},
volume = 399,
pages = {206-219},
mrnumber = {**MR pending},
}
@article{Hur1998,
author = {G. H. Hurlbert},
year = 1998,
title = {Two pebbling theorems},
journal = {Congr. Numer.},
volume = {135},
pages = {55-63},
note = {Proc. 29-th Southeastern Internat. Conf. on Combinatorics,
Graph Theory, and Computing (Boca Raton, FL, 1998).},
}
@article{Hur1999,
author = {G. H. Hurlbert},
year = 1999,
title = {A survey of graph pebbling},
journal = {Congr. Numer.},
volume = {139},
pages = {41-64},
note = {Proc. 30-th Southeastern Internat. Conf. on Combinatorics,
Graph Theory, and Computing (Boca Raton, FL, 1999).},
}
@article{IbTa2003,
author = {G. Iba and J. Tanton},
year = 2003,
title = {Candy sharing},
journal = {Amer. Math. Monthly},
volume = 110,
pages = {25-35},
mrnumber = {MR1952745},
}
@article {Igu1985,
AUTHOR = {Igusa, Kiyoshi},
TITLE = {Solution of the {B}ulgarian solitaire conjecture},
JOURNAL = {Math. Mag.},
FJOURNAL = {Mathematics Magazine},
VOLUME = {58},
YEAR = {1985},
NUMBER = {5},
PAGES = {259--271},
ISSN = {0025-570X},
CODEN = {MAMGA8},
MRCLASS = {00A08 (90D99)},
MRNUMBER = {MR810147 (87c:00003)},
MRREVIEWER = {G. A. Heuer},
}
@article{Isb1992,
author = {J. Isbell},
year = 1992,
title = {The Gordon game of a finite group},
journal = {Amer. Math. Monthly},
volume = 99,
pages = {567-569},
}
@article {MR2257242,
AUTHOR = {Isler, Volkan and Kannan, Sampath and Khanna, Sanjeev},
TITLE = {Randomized pursuit-evasion with local visibility},
JOURNAL = {SIAM J. Discrete Math.},
FJOURNAL = {SIAM Journal on Discrete Mathematics},
VOLUME = {20},
YEAR = {2006},
PAGES = {26--41 (electronic)},
ISSN = {0895-4801},
MRCLASS = {91A43 (49N75 91A24)},
MRNUMBER = {MR2257242 (2007h:91038)},
MRREVIEWER = {Vincent J. Vannetelbosch},
}
@article{IsKa2008,
author = {V. Isler and N. Karnad},
year = 2008,
title = {The role of information in the cop-robber game},
journal = {Theoret. Comput. Sci.},
volume = 399,
pages = {179-190},
mrnumber = {**MR pending},
}
@article {MR2320636,
AUTHOR = {Ito, Hiro and Nakamura, Gisaku and Takata, Satoshi},
TITLE = {Winning ways of weighted poset games},
JOURNAL = {Graphs Combin.},
FJOURNAL = {Graphs and Combinatorics},
VOLUME = {23},
YEAR = {2007},
NUMBER = {suppl. 1},
PAGES = {291--306},
ISSN = {0911-0119},
CODEN = {GRCOE5},
MRCLASS = {91A46 (05C38 91A43)},
MRNUMBER = {MR2320636},
MRREVIEWER = {Kimmo Eriksson},
}
@article{Itz1977,
author = {O. Itzinger},
year = 1977,
title = {The South American game},
journal = {Math. Mag.},
volume = 50,
pages = {17-21},
}
@article{IwKa1994,
author = {S. Iwata and T. Kasai},
year = 1994,
title = {The Othello game on an $n\times n$ board is PSPACE-complete},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 123,
pages = {329-340},
}
@book{Jae1862,
author = {C. F. A. Jaenisch},
year = 1862,
title = {Trait\'{e} des Applications de l'Analyse math\'{e}\-ma\-tiques
au Jeu des Echecs},
publisher = {Petrograd},
note = {three volumes (Carl Friedrich Andreyevich Jaenisch from St
Petersburg [changed its name to Petrograd, then to Leningrad, and then
back to St Petersburg] is also known by his cyrillic transliteration
"Yanich", or in the French form: de J, or German form: von J)}
}
@article {JaSc2008,
AUTHOR = {J. James and M. Schlatter},
TITLE = {Some observations and solutions to short and long global Nim},
JOURNAL = {Integers, Electr. J. of Combinat. Number Theory},
FJOURNAL = {Integers. Electronic Journal of Combinatorial Number Theory},
VOLUME = {8},
YEAR = {2008},
PAGES = {\#G01, 14 pp.},
url = {http://www.integers-ejcnt.org/vol8.html},
mrnumber = {**MR pending},
}
@article{JeSe1995,
author = {J. Jeffs and S. Seager},
year = 1995,
title = {The chip firing game on $n$-cycles},
journal = {Graphs Combin.},
volume = 11,
pages = {59-67},
}
@article{JeMa1980,
author = {T. A. Jenkyns and J. P. Mayberry},
year = 1980,
title = {The skeleton of an impartial game and the Nim-function of
Moore's ${\hbox{Nim}}_k$},
journal = {Internat. J. Game Theory},
volume = 9,
pages = {51-63},
}
@book{JeTo1995,
author = {T. R. Jensen and B. Toft},
year = 1995,
title = {Graph Coloring Problems},
publisher = {Wiley-Inter\-science Series in Discrete Mathematics and
Optimization, Wiley, New York, NY},
}
@incollection{JiNi2008,
author = {L. Y. Jin and J. Nievergelt},
year = 2008,
title = {Tigers and Goats is a draw},
pages = {},
editor = {M. H. Albert and R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {},
booktitle = {Games of No Chance III, \emph{Proc. BIRS Workshop on
Combinatorial Games, July, 2005, Banff, Alberta, Canada, MSRI Publ.}},
}
@article{Joh1983,
author = {D. S. Johnson},
year = 1983,
title = {The NP-Completeness Column: An Ongoing Guide},
journal = {J. Algorithms},
volume = 4,
pages = {397-411},
note = {9th quarterly column (games); the column started in 1981; a
further games update appeared in vol. {\bf 5}, 10th column, pp. 154-155},
}
@article{Joh1879,
author = {W. W. Johnson},
year = 1879,
title = {Notes on the "15" puzzle},
journal = {Amer. J. Math.},
volume = 2,
pages = {397-399},
}
@article{Jon1982,
author = {J. P. Jones},
year = 1982,
title = {Some undecidable determined games},
journal = {Internat. J. Game Theory},
volume = 11,
pages = {63-70},
}
@article{JoFr1995,
author = {J. P. Jones and A. S. Fraenkel},
year = 1995,
title = {Complexities of winning strategies in diophantine games},
journal = {J. Complexity},
volume = 11,
pages = {435-455},
}
@article{Joy2006,
author = {D. Joyner},
year = 2006,
title = {Mathematics of Ghaly's machine},
journal = {Integers, Electr. J. of Combinat. Number Theory},
volume = 6,
pages = {\#G01, 27 pp., Comb. Games Sect.},
url = {http://www.integers-ejcnt.org/vol6.html},
}
@article{Kac1974,
author = {M. Kac},
year = 1974,
title = {Hugo Steinhaus, a reminiscence and a tribute},
journal = {Amer. Math. Monthly},
volume = 81,
pages = {572-581 (p.~577)},
}
@article{KaFr1987,
author = {J. Kahane and A. S. Fraenkel },
year = 1987,
title = {$k$-Welter --- a generalization of Welter's game},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 46,
pages = {1-20},
}
@article{KaRy2001,
author = {J. Kahane and A. J. Ryba},
year = 2001,
title = {The Hexad game},
journal = {Electr. J. Combin.},
volume = {8(2)},
pages = {\#R11, 9 pp.},
url = {http://www.combinatorics.org/},
note = {Volume in honor of Aviezri S. Fraenkel},
mrnumber = {MR1853262 (2002h:91031)},
}
@article{KLW1987,
author = {J. Kahn and J. C. Lagarias and H. S. Witsenhausen},
year = 1987,
title = {Single-suit two-person card play},
journal = {Internat. J. Game Theory},
volume = 16,
pages = {291-320},
mrnumber = {MR0918819 (88m:90162)},
}
@article{KLW1988,
author = {J. Kahn and J. C. Lagarias and H. S. Witsenhausen},
year = 1988,
title = {Single-suit two-person card play, II.~Dominance},
journal = {Order},
volume = 5,
pages = {45-60},
mrnumber = {MR0953941 (89j:90279)},
}
@incollection{KLW1989a,
author = {J. Kahn and J. C. Lagarias and H. S. Witsenhausen},
year = 1989,
title = {On Lasker's card game},
editor = {T. S. Ba\c{s}ar and P. Bernhard},
pages = {1-8},
publisher = {Springer Verlag, Berlin},
volume = 119,
booktitle = {Differential Games and Applications, \emph{Lecture Notes in
Control and Information Sciences}},
mrnumber = {MR1230186},
}
@article{KLW1989b,
author = {J. Kahn and J. C. Lagarias and H. S. Witsenhausen},
year = 1989,
title = {Single-suit two-person card play, III.~The mis\`ere game},
journal = {SIAM J. Disc. Math.},
volume = 2,
pages = {329-343},
mrnumber = {MR1002697 (90g:90197)},
}
@article{Kal1928,
author = {L. Kalm\'{a}r},
year = 1928,
title = {Zur Theorie der abstrakten Spiele},
journal = {Acta Sci. Math. Univ. Szeged},
volume = 4,
pages = {65-85},
}
@article{Kal1991,
author = {B. Kalyanasundram},
year = 1991,
title = {On the power of white pebbles},
journal = {Combinatorica},
volume = 11,
pages = {157-171},
}
@inproceedings{KaSc1988,
author = {B. Kalyanasundram and G. Schnitger},
year = 1988,
title = {On the power of white pebbles},
booktitle = {Proc. 20th Ann. ACM Symp. Theory of Computing
\emph{(Chicago, IL, 1988)}},
organization = {Assoc. Comput. Mach., New York, NY},
pages = {258-266},
}
@article{Kan1994,
author = {J. H. Kan},
year = 1994,
title = {(0, 1) matrices, combinatorial games and Ramsey problems},
journal = {Math. Appl. $($Wuhan$)$},
volume = 7,
pages = {97-101},
note = {(Chinese; English summary)},
}
@article{Kan1983,
author = {M. Kano},
year = 1983,
title = {Cycle games and cycle cut games},
journal = {Combinatorica},
volume = 3,
pages = {201-206},
}
@incollection{Kan1993,
author = {M. Kano},
year = 1993,
title = {An edge-removing game on a graph (a generalization of Nim and Kayles)},
booktitle = {Optimal Combinatorial Structures on Discrete Mathematical
Models \emph{(in Japanese, Kyoto, 1992)}},
publisher = {S\=u\-ri\-kaisekikenky\=usho K\=oky\=uroku},
pages = {82-90},
mrnumber = {MR1259331 (94m:90132)},
}
@article{Kan1996,
author = {M. Kano},
year = 1996,
title = {Edge-removing games of star type},
journal = {Discrete Math.},
volume = 151,
pages = {113-119},
}
@incollection{KSFH1993,
author = {M. Kano and T. Sasaki and H. Fujita and S. Hoshi},
year = 1993,
title = {Life games of Ibadai type},
booktitle = {Combinatorial Structure in Mathematical Models
\emph{(in Japanese, Kyoto, 1993)}},
publisher = {S\=urikaisekikenky\=usho K\=oky\=uroku},
pages = {108-117},
}
@article {KaLo2007,
AUTHOR = {S. Kanungo and R. M. Low},
TITLE = {Further analysis on the king and rook vs.
king on a quarter-infinite board problem},
JOURNAL = {Integers},
FJOURNAL = {Integers. Electronic Journal of Combinatorial Number Theory},
VOLUME = {7},
YEAR = {2007},
PAGES = {\#G09, 7 pp.},
url = {http://www.integers-ejcnt.org/vol7.html},
ISSN = {1553-1732},
MRCLASS = {68Q25 (05C38 68Q17 91A43)},
MRNUMBER = {**MR pending},
}
@article{Kao2005,
author = {K-Y. Kao},
year = 2005,
title = {Sumbers -- sums of ups and downs},
journal = {Integers, Electr. J. of Combinat. Number Theory},
volume = 5,
pages = {\#G01, 13 pp., Comb. Games Sect.},
url = {http://www.integers-ejcnt.org/vol5.html},
mrnumber = {MR2139164 (2005k:91081)},
}
@inproceedings{KaZh1989,
author = {R. M. Karp and Y. Zhang},
year = 1989,
title = {On parallel evaluation of game trees},
booktitle = {Proc. ACM Symp. Parallel Algorithms and Architectures},
pages = {409-420},
}
@article{KAI1979,
author = {T. Kasai and A. Adachi and S. Iwata},
year = 1979,
title = {Classes of pebble games and complete problems},
journal = {SIAM J. Comput.},
volume = 8,
pages = {574-586},
}
@incollection{Kaw1996,
author = {Y. Kawano},
year = 1996,
title = {Using similar positions to search game trees},
pages = {193-202},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}
@article{Kay2000,
author = {R. Kaye},
year = 2000,
title = {Minesweeper is NP-complete},
journal = {Math. Intelligencer},
volume = {22 {\rm issue 2}},
pages = {9-15},
mrnumber = {MR1764264},
}
@article{KeGi2001,
author = {M. D. Kearse and P. B. Gibbons},
year = 2001,
title = {Computational methods and new results for chessboard problems},
journal = {Australas. J. Combin.},
volume = 23,
pages = {253--284},
mrnumber = {MR1815018 (2001m:05190)},
}
@article{KeGi2002,
author = {M. D. Kearse and P. B. Gibbons},
year = 2002,
title = {A new lower bound on upper irredundance in the queens' graph},
journal = {Discrete Math.},
volume = 256,
pages = {225-242},
mrnumber = {MR1927068 (2003g:05098)},
}
@techreport{Ken1967,
author = {J. C. Kenyon},
year = 1967,
title = {A Nim-like game with period 349},
institution = {Univ. of Calgary, Math. Dept.},
type = {Res. Paper},
number = {No.~13},
}
@mastersthesis{Ken1967a,
author = {J. C. Kenyon},
year = 1967,
title = {Nim-like games and the Sprague--Grundy theory},
school = {Univ. of Calgary},
}
@book{Ker1933,
author = {B. Kerst},
year = 1933,
title = {Mathematische Spiele},
publisher = {Reprinted by Dr. Martin S\H andig oHG, Wiesbaden 1968},
}
@article{Kir2000,
author = {H. A. Kierstead},
year = 2000,
title = {A simple competitive graph coloring algorithm},
journal = {J. Combin. Theory \emph{(Ser.~B)}},
volume = 78,
pages = {57-68},
}
@article {MR2116838,
AUTHOR = {Kierstead, H. A.},
TITLE = {Asymmetric graph coloring games},
JOURNAL = {J. Graph Theory},
FJOURNAL = {Journal of Graph Theory},
VOLUME = {48},
YEAR = {2005},
NUMBER = {3},
PAGES = {169--185},
ISSN = {0364-9024},
CODEN = {JGTHDO},
MRCLASS = {91A43 (05C15 91A05)},
MRNUMBER = {MR2116838 (2006c:91033)},
MRREVIEWER = {David J. Grynkiewicz},
}
@article{Kir2006,
author = {H. A. Kierstead},
year = 2006,
title = {Weak acyclic coloring and asymmetric coloring games},
journal = {Discrete Math.},
volume = 306,
pages = {673-677},
}
@article{KiTr1994,
author = {H. A. Kierstead and W. T. Trotter},
year = 1994,
title = {Planar graph coloring with an uncooperative partner},
journal = {J. Graph Theory},
volume = 18,
pages = {569-584},
mrnumber = {MR1292976 (95f:05043)},
}
@article{KiTr2001,
author = {H. A. Kierstead and W. T. Trotter},
year = 2001,
title = {Competitive colorings of oriented graphs},
journal = {Electr. J. Combin.},
volume = {8(2)},
pages = {\#R12, 15 pp.},
url = {http://www.combinatorics.org/},
note = {Volume in honor of Aviezri S. Fraenkel},
mrnumber = {MR1853263 (2002g:05083)},
}
@article {KiTu2003,
AUTHOR = {Kierstead, H. A. and {Zs. Tuza}},
TITLE = {Marking games and the oriented game chromatic number of
partial {$k$}-trees},
JOURNAL = {Graphs Combin.},
FJOURNAL = {Graphs and Combinatorics},
VOLUME = {19},
YEAR = {2003},
PAGES = {121--129},
ISSN = {0911-0119},
CODEN = {GRCOE5},
MRCLASS = {05C15 (05C05)},
MRNUMBER = {MR1974374 (2003m:05069)},
MRREVIEWER = {Radhika Ramamurthi},
}
@article {KiYa2005,
AUTHOR = {Kierstead, H. A. and Yang, Daqing},
TITLE = {Very asymmetric marking games},
JOURNAL = {Order},
FJOURNAL = {Order. A Journal on the Theory of Ordered Sets and its
Applications},
VOLUME = {22},
YEAR = {2005},
NUMBER = {2},
PAGES = {93--107 (2006)},
ISSN = {0167-8094},
CODEN = {ORDRE5},
MRCLASS = {91A43 (05C15)},
MRNUMBER = {MR2207192 (2007d:91045)},
MRREVIEWER = {Jaros{\l}aw A. Grytczuk},
}
@article{Kim1996,
author = {Y. Kim},
year = 1996,
title = {New values in domineering},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 156,
pages = {263-280},
}
@article {MR2268455,
AUTHOR = {Kimberling, Clark},
TITLE = {Complementary equations},
JOURNAL = {J. Integer Seq.},
FJOURNAL = {Journal of Integer Sequences},
VOLUME = {10},
YEAR = {2007},
NUMBER = {1},
PAGES = {Article 07.1.4, 14 pp. (electronic)},
ISSN = {1530-7638},
MRCLASS = {11B37},
MRNUMBER = {MR2268455},
url = {http://www.cs.uwaterloo.ca/journals/JIS/VOL10/Kimberling/kimberling26.pdf}
}
@article{Kin1973,
author = {H. Kinder},
year = 1973,
title = {Gewinnstrategien des Anziehenden in einigen Spielen auf Graphen},
journal = {Arch. Math.},
volume = 24,
pages = {332-336},
}
@article{KNTG1994,
author = {M. A. Kiwi and R. Ndoundam and M. Tchuente and E. Goles},
year = 1994,
title = {No polynomial bound for the period of the parallel chip firing
game on graphs},
journal = {Theoret. Comput. Sci.},
volume = 136,
pages = {527-532},
}
@book{Kla1998,
editor = {D. A. Klarner},
title = {Mathematical recreations. A collection in honor of Martin Gardner},
publisher = {Dover},
address = {Mineola, NY},
year = 1998,
note = {Corrected reprint of {\it The Mathematical Gardner},
Wadsworth Internat., Belmont, CA, 1981},
}
@article{KlMi1997,
author = {S. Klav\v{z}ar and U. Milutinovi\'{c}},
year = 1997,
title = {Graphs $S(n,k)$ and a variant of the tower of Hanoi problem},
journal = {Czechoslovak Math. J.},
volume = 47,
pages = {95-104},
mrnumber = {MR1435608 (97k:05061)},
}
@article{KlMi2002,
author = {S. Klav\v{z}ar and U. Milutinovi\'{c}},
year = 2002,
title = {Simple explicit formulas for the Frame-Stewart numbers},
journal = {Ann. Comb.},
volume = 6,
pages = {157-167},
mrnumber = {MR1955516 (2003k:05004)},
}
@article{KMP2001,
author = {S. Klav\v{z}ar and U. Milutinovi\'{c} and C. Petr},
year = 2001,
title = {Combinatorics of topmost discs of multi-peg tower of Hanoi problem},
journal = {Ars Combinatoria},
volume = 59,
pages = {55-64},
mrnumber = {MR1832197 (2002b:05013)},
}
@article{KMP2002,
author = {S. Klav\v{z}ar and U. Milutinovi\'{c} and C. Petr},
year = 2002,
title = {On the Frame-Stewart algorithm for the multi-peg tower of
Hanoi problem},
journal = {Discrete Appl. Math.},
volume = 120,
pages = {141-157},
mrnumber = {MR1966398},
}
@article{Kla1985,
author = {M. M. Klawe},
year = 1985,
title = {A tight bound for black and white pebbles on the pyramids},
journal = {J. Assoc. Comput. Mach.},
volume = 32,
pages = {218-228},
}
@article{KlMi1993,
author = {C. S. Klein and S. Minsker},
year = 1993,
title = {The super towers of Hanoi problem: large rings on small rings},
journal = {Discrete Math.},
volume = 114,
pages = {283-295},
}
@article{KlRo1972,
author = {D. J. Kleitman and B. L. Rothschild},
year = 1972,
title = {A generalization of Kaplansky's game},
journal = {Discrete Math.},
volume = 2,
pages = {173-178},
}
@article {MR2363369,
AUTHOR = {Kloster, Oddvar},
TITLE = {A solution to the angel problem},
JOURNAL = {Theoret. Comput. Sci.},
FJOURNAL = {Theoretical Computer Science},
VOLUME = {389},
YEAR = {2007},
PAGES = {152--161},
ISSN = {0304-3975},
CODEN = {TCSDI},
MRCLASS = {91A46 (91A05)},
MRNUMBER = {MR2363369},
}
@article{Klv1977,
author = {T. Kl\o{v}e},
year = 1977,
title = {The modular $n$-queen problem},
journal = {Discrete Math.},
volume = 19,
pages = {289-291},
}
@article{Klv1981,
author = {T. Kl\o{v}e},
year = 1981,
title = {The modular $n$-queen problem II},
journal = {Discrete Math.},
volume = 36,
pages = {33-48},
}
@article{KnPr2001,
author = {A. Knopfmacher and H. Prodinger},
year = 2001,
title = {A Simple Card Guessing Game Revisited},
journal = {Electr. J. Combin.},
volume = {8(2)},
pages = {\#R13, 9 pp.},
url = {http://www.combinatorics.org/},
note = {Volume in honor of Aviezri S. Fraenkel},
mrnumber = {MR1853264 (2002g:05007)},
}
@article{Kno1996,
author = {M. Knor},
title = {On {R}amsey-type games for graphs},
journal = {Australas. J. Combin.},
year = 1996,
volume = 14,
pages = {199-206},
}
@book{Knu1974,
author = {D. E. Knuth},
year = 1974,
title = {Surreal Numbers},
publisher = {Addison-Wesley, Reading, MA},
}
@article{Knu1976,
author = {D. E. Knuth},
year = 1976,
title = {The computer as Master Mind},
journal = {J. Recr. Math.},
volume = 9,
pages = {1-6},
}
@article{Knu1977,
author = {D. E. Knuth},
year = 1977,
title = {Are toy problems useful?},
journal = {Popular Computing},
volume = {5 {\rm issue 1, 3-10; continued in {\bf 5} issue 2, 3-7}},
pages = {},
}
@book{Knu1993,
author = {D. E. Knuth},
year = 1993,
title = {The Stanford Graph Base\rm{: A Platform for Combinatorial
Computing}},
publisher = {ACM Press, New York},
}
@article{Kom1984,
author = {P. Komj\'ath},
title = {A simple strategy for the {R}amsey-game},
journal = {Studia Sci. Math. Hung.},
year = 1984,
volume = 19,
pages = {231-232},
}
@article{Kot1946,
author = {A. Kotzig},
year = 1946,
title = {O $k$-posunutiach (On $k$-translations; in Slovakian)},
journal = {\v Ca\-sop. pro P\v est. Mat. a Fys.},
volume = 71,
pages = {55-61},
note = {extended abstract in French, pp. 62--66},
}
@book{Kow1930,
author = {G. Kowalewski},
year = 1930,
title = {Alte und neue mathematische Spiele},
publisher = {Reprinted by Dr. Martin S\H andig oHG, Wiesbaden 1968},
}
@article{KoLa1993,
author = {K. Koyama and T. W. Lai},
year = 1993,
title = {An optimal Mastermind strategy},
journal = {J. Recr. Math.},
volume = 25,
pages = {251-256},
}
@book{Kra1953,
author = {M. Kraitchik},
year = 1953,
title = {Mathematical Recreations},
edition = {2nd},
publisher = {Dover, New York, NY},
}
@article{KMSTW2004,
author = {D. Kr\'{a}l and V. Majerech and J. Sgall and T. Tich\'{y}
and G. Woeginger},
year = 2004,
title = {It is tough to be a plumber},
journal = {Theoret. Comp. Sci.},
volume = {313},
pages = {473-484},
note = {special issue of Dagstuhl Seminar ``Algorithmic Combinatorial
Game Theory'', Feb. 2002},
mrnumber = {MR2056940},
}
@article{KrSz2008,
author = {M. Krivelevich and T. Szab\'o},
year = 2008,
title = {Biased positional games and small hypergraphs with large covers},
journal = {Electr. J. Combin.},
volume = {15(1)},
pages = {\#R70, 13 pp.},
url = {http://www.combinatorics.org/},
mrnumber = {**MR pending},
}
@book{Kum1980,
author = {B. Kummer},
year = 1980,
title = {Spiele auf Graphen},
series = {Internat. Series of Numerical Mathematics},
publisher = {Birkh\"auser Verlag, Basel},
}
@inproceedings{KuCo2007,
author = {D. Kunkle and G. Cooperman},
year = 2007,
title = {Twenty-Six Moves Suffice for Rubik's Cube},
booktitle = {Proc. Intern. Sympos. Symbolic and Algebraic Computation
(ISSAC '07)},
editor = {},
volume = {},
pages = {},
publisher = {ACM Press},
note = {to appear},
}
@article {MR2183168,
AUTHOR = {Kutz, Martin},
TITLE = {Conway's angel in three dimensions},
JOURNAL = {Theoret. Comput. Sci.},
FJOURNAL = {Theoretical Computer Science},
VOLUME = {349},
YEAR = {2005},
PAGES = {443--451},
ISSN = {0304-3975},
CODEN = {TCSDI},
MRCLASS = {91A46 (05A99)},
MRNUMBER = {MR2183168 (2006h:91045)},
MRREVIEWER = {Rudolf Avenhaus},
}
@incollection {MR2190915,
AUTHOR = {Kutz, Martin and P{\'o}r, Attila},
TITLE = {Angel, {D}evil, and {K}ing},
BOOKTITLE = {Computing and Combinatorics},
NOTE = {Proc. COCOON},
SERIES = {Lecture Notes in Comput. Sci.},
VOLUME = {3595},
PAGES = {925--934},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {2005},
MRCLASS = {91A46},
MRNUMBER = {MR2190915 (2006g:91043)},
}
@incollection{LMR2002,
author = {M. Lachmann and C. Moore and I. Rapaport},
year = 2002,
title = {Who wins Domineering on rectangular boards?},
pages = {307-315},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1973019 (2004b:91047)},
}
@article{LaNo1985,
author = {R. E. Ladner and J. K. Norman},
year = 1985,
title = {Solitaire automata},
journal = {J. Comput. System Sci.},
volume = 30,
pages = {116-129},
note = {MR 86i:68032},
}
@article{Lag1977,
author = {J. C. Lagarias},
year = 1977,
title = {Discrete balancing games},
journal = {Bull. Inst. Math. Acad. Sinica},
volume = 5,
pages = {363-373},
}
@article{LaSl1999,
author = {J. Lagarias and D. Sleator},
year = 1999,
title = {Who wins mis\`{e}re Hex?},
journal = {{\rm in:} The Mathemagician and Pied Puzzler{\rm ,}},
chapter = {},
pages = {},
note = {honoring Martin Gardner; E. Berlekamp and T. Rodgers, eds.,
A K Peters, Natick, MA, pp. 237-240},
publisher = {},
}
@article{Lal1988,
author = {S. P. Lalley},
year = 1988,
title = {A one-dimensional infiltration game},
journal = {Naval Res. Logistics},
volume = 35,
pages = {441-446},
}
@article {LSX1999,
AUTHOR = {Lam, Peter Che Bor and Shiu, Wai Chee and Xu, Baogang},
TITLE = {Edge game-coloring of graphs},
JOURNAL = {Graph Theory Notes N. Y.},
FJOURNAL = {Graph Theory Notes of New York},
VOLUME = {37},
YEAR = {1999},
PAGES = {17--19},
ISSN = {1040-8118},
MRCLASS = {05C15},
MRNUMBER = {MR1724310},
}
@article{Lam1997,
author = {T. K. Lam},
year = 1997,
title = {Connected sprouts},
journal = {Amer. Math. Monthly},
volume = 104,
pages = {116-119},
}
@incollection{Lan1996,
author = {H. A. Landman},
year = 1996,
title = {Eyespace values in Go},
pages = {227-257},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1427967 (97j:90100)},
}
@incollection{Lan2002,
author = {H. Landman},
year = 2002,
title = {A simple FSM-based proof of the additive periodicity of the
Sprague-Grundy function of Wythoff's game},
pages = {383-386},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1973106 (2004b:91048)},
}
@article{Lar1977,
author = {L. Larson},
year = 1977,
title = {A theorem about primes proved on a chessboard},
journal = {Math. Mag.},
volume = 50,
pages = {69-74},
}
@book{Las1931,
author = {E. Lasker},
year = 1931,
title = {Brettspiele der V\"olker, R\"atsel und mathematische Spiele},
publisher = {Berlin},
}
@article{LaMa2002,
author = {M. Latapy and C. Magnien},
year = 2002,
title = {Coding distributive lattices with edge firing games},
journal = {Inform. Process. Lett.},
volume = 83,
pages = {125-128},
mrnumber = {MR1837204 (2002h:37022)},
}
@article{LaMa2001,
author = {M. Latapy and H D. Phan},
year = 2001,
title = {The lattice structure of chip firing games and related models},
journal = {Phys. D},
volume = 155,
pages = {69-82},
mrnumber = {MR1837204 (2002h:37022)},
}
@article{Lav1985,
author = {I. Laval\'ee},
year = 1985,
title = {Note sur le probl\`eme des tours d'Hano\" {\i}},
journal = {Rev. Roumaine Math. Pures Appl.},
volume = 30,
pages = {433-438},
}
@article{LaSa1995,
author = {E. L. Lawler and S. Sarkissian},
year = 1995,
title = {An algorithm for ``Ulam's game'' and its application to error
correcting codes},
journal = {Inform. Process. Lett.},
volume = 56,
pages = {89-93},
}
@article{LLPSU1999,
author = {A. J. Lazarus and D. E. Loeb and J. G. Propp and W. R.
Stromquist and D. Ullman},
year = 1999,
title = {Combinatorial games under auction play},
journal = {Games Econom. Behav.},
volume = 27,
pages = {229-264},
mrnumber = {MR1685133 (2001f:91023)},
}
@incollection{LLPU1996,
author = {A. J. Lazarus and D. E. Loeb and J. G. Propp and D. Ullman},
year = 1996,
title = {Richman Games},
pages = {439-449},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1427981 (97j:90101)},
}
@article {MR2218803,
AUTHOR = {Lee, Sang-Gu and Yang, Jeong-Mo},
TITLE = {Linear algebraic approach on real {$\sigma$}-game},
JOURNAL = {J. Appl. Math. Comput.},
FJOURNAL = {Journal of Applied Mathematics \& Computing},
VOLUME = {21},
YEAR = {2006},
NUMBER = {1-2},
PAGES = {295--305},
ISSN = {1598-5865},
MRCLASS = {91A46 (68Q45)},
MRNUMBER = {MR2218803 (2006k:91056)},
}
@article{LeMy1999,
author = {D. B. Leep and G. Myerson},
year = 1999,
title = {Marriage, magic and solitaire},
journal = {Amer. Math. Monthly},
volume = 106,
pages = {419-429},
}
@article{Leh1964,
author = {A. Lehman},
year = 1964,
title = {A solution to the Shannon switching game},
journal = {SIAM J. Appl. Math.},
volume = 12,
pages = {687-725},
}
@article {Lei1983b,
AUTHOR = {Leiss, Ernst L.},
TITLE = {On restricted {H}anoi problems},
JOURNAL = {J. Combin. Inform. System Sci.},
FJOURNAL = {Journal of Combinatorics, Information \& System Sciences},
VOLUME = {8},
YEAR = {1983},
PAGES = {277--285},
ISSN = {0250-9628},
MRCLASS = {05C20},
MRNUMBER = {MR783767 (86i:05072)},
MRREVIEWER = {Mukkai S. Krishnamoorthy},
}
@article {Lei1983a,
AUTHOR = {Leiss, Ernst},
TITLE = {Solving the ``{T}owers of {H}anoi'' on graphs},
JOURNAL = {J. Combin. Inform. System Sci.},
FJOURNAL = {Journal of Combinatorics, Information \& System Sciences},
VOLUME = {8},
YEAR = {1983},
PAGES = {81--89},
ISSN = {0250-9628},
MRCLASS = {05C20},
MRNUMBER = {MR783741 (86i:05071)},
MRREVIEWER = {Mukkai S. Krishnamoorthy},
}
@article{Lei1984,
AUTHOR = {Leiss, Ernst L.},
TITLE = {Finite {H}anoi problems: how many discs can be handled?},
BOOKTITLE = {Proceedings of the 15th Southeastern Conf. on
Combinatorics, Graph Theory and Computing {\rm (Baton Rouge, La.,
1984)}},
JOURNAL = {Congr. Numer.},
FJOURNAL = {Congressus Numerantium. A Conference Journal on Numerical
Themes},
VOLUME = {44},
YEAR = {1984},
PAGES = {221--229},
note = {Proc. 15th Southeastern Internat. Conf. on Combinatorics,
Graph Theory and Computing (Baton Rouge, LA, 1984)},
ISSN = {0384-9864},
MRCLASS = {05C20},
MRNUMBER = {MR777543 (87b:05062)},
}
@article{LeTa1980,
author = {T. Lengauer and R. Tarjan},
year = 1980,
title = {The space complexity of pebble games on trees},
journal = {Inform. Process. Lett.},
volume = 10,
pages = {184-188},
}
@article{LeTa1982,
author = {T. Lengauer and R. Tarjan},
year = 1982,
title = {Asymptotically tight bounds on time-space trade-offs in a pebble game},
journal = {J. Assoc. Comput. Mach.},
volume = 29,
pages = {1087-1130},
}
@article{Len2003,
author = {T. Lengyel},
year = 2003,
title = {A Nim-type game and continued fractions},
journal = {Fibonacci Quart.},
volume = 41,
pages = {310-320},
mrnumber = {MR2022411},
}
@article{Len1977,
author = {H. W. Lenstra, Jr.},
year = 1977,
title = {On the algebraic closure of two},
journal = {Proc. Kon. Nederl. Akad. Wetensch. \emph{(Ser.~A)}},
volume = 80,
pages = {389-396},
}
@techreport{Len1977a,
author = {H. W. Lenstra, Jr.},
year = {1977/1978},
title = {Nim multiplication},
type = {S\'eminaire de Th\'eorie des Nombres},
number = {No. 11},
institution = {Universit\'e de Bordeaux, France},
}
@article {Lev2006,
AUTHOR = {Levine, Lionel},
TITLE = {Fractal sequences and restricted {N}im},
JOURNAL = {Ars Combin.},
FJOURNAL = {Ars Combinatoria},
VOLUME = {80},
YEAR = {2006},
PAGES = {113--127},
ISSN = {0381-7032},
CODEN = {ACOMDN},
MRCLASS = {91A46 (11B83 91A05)},
MRNUMBER = {MR2243082 (2007b:91029)},
MRREVIEWER = {G. A. Heuer},
}
@book{Lev1988,
editor = {D. N. L. Levy},
year = 1988,
title = {Computer Games \emph{I, II}},
publisher = {Springer-Verlag, New York, NY},
}
@article{Lew1986,
author = {J. Lewin},
year = 1986,
title = {The lion and man problem revisited},
journal = {J. Optimization Theory and Applications},
volume = 49,
pages = {411-430},
}
@article{LeWi1980,
author = {T. Lewis and S. Willard},
year = 1980,
title = {The rotating table},
journal = {Math. Mag.},
volume = 53,
pages = {174-179},
}
@article{LiNe1998,
author = {C-K. Li and I. Nelson},
year = 1998,
title = {Perfect codes on the towers of Hanoi graph},
journal = {Bull. Austral. Math. Soc.},
volume = 57,
pages = {367-376},
}
@article{Li1974,
author = {S.-Y. R. Li},
year = 1974,
title = {Generalized impartial games},
journal = {Internat. J. Game Theory},
volume = 3,
pages = {169-184},
}
@article{Li1976,
author = {S.-Y. R. Li},
year = 1976,
title = {Sums of Zuchswang games},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 21,
pages = {52-67},
}
@article{Li1977,
author = {S.-Y. R. Li},
year = 1977,
title = {$N$-person nim and $N$-person Moore's games},
journal = {Internat. J. Game Theory},
volume = 7,
pages = {31-36},
}
@article{Lic1982,
author = {D. Lichtenstein},
year = 1982,
title = {Planar formulae and their uses},
journal = {SIAM J. Comput.},
volume = 11,
pages = {329-343},
}
@article{LiSi1980,
author = {D. Lichtenstein and M. Sipser},
year = 1980,
title = {Go is Polynomial-Space hard},
journal = {J. Assoc. Comput. Mach.},
volume = 27,
pages = {393-401},
note = {earlier version appeared in Proc. 19th Ann. Symp. Foundations
of Computer Science (Ann Arbor, MI, Oct. 1978), IEEE Computer Soc., Long
Beach, CA, 1978, pp. 48--54},
}
@article{Lie1971,
author = {H. Liebeck},
year = 1971,
title = {Some generalizations of the 14-15 puzzle},
journal = {Math. Mag.},
volume = 44,
pages = {185-189},
}
@article{Lim2005,
author = {C-W. Lim},
year = 2005,
title = {Partial Nim},
journal = {Integers, Electr. J. of Combinat. Number Theory},
volume = 5,
pages = {\#G02, 9 pp., Comb. Games Sect.},
url = {http://www.integers-ejcnt.org/vol5.html},
mrnumber = {MR2139165 (2005m:91046)},
}
@incollection {MR2081603,
AUTHOR = {L{\"o}ding, Christof and Rohde, Philipp},
TITLE = {Solving the sabotage game is {PSPACE}-hard},
BOOKTITLE = {Mathematical Foundations of Computer Science 2003},
SERIES = {Lecture Notes in Comput. Sci.},
VOLUME = {2747},
PAGES = {531--540},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {2003},
MRCLASS = {05C85 (68Q17 91A43)},
MRNUMBER = {MR2081603},
}
@article{Loeb1995,
author = {D. E. Loeb},
year = 1995,
title = {How to win at Nim},
journal = {UMAP J.},
volume = 16,
pages = {367-388},
}
@incollection{Loe1996,
author = {D. E. Loeb},
year = 1996,
title = {Stable winning coalitions},
pages = {451-471},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}
@article{Lop1991,
author = {A. M. Lopez, Jr.},
year = 1991,
title = {A prolog Mastermind program},
journal = {J. Recr. Math.},
volume = 23,
pages = {81-93},
}
@article {MR2247807,
AUTHOR = {Low, Richard M. and Stamp, Mark},
TITLE = {King and rook vs.\ king on a quarter-infinite board},
JOURNAL = {Integers, Electr. J. of Combinat. Number Theory},
FJOURNAL = {Integers. Electronic Journal of Combinatorial Number Theory},
VOLUME = {6},
YEAR = {2006},
PAGES = {\#G3, 8 pp.},
url = {http://www.integers-ejcnt.org/vol6.html},
ISSN = {1553-1732},
MRCLASS = {91A46 (91A05)},
MRNUMBER = {MR2247807 (2007c:91038)},
MRREVIEWER = {J. Quistorff},
}
@book{Loy1914,
author = {S. Loyd},
year = 1914,
title = {Cyclopedia of Puzzles and Tricks},
publisher = {Franklin Bigelow Corporation, Morningside Press, NY},
note = {reissued and edited by M. Gardner under the name {\it The
Mathematical Puzzles of Sam Loyd} (two volumes), Dover, New York, NY, 1959},
}
@article{Lu1986,
author = {X. Lu},
year = 1986,
title = {A Hamiltonian game},
journal = {J. Math. Res. Exposition $($English Ed.$)$},
volume = {1},
number = {},
pages = {101-106},
}
@article{Lu1991,
author = {X. Lu},
year = 1991,
title = {A matching game},
journal = {Discrete Math.},
volume = 94,
pages = {199-207},
}
@article{Lu1992,
author = {X. Lu},
year = 1992,
title = {A characterization on $n$-critical economical generalized tic-tac-toe games},
journal = {Discrete Math.},
volume = 110,
pages = {197-203},
}
@article{Lu1992a,
author = {X. Lu},
year = 1992,
title = {Hamiltonian games},
journal = {J. Combin. Theory \emph{(Ser.~B)}},
volume = 55,
pages = {18-32},
}
@article{Lu1995a,
author = {X. Lu},
year = 1995,
title = {A Hamiltonian game on $K_{n,n}$},
journal = {Discrete Math.},
volume = 142,
pages = {185-191},
}
@article{Lu1995b,
author = {X. Lu},
year = 1995,
title = {A note on biased and non-biased games},
journal = {Discrete Appl. Math.},
volume = 60,
pages = {285-291},
note = {Presented at ARIDAM VI and VII (New Brunswick, NJ, 1991/1992)},
}
@article{Lu1986b,
author = {X.-M. Lu},
year = 1986,
title = {Towers of Hanoi graphs},
journal = {Intern. J. Comput. Math.},
volume = 19,
pages = {23-38},
}
@article{Lu1988,
author = {X.-M. Lu},
year = 1988,
title = {Towers of Hanoi problem with arbitrary $k\geq 3$ pegs},
journal = {Intern. J. Comput. Math.},
volume = 24,
pages = {39-54},
}
@article{Lu1989,
author = {X.-M. Lu},
year = 1989,
title = {An iterative solution for the 4-peg towers of Hanoi},
journal = {Comput. J.},
volume = 32,
pages = {187-189},
}
@article{LuDi1994,
author = {X.-M. Lu and T. S. Dillon},
year = 1994,
title = {A note on parallelism for the towers of Hanoi},
journal = {Math. Comput. Modelling},
volume = {20 {\rm issue 3}},
pages = {1-6},
}
@article{LuDi1995,
author = {X.-M. Lu and T. S. Dillon},
year = 1995,
title = {Parallelism for multipeg towers of Hanoi},
journal = {Math. Comput. Modelling},
volume = {21 {\rm issue 3}},
pages = {3-17},
}
@article{LuDi1996,
author = {X.-M. Lu and T. S. Dillon},
year = 1996,
title = {Nonrecursive solution to parallel multipeg towers of Hanoi: a decomposition approach},
journal = {Math. Comput. Modelling},
volume = {24 {\rm issue 3}},
pages = {29-35},
}
@book{Lu1960,
author = {{\'E}. Lucas},
year = 1960,
title = {R\'{e}cr\'{e}ations Math\'{e}matiques},
volume = {I -- IV},
publisher = {A. Blanchard, Paris. Previous editions: Gauthier-Villars,
Paris, 1891--1894},
}
@book{Lu1974,
author = {{\'E}. Lucas},
year = 1974,
title = {Introduction aux R\'{e}cr\'{e}ations Math\'{e}matiques:
L'Arithm\'{e}\-tique Amusante},
publisher = {reprinted by A. Blanchard, Paris. Originally published
by A. Blanchard, Paris, 1895},
}
@article{Lud1988,
author = {A. L. Ludington},
year = 1988,
title = {Length of the 7-number game},
journal = {Fibonacci Quart.},
volume = 26,
pages = {195-204},
}
@article{Lud1990,
author = {A. Ludington-Young},
year = 1990,
title = {Length of the $n$-number game},
journal = {Fibonacci Quart.},
volume = 28,
pages = {259-265},
}
@article{Lun1986,
author = {W. F. Lunnon},
year = 1986,
title = {The Reve's puzzle},
journal = {Comput. J.},
volume = 29,
pages = {478},
}
@article{MaMe1987,
author = {M. Maamoun and H. Meyniel},
year = 1987,
title = {On a game of policemen and robber},
journal = {Discrete Appl. Math.},
volume = 17,
pages = {307-309},
}
@book{Mac1921,
author = {P. A. MacMahon},
year = 1921,
title = {New Mathematical Pastimes},
publisher = {Cambridge University Press, Cambridge},
}
@article{Maf1986,
author = {F. Maffray},
year = 1986,
title = {On kernels in $i$-triangulated graphs},
journal = {Discrete Math.},
volume = 61,
pages = {247-251},
}
@article{Maf1992,
author = {F. Maffray},
year = 1992,
title = {Kernels in perfect line-graphs},
journal = {J. Combin. Theory \break\emph{(Ser.~B)}},
volume = 55,
pages = {1-8},
}
@article{MPV2001,
author = {C. Magnien and H D. Phan and L. Vuillon},
year = 2001,
title = {Characterization of lattices induced by (extended) chip
firing games},
journal = {Discrete models: combinatorics, computation, and geometry
$($Paris, 2001$)$, 229--244 $($electronic$)$, Discrete Math. and
Theor. Comput. Sci. Proc.},
volume = {},
pages = {229-244},
mrnumber = {MR1888776 (2003a:91029)},
}
@article{Man1996,
author = {R. Mansfield},
year = 1996,
title = {Strategies for the Shannon switching game},
journal = {Amer. Math. Monthly},
volume = 103,
pages = {250-252},
}
@article{Mar1992,
author = {D. Marcu},
year = 1992,
title = {On finding a Grundy function},
journal = {Polytech. Inst. Bucharest Sci. Bull. Chem. Mater. Sci.},
volume = 54,
pages = {43-47},
}
@book{Mar1991,
author = {G. Martin},
year = 1991,
title = {Polyominoes: Puzzles and Problems in Tiling},
publisher = {Math. Assoc. America, Wasington, DC},
}
@incollection{Mar2002,
author = {G. Martin},
year = 2002,
title = {Restoring fairness to Dukego},
pages = {79-87},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1973006 (2004c:91031)},
}
@article{MSPF2001,
author = {\'{O}. Mart\'{\i}n-S\'{a}nchez and C. Pareja-Flores},
year = 2001,
title = {Two reflected analyses of lights out},
journal = {Math. Mag.},
volume = {74},
pages = {295-304},
}
@incollection{Mas2002,
author = {F. M\"{a}ser},
year = 2002,
title = {Global threats in combinatorial games: a computational model
with applications to chess endgames},
pages = {137-149},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1973010 (2004b:91049)},
}
@article {MR2312432,
AUTHOR = {M{\'a}th{\'e}, Andr{\'a}s},
TITLE = {The angel of power 2 wins},
JOURNAL = {Combin. Probab. Comput.},
FJOURNAL = {Combinatorics, Probability and Computing},
VOLUME = {16},
YEAR = {2007},
PAGES = {363--374},
ISSN = {0963-5483},
MRCLASS = {91A46 (05A99 91A05)},
MRNUMBER = {MR2312432 (2008a:91038)},
MRREVIEWER = {Kimmo Eriksson},
}
@article{Mau1978,
author = {J. G. Mauldon},
year = 1978,
title = {Num, a variant of nim with no first player win},
journal = {Amer. Math. Monthly},
volume = 85,
pages = {575-578},
}
@book{McC1974,
author = {R. McConville},
title = {The History of Board Games},
publisher = {Creative Publications, Palo Alto, CA},
year = 1974,
}
@article{McNo2005,
author = {S. K. McCurdy and R. Nowakowski},
year = 2005,
title = {Cutthroat, an all-small game on graphs},
journal = {Integers, Electr. J of Combinat. Number Theory},
volume = {5(2)},
pages = {\#A13, 13 pp.},
url = {http://www.integers-ejcnt.org/vol5(2).html},
mrnumber = {MR2192091 (2006g:05076)},
}
@article{McI1942,
author = {D. P. McIntyre},
year = 1942,
title = {A new system for playing the game of nim},
journal = {Amer. Math. Monthly},
volume = 49,
pages = {44-46},
}
@article{McN1993,
author = {R. McNaughton},
year = 1993,
title = {Infinite games played on finite graphs},
journal = {Ann. Pure Appl. Logic},
volume = 65,
pages = {149-184},
}
@article{McW1981,
author = {W. A. McWorter, Jr.},
year = 1981,
title = {Kriegspiel Hex},
journal = {Math. Mag.},
volume = 54,
pages = {85-86},
note = {solution to Problem 1084 posed by the author in Math. Mag. {\bf 52}
(1979) 317},
}
@article{MRH1974,
author = {E. Mead and A. Rosa and C. Huang},
year = 1974,
title = {The game of SIM: A winning strategy for the second player},
journal = {Math. Mag.},
volume = 47,
pages = {243-247},
}
@article{MHGJP1988,
author = {N. Megiddo and S. L. Hakimi and M. R. Garey and D. S.
Johnson and C. H. Papadimitriou},
year = 1988,
title = {The complexity of searching a graph},
journal = {J. Assoc. Comput. Mach.},
volume = 35,
pages = {18-44},
}
@article{MNR1990,
author = {K. Mehlhorn and S. N\"aher and M. Rauch},
year = 1990,
title = {On the complexity of a game related to the dictionary problem},
journal = {SIAM J. Comput.},
volume = 19,
pages = {902-906},
note = {earlier draft appeared in Proc. 30th Ann. Symp. Foundations of
Computer Science, pp. 546--548},
}
@article{Men1946,
author = {N. S. Mendelsohn},
year = 1946,
title = {A psychological game},
journal = {Amer. Math. Monthly},
volume = 53,
pages = {86-88},
}
@book {Men2004,
AUTHOR = {Mendelson, Elliott},
TITLE = {Introducing game theory and its applications},
SERIES = {Discrete Mathematics and its Applications (Boca Raton)},
PUBLISHER = {Chapman \& Hall/CRC, Boca Raton, FL},
YEAR = {2004},
PAGES = {v+259},
note = {(Ch. 1 is on combinatorial games)},
ISBN = {1-58488-300-6},
MRCLASS = {91-01 (91Axx)},
MRNUMBER = {MR2073442 (2005b:91003)},
}
@article{Men1981,
author = {C. G. M\'endez},
year = 1981,
title = {On the law of large numbers, infinite games and category},
journal = {Amer. Math. Monthly},
volume = 88,
pages = {40-42},
}
@article{Mer2001,
author = {C. Merino},
year = 2001,
title = {The chip firing game and matroid complexes},
journal = {Discrete models: combinatorics, computation, and geometry
$($Paris, 2001$)$ $($electronic$)$, Discrete Math. and Theor. Comput.
Sci. Proc.},
volume = {},
pages = {245-255},
mrnumber = {MR1888777 (2002k:91048)},
}
@article{Mer2005,
author = {C. Merino},
year = 2005,
title = {The chip firing game},
journal = {Discrete Math.},
volume = 302,
pages = {188-210},
mrnumber = {MR2179643},
}
@article{Mer1997,
author = {C. {Merino L\'opez}},
year = 1997,
title = {Chip firing and the Tutte polynomial},
journal = {Ann. Comb.},
volume = 1,
pages = {253-259},
note = {(C. Merino L\'opez = C.M. L\'opez = C. Merino is the same author)},
mrnumber = {MR1630779 (99k:90232)},
}
@incollection{Mes2008,
author = {G. A. {Mesdal III}},
year = 2008,
title = {Partizan splittles},
pages = {},
editor = {M. H. Albert and R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {},
booktitle = {Games of No Chance III, \emph{Proc. BIRS Workshop on
Combinatorial Games, July, 2005, Banff, Alberta, Canada, MSRI Publ.}},
}
@article {MeOt2007,
AUTHOR = {Mesdal, G. A. and Ottaway, P.},
TITLE = {Simplification of partizan games in mis\`ere play},
JOURNAL = {Integers, Electr. J of Combinat. Number Theory},
FJOURNAL = {Integers. Electronic Journal of Combinatorial Number Theory},
VOLUME = {7},
YEAR = {2007},
url = {http://www.integers-ejcnt.org/vol7.html},
note = {(G. A. Mesdal designates the following authors: M. Allen,
J. P. Grossman, A. Hill, N. A. McKay, R. J. Nowakowski, T. Plambeck,
A. A. Siegel, D. Wolfe, who participated at the 2006 ``Games-at-Dal~4"
(Dalhousie) conference)},
PAGES = {\#G06, 12 pp.)},
ISSN = {1553-1732},
MRCLASS = {91A46},
MRNUMBER = {MR2299812 (2007k:91054)},
}
@article{Mey1994,
author = {D. Mey},
year = 1994,
title = {Finite games for a predicate logic without contractions},
journal = {Theoret. Comput. Sci.},
volume = 123,
pages = {341-349},
}
@article{Mey1981,
author = {Meyer auf der Heide, F.},
year = 1981,
title = {A comparison of two variations of a pebble game on graphs},
journal = {Theoret. Comput. Sci.},
volume = 13,
pages = {315-322},
}
@article{MeRo1988,
author = {H. Meyniel and J.-P. Roudneff},
year = 1988,
title = {The vertex picking game and a variation of the game of dots and boxes},
journal = {Discrete Math.},
volume = 70,
pages = {311-313},
mrnumber = {MR0955128 (89f:05111)},
}
@article{MiBr1987,
author = {D. Michie and I. Bratko},
year = 1987,
title = {Ideas on knowledge synthesis stemming from the KBBKN endgame},
journal = {Internat. Comp. Chess Assoc. J.},
volume = 10,
pages = {3-13},
}
@article{Mil1953,
author = {J. Milnor},
year = 1953,
title = {Sums of positional games},
journal = {Ann. of Math. Stud. \emph{(Contributions to the Theory of Games,
H. W. Kuhn and A. W. Tucker, eds.), Princeton}},
volume = 2,
number = 28,
pages = {291-301},
}
@article{Min1982,
author = {Min Lin, P.},
year = 1982,
title = {Principal partition of graphs and connectivity games},
journal = {J. Franklin Inst.},
volume = 314,
pages = {203-210},
}
@article{Min1989,
author = {S. Minsker},
year = 1989,
title = {The towers of Hanoi rainbow problem: coloring the rings},
journal = {J. Algorithms},
volume = 10,
pages = {1-19},
}
@article{Min1991,
author = {S. Minsker},
year = 1991,
title = {The towers of Antwerpen problem},
journal = {Inform. Process. Lett.},
volume = 38,
pages = {107-111},
}
@article{MiWe2001,
author = {J. Missigman and R. Weida},
year = 2001,
title = {An easy solution to mini lights out},
journal = {Math. Mag.},
volume = 74,
pages = {57-59},
}
@article{Moe1991,
author = {D. Moews},
year = 1991,
title = {Sums of games born on days 2 and 3},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 91,
pages = {119-128},
mrnumber = {MR1142561 (93b:90130)},
}
@article{Moe1992,
author = {D. Moews},
year = 1992,
title = {Pebbling graphs},
journal = {J. Combin. Theory \emph{(Ser.~B)}},
volume = 55,
pages = {244-252},
}
@article{Moe1996,
author = {D. Moews},
year = 1996,
title = {Coin-sliding and Go},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 164,
pages = {253-276},
}
@incollection{Moe1996a,
author = {D. Moews},
year = 1996,
title = {Infinitesimals and coin-sliding},
pages = {315-327},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}
@incollection{Moe1996b,
author = {D. Moews},
year = 1996,
title = {Loopy games and Go},
pages = {259-272},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1427968 (98d:90152)},
}
@incollection{Moe2002,
author = {D. Moews},
year = 2002,
title = {The abstract structure of the group of games},
pages = {49-57},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1973004 (2004b:91034)},
}
@incollection{MoEp2002,
author = {C. Moore and D. Eppstein},
year = 2002,
title = {1-dimensional peg solitaire, and duotaire},
pages = {341-350},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1973022},
}
@article{Moo1909,
author = {E. H. Moore},
year = {1909--1910},
title = {A generalization of the game called nim},
journal = {Ann. of Math. \emph{(Ser.~2)}},
volume = 11,
pages = {93-94},
}
@book{MMS1963,
author = {A. H. Moorehead and G. Mott-Smith},
title = {Hoyle's Rules of Games},
publisher = {Signet, New American Library},
year = 1963,
}
@article{Mor1981,
author = {F. L. Morris},
year = 1981,
title = {Playing disjunctive sums is polynomial space complete},
journal = {Internat. J. Game Theory},
volume = 10,
pages = {195-205},
}
@incollection {MR624110,
AUTHOR = {Morrison, David R.},
TITLE = {A {S}tolarsky array of {W}ythoff pairs},
BOOKTITLE = {A collection of manuscripts related to the {F}ibonacci
sequence},
PAGES = {134--136},
PUBLISHER = {Fibonacci Assoc.},
ADDRESS = {Santa Clara, Calif.},
YEAR = {1980},
MRCLASS = {05B15 (10A35)},
MRNUMBER = {MR624110 (82j:05030)},
MRREVIEWER = {J. Chidambaraswamy},
}
@article{MoHe1944,
author = {M. Morse and G. A. Hedlund},
year = 1944,
title = {Unending chess, symbolic dynamics and a problem in semigroups},
journal = {Duke Math. J.},
volume = 11,
pages = {1-7},
}
@article{Mul2003,
author = {M. M\"uller},
year = 2003,
title = {Conditional combinatorial games and their application to analyzing
capturing races in Go},
journal = {Information Sciences},
volume = 154,
pages = {189-202},
}
@incollection{MuGa1996,
author = {M. M\"uller and R. Gasser},
year = 1996,
title = {Conditional combinatorial games and their application
to analyzing
capturing races in Go},
pages = {273-284},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}
@incollection {M\"uTe2002,
AUTHOR = {M{\"u}ller, Martin and Tegos, Theodore},
TITLE = {Experiments in computer {A}mazons},
BOOKTITLE = {More games of no chance (Berkeley, CA, 2000)},
SERIES = {Math. Sci. Res. Inst. Publ.},
VOLUME = {42},
PAGES = {243--260},
PUBLISHER = {Cambridge Univ. Press},
ADDRESS = {Cambridge},
YEAR = {2002},
MRCLASS = {91A46 (05C85 68T20 91A05)},
MRNUMBER = {MR1973016 (2004b:91050)},
}
@article {MR1213606,
AUTHOR = {Mundici, Daniele},
TITLE = {Logic and algebra in {U}lam's searching game with lies},
JOURNAL = {Jbuch. Kurt-G\"odel-Ges.},
FJOURNAL = {Kurt-G\"odel-Gesellschaft. Jahrbuch},
YEAR = {1991},
PAGES = {109--114 (1993)},
MRCLASS = {03G20 (06D30 06F20 90D44)},
MRNUMBER = {MR1213606 (94j:03130)},
MRREVIEWER = {Manuel Abad},
}
@incollection {MR1206717,
AUTHOR = {Mundici, Daniele},
TITLE = {The logic of {U}lam's game with lies},
BOOKTITLE = {Knowledge, Belief, and Strategic Interaction (Castiglioncello,
1989)},
SERIES = {Cambridge Stud. Probab. Induc. Decis. Theory},
PAGES = {275--284},
PUBLISHER = {Cambridge Univ. Press},
ADDRESS = {Cambridge},
YEAR = {1992},
MRCLASS = {90D40 (03B50 68P10)},
MRNUMBER = {MR1206717 (94c:90133)},
MRREVIEWER = {Bernhard von Stengel},
}
@article{MuTr1997,
author = {D. Mundici and T. Trombetta},
year = 1997,
title = {Optimal comparison strategies in Ulam's searching game with two errors},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 182,
pages = {217-232},
}
@book{Mur1952,
author = {H. J. R. Murray},
year = 1952,
title = {A History of Board Games Other Than Chess},
publisher = {Oxford University Press},
}
@article{Nad1990,
author = {B. Nadel},
year = 1990,
title = {Representation selection for constraint satisfaction: a case
study using $n$-queens},
journal = {IEEE Expert},
volume ={5 {\rm issue 3}},
pages = {16-23},
}
@incollection{Nak2008,
author = {T. Nakamura},
year = 2008,
title = {On counting liberties in capturing races of Go},
pages = {},
editor = {M. H. Albert and R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {},
booktitle = {Games of No Chance III, \emph{Proc. BIRS Workshop on
Combinatorial Games, July, 2005, Banff, Alberta, Canada, MSRI Publ.}},
}
@inproceedings{NaBe2003,
author = {T. Nakamura and E. Berlekamp},
year = 2003,
title = {Analysis of composite corridors},
booktitle = {Proc. Intern. Conference on Computers and Games CG'2002,
Edmonton, Alberta, Canada, July 2002,},
editor = {Y. Bj\"{o}rnsson and M. M\"{u}ller and J. Schaeffer},
volume = {LNCS 288},
pages = {213-229},
publisher = {Lecture Notes in Computer Science, Springer},
}
@article{Nad1989,
author = {B. Nalebuff},
year = 1989,
title = {The other person's envelope is always greener},
journal = {J. Economic Perspectives},
volume ={3 {\rm issue 1}},
pages = {171-181},
}
@misc{Nap1970,
author = {A. Napier},
year = 1970,
title = {A new game in town},
howpublished = {Empire Mag., Denver Post, May 2},
}
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A45
UNIVERSAL SETS AND THE VECTOR GAME
Zhivko Nedev
@article{Ned2008,
author = {Z. Nedev},
year = 2008,
title = {Universal sets and the vector game},
journal = {Integers, Electr. J of Combinat. Number Theory},
volume = {8},
pages = {\#A45, 5 pp.},
url = {http://www.integers-ejcnt.org/vol8.html},
mrnumber = {**MR pending},
}
@article {MR2397246,
AUTHOR = {Nedev, Z. and Muthukrishnan, S.},
TITLE = {The {M}agnus-{D}erek game},
JOURNAL = {Theoret. Comput. Sci.},
FJOURNAL = {Theoretical Computer Science},
VOLUME = {393},
YEAR = {2008},
NUMBER = {1-3},
PAGES = {124--132},
ISSN = {0304-3975},
CODEN = {TCSDI},
MRCLASS = {91A46 (91A05)},
MRNUMBER = {MR2397246},
}
@article {MR2424326,
AUTHOR = {Nedev, Zhivko and Quas, Anthony},
TITLE = {Balanced sets and the vector game},
JOURNAL = {Int. J. Number Theory},
FJOURNAL = {International Journal of Number Theory},
VOLUME = {4},
YEAR = {2008},
PAGES = {339--347},
ISSN = {1793-0421},
MRCLASS = {11B75},
MRNUMBER = {MR2424326},
}
@article {NeSe1992,
AUTHOR = {Negro, Alberto and Sereno, Matteo},
TITLE = {Solution of {U}lam's problem on binary search with three lies},
JOURNAL = {J. Combin. Theory Ser. A},
FJOURNAL = {Journal of Combinatorial Theory. Series A},
VOLUME = {59},
YEAR = {1992},
PAGES = {149--154},
ISSN = {0097-3165},
CODEN = {JCBTA7},
MRCLASS = {05A99 (90D40)},
MRNUMBER = {MR1141331 (92h:05013)},
}
@article {MR1190120,
AUTHOR = {Negro, Alberto and Sereno, Matteo},
TITLE = {Ulam's searching game with three lies},
JOURNAL = {Adv. in Appl. Math.},
FJOURNAL = {Advances in Applied Mathematics},
VOLUME = {13},
YEAR = {1992},
PAGES = {404--428},
ISSN = {0196-8858},
MRCLASS = {90D40 (68P10 94B25 94B65)},
MRNUMBER = {MR1190120 (93i:90129)},
MRREVIEWER = {Daniel Elliott Loeb},
}
@article{NeSo2001,
author = {J. Ne\v{s}et\v{r}il and E. Sopena},
year = 2001,
title = {On the oriented game chromatic number},
journal = {Electr. J. Combin.},
volume = {8(2)},
pages = {\#R14, 13 pp.},
url = {http://www.combinatorics.org/},
note = {Volume in honor of Aviezri S. Fraenkel},
mrnumber = {MR1853265 (2002h:05069)},
}
@incollection{NeTh1987,
author = {J. Ne\v{s}et\v{r}il and R. Thomas},
year = 1987,
title = {Well quasi ordering, long games and combinatorial study of undecidability},
pages = {281-293},
editor = {S. G. Simpson},
publisher = {Amer. Math. Soc., Providence, RI},
volume = 65,
booktitle = {Logic and Combinatorics, Contemp. Math.},
}
@incollection{NeNo1993,
author = {S. Neufeld and R. J. Nowakowski},
year = 1993,
title = {A vertex-to-vertex pursuit game played with disjoint sets of edges},
pages = {299-312},
editor = {N. W. Sauer and others},
publisher = {Kluwer, Dordrecht},
booktitle = {Finite and Infinite Combinatorics in Sets and Logic},
}
@article{NeNo1998,
author = {S. Neufeld and R. J. Nowakowski},
year = 1998,
title = {A game of cops and robbers played on products of graphs},
journal = {Discrete Math.},
volume = 186,
pages = {253-268},
}
@article{NMMRSW1999,
author = {J. Nievergelt and F. Maeser and B. Mann and
K. Roeseler and M. Schulze and C. Wirth},
year = 1999,
title = {CRASH! Mathematik und kombinatorisches Chaos
prallen aufeinander},
journal = {Informatik Spektrum},
volume = 22,
pages = {45-48},
note = {(German)},
}
@article {Niv2006,
AUTHOR = {Nivasch, Gabriel},
TITLE = {The {S}prague-{G}rundy function of the game {E}uclid},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {306},
YEAR = {2006},
NUMBER = {21},
PAGES = {2798--2800},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {91A46 (11A25)},
MRNUMBER = {MR2264378 (2007i:91039)},
MRREVIEWER = {Jaros{\l}aw A. Grytczuk},
}
@incollection{Niv2008,
author = {G. Nivasch},
year = 2008,
title = {More on the Sprague-Grundy function for
Wythoff's game},
pages = {},
editor = {M. H. Albert and R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {},
booktitle = {Games of No Chance III, \emph{Proc. BIRS Workshop on
Combinatorial Games, July, 2005, Banff, Alberta, Canada, MSRI Publ.}},
}
@article{Niv1988,
author = {I. Niven},
year = 1988,
title = {Coding theory applied to a problem of Ulam},
journal = {Math. Mag.},
volume = 61,
pages = {275-281},
}
@article{NoVB2006,
author = {H. Noon and G. Van Brummelen},
year = 2006,
title = {The non-attacking queens game},
journal = {College Math. J.},
volume = 37,
pages = {223-227},
}
@incollection{Now1991,
author = {R. J. Nowakowski},
year = 1991,
title = {$\ldots$, Welter's game, Sylver coinage, dots-and-boxes, $\ldots$},
pages = {155-182},
editor = {R. K. Guy},
publisher = {Amer. Math. Soc., Providence, RI},
volume = 43,
booktitle = {Combinatorial Games, \emph{Proc. Symp. Appl. Math.}},
}
@article{NoOt2005,
author = {R. J. Nowakowski and P. Ottaway},
year = 2005,
title = {Vertex Deletion Games with Parity Rules},
journal = {Integers, Electr. J of Combinat. Number Theory},
volume = {5(2)},
pages = {\#A15, 16 pp.},
url = {http://www.integers-ejcnt.org/vol5(2).html},
mrnumber = {MR2192093},
}
@incollection{NoPo1996,
author = {R. J. Nowakowski and D. G. Poole},
year = 1996,
title = {Geography played on products of directed cycles},
pages = {329-337},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
editor = {R. J. Nowakowski},
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}
@inbook{NoSi2007,
author = {R. J. Nowakowski and A. A. Siegel},
year = 2007,
title = {Partizan geography on $K_n\times K_2$},
publisher = {de Gruyter},
pages = {389-401},
note = {Proc.\ Integers Conference, Carrollton, Georgia, October 27-30,2005,
in celebration of the 70th birthday of Ronald Graham. B.\ Landman,
M.\ Nathanson, J.\ Ne\v{s}et\v{r}il, R.\ Nowakowski, C. Pomerance eds.,
appeared also in {\it Integers, Electr.\ J.\ of Combinat.\ Number Theory\/} {\bf 7(20)},
special volume in honor of Ron Graham, \#A29, 14 pp.},
url = {http://www.integers-ejcnt.org/vol7(2).html},
MRNUMBER = {MR2337063},
}
@article{NoWi1983,
author = {R. Nowakowski and P. Winkler},
year = 1983,
title = {Vertex-to-vertex pursuit in a graph},
journal = {Discrete Math.},
volume = 43,
pages = {235-239},
}
@article{Nud1995,
author = {S. P. Nudelman},
year = 1995,
title = {The modular $n$-queens problem in higher dimensions},
journal = {Discrete Math.},
volume = 146,
pages = {159-167},
}
@book{OBe1984,
author = {T. H. {O'Beirne}},
year = 1984,
title = {Puzzles and Paradoxes},
publisher = {Dover, New York, NY. (Appeared previously by Oxford
University Press, London, 1965.)},
}
@article{OBr1978,
author = {G. L. {O'Brian}},
title = {The graph of positions in the game of {SIM}},
journal = {J. Recr. Math.},
year = {1978-79},
volume = 11,
pages = {3-9},
}
@article{Ols1985,
author = {J. Olson},
title = {A balancing strategy},
journal = {J. Combin. Theory Ser. A},
year = {1985},
volume = 40,
pages = {175-178},
}
@article{OoAk2003,
author = {T. Ooya and J. Akiyama},
title = {Impact of binary and Fibonacci expansions of numbers on winning
strategies for Nim-like games},
journal = {Internat. J. Math. Ed. Sci. Tech.},
year = {2003},
volume = 34,
pages = {121-128},
mrnumber = {MR1958736},
}
@incollection{Orm1996,
author = {H. K. Orman},
year = 1996,
title = {Pentominoes: a first player win},
pages = {339-344},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}
@article{OsWe2001,
author = {P. R. J. \"{O}sterg\aa rd and W. D. Weakley},
year = 2001,
title = {Values of domination numbers of the queen's graph},
journal = {Electr. J. Combin.},
volume = {8(1)},
url = {http://www.combinatorics.org/},
pages = {\#R29, 19 pp.},
}
@article{Pac1992,
author = {J. Pach},
year = 1992,
title = {On the game of Misery},
journal = {Studia Sci. Math. Hungar.},
volume = 27,
pages = {355-360},
}
@article{Pac1987,
author = {E. W. Packel},
year = 1987,
title = {The algorithm designer versus nature: a game-theo\-re\-tic
approach to information-based complexity},
journal = {J. Complexity},
volume = 3,
pages = {244-257},
}
@article{Pap1985,
author = {C. H. Papadimitriou},
year = 1985,
title = {Games against nature},
journal = {J. Comput. System Sci.},
volume = 31,
pages = {288-301},
}
@book{Pap1994,
author = {C. H. Papadimitriou},
title = {Computational Complexity},
publisher = {Addison-Wesley},
year = 1994,
note = {Chapter 19: Polynomial Space},
}
@inproceedings{PRST1994,
author = {C. H. Papadimitriou and P. Raghavan and M. Sudan and H. Tamaki},
year = 1994,
title = {Motion planning on a graph (extended abstract)},
booktitle = {Proc. 35-th Annual IEEE Symp. on Foundations of Computer
Science},
pages = {511-520},
address = {Santa Fe, NM},
}
@article{Pap1982,
author = {A. Papaioannou},
year = 1982,
title = {A Hamiltonian game},
journal = {Ann. Discrete Math.},
volume = 13,
pages = {171-178},
}
@book{Pap1994a,
author = {T. Pappas},
year = 1994,
title = {The Magic of Mathematics},
publisher = {Wide World, San Carlos},
}
@book{Par1999,
author = {D. Parlett},
title = {The Oxford History of Board Games},
publisher = {Oxford University Press},
year = 1999,
}
@incollection{Par1978,
author = {T. D. Parsons},
year = 1978,
title = {Pursuit-evasion in a graph},
editor = {Y. Alavi and D. R. Lick},
pages = {426-441},
publisher = {Springer-Verlag},
booktitle = {Theory and Applications of Graphs},
}
@inproceedings{Par1978a,
author = {T. D. Parsons},
year = 1978,
title = {The search number of a connected graph},
booktitle = {Proc. 9th South-Eastern Conf. on Combinatorics, Graph
Theory, and Computing,},
pages = {549-554},
}
@article{Pat1980,
author = {O. Patashnik},
year = 1980,
title = {Qubic: $4\times 4\times 4$ Tic-Tac-Toe},
journal = {Math. Mag.},
volume = 53,
pages = {202-216},
}
@article{Pau1978,
author = {J. L. Paul},
year = 1978,
title = {Tic-Tac-Toe in $n$ dimensions},
journal = {Math. Mag.},
volume = 51,
pages = {45-49},
}
@article{PPR1980,
author = {W. J. Paul and E. J. Prauss and R. Reischuk},
year = 1980,
title = {On alternation},
journal = {Acta Informatica},
volume = 14,
pages = {243-255},
}
@article{PaRe1980,
author = {W. J. Paul and R. Reischuk},
year = 1980,
title = {On alternation, II},
journal = {Acta Informatica},
volume = 14,
pages = {391-403},
}
@article{PTC1976,
author = {W. J. Paul and R. E. Tarjan and J. R. Celoni},
year = {1976/77},
title = {Space bounds for a game on graphs},
journal = {Math. Systems Theory},
volume = 10,
pages = {239-251},
note = {correction ibid. {\bf 11} (1977/78), 85. First appeared in
Eighth Annual ACM Symposium on Theory of Computing (Hershey, Pa., 1976),
Assoc. Comput. Mach., New York, NY, 1976, pp 149--160.},
}
@article{Pau1999,
author = {M. M. Paulhus},
year = {1999},
title = {Beggar my neighbour},
journal = {Amer. Math. Monthly},
volume = 106,
pages = {162-165},
}
@article{Pea1980,
author = {J. Pearl},
year = 1980,
title = {Asymptotic properties of minimax trees and game-sear\-ching procedures},
journal = {Artificial Intelligence},
volume = 14,
pages = {113-138},
}
@book{Pea1984,
author = {J. Pearl},
year = 1984,
title = {Heuristics: Intelligent Search Strategies for Computer Problem Solving},
publisher = {Addison-Wesley, Reading, MA},
}
@article{Ped2002,
author = {A. Pedrotti},
year = 2002,
title = {Playing by searching: two strategies against a linearly bounded
liar},
journal = {Theoret. Comput. Sci.},
volume = 282,
pages = {285-302},
note = {special "Fun With Algorithms" issue},
mrnumber = {MR1909053 (2003m:91010)},
}
@article{Pek1996,
author = {A. Peke\v{c}},
year = 1996,
title = {A winning strategy for the Ramsey graph game},
journal = {Combin. Probab. Comput.},
volume = 5,
pages = {267-276},
}
@article {Pel1986,
AUTHOR = {Pelc, Andrzej},
TITLE = {Lie patterns in search procedures},
JOURNAL = {Theoret. Comput. Sci.},
FJOURNAL = {Theoretical Computer Science},
VOLUME = {47},
YEAR = {1986},
PAGES = {61--69},
ISSN = {0304-3975},
CODEN = {TCSDI},
MRCLASS = {68P10 (05A99)},
MRNUMBER = {MR871464 (88b:68020)},
}
@article{Pel1987,
author = {A. Pelc},
year = 1987,
title = {Solution of Ulam's problem on searching with a lie},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 44,
pages = {129-140},
}
@article{Pel1988,
author = {A. Pelc},
year = 1988,
title = {Prefix search with a lie},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 48,
pages = {165-173},
}
@article{Pel1989,
author = {A. Pelc},
year = 1989,
title = {Detecting errors in searching games},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 51,
pages = {43-54},
}
@article{Pel2002,
author = {A. Pelc},
year = 2002,
title = {Searching games with errors---fifty years of coping with liars},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 270,
pages = {71-109},
mrnumber = {MR1871067 (2002h:68040)},
}
@article{Pel1987a,
author = {D. H. Pelletier},
year = 1987,
title = {Merlin's magic square},
journal = {Amer. Math. Monthly},
volume = 94,
pages = {143-150},
}
@article{PeYa1998,
author = {H. Peng and C. H. Yan},
year = 1998,
title = {Balancing game with a buffer},
journal = {Adv. in Appl. Math.},
volume = 21,
pages = {193-204},
}
@article{PSSW2007,
author = {Y. Peres and O. Schramm and S. Sheffield and D. B. Wilson},
year = 2007,
title = {Random-turn Hex and other selection games},
journal = {Amer. Math. Monthly},
volume = {114},
pages = {373-387},
}
@misc{Pet1979,
author = {G. L. Peterson},
title = {Press-Ups is Pspace-complete},
note = {unpublished manuscript},
year = 1979,
howpublished = {Dept. of Computer Science, The University of Rochester,
Rochester New York, 14627},
month = jan,
}
@inproceedings{PeRe1979,
author = {G. L. Peterson and J. H. Reif},
year = 1979,
title = {Multiple-person alternation},
booktitle = {Proc. 20th Ann. Symp. Foundations Computer Science
\emph{(San Juan, Puerto Rico, Oct. 1979)}},
organization = {IEEE Computer Soc., Long Beach, CA},
pages = {348-363},
}
@article{Pic2002,
author = {C. Pickover},
year = 2002,
title = {The fractal society},
journal = {{\rm in:} Puzzler's Tribute: a Feast for the Mind{\rm ,}},
chapter = {},
pages = {377-381},
note = {honoring Martin Gardner (D. Wolfe and T. Rodgers, eds.),
A K Peters, Natick, MA},
publisher = {},
}
@article{Oik2003,
author = {O. Pikhurko},
year = 2003,
title = {Breaking symmetry on complete bipartite graphs of odd size},
journal = {Integers, Electr. J. of Combinat. Number Theory},
volume = 3,
pages = {\#G4, 9 pp., Comb. Games Sect.},
url = {http://www.integers-ejcnt.org/vol3.html},
mrnumber = {MR2036488 (2004k:05117)},
}
@inproceedings{Pip1980,
author = {N. Pippenger},
year = 1980,
title = {Pebbling},
booktitle = {Proc. 5th IBM Symp. Math. Foundations of Computer Science},
organization = {IBM, Japan, 19 pp.},
}
@inproceedings{Pip1982,
author = {N. Pippenger},
year = 1982,
title = {Advances in pebbling},
booktitle = {Proc. 9th Internat. Colloq. Automata, Languages and
Programming, \emph{Lecture Notes in Computer Science}},
editor = {M. Nielson and E. M. Schmidt},
volume = 140,
pages = {407-417},
publisher = {Springer Verlag, New York, NY},
}
@article{Pla1992,
author = {T. E. Plambeck},
year = 1992,
title = {Daisies, Kayles, and the Sibert--Conway decomposition in
mis\`ere octal games},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 96,
pages = {361-388},
mrnumber = {MR1160551 (93c:90108)},
}
@article{Pla2005,
author = {T. E. Plambeck},
year = 2005,
title = {Taming the wild in impartial combinatorial games},
journal = {Integers, Electr. J. of Combinat. Number Theory},
volume = 5,
pages = {\#G5(1), 36 pp., Comb. Games Sect.},
url = {http://www.integers-ejcnt.org/vol5.html},
mrnumber = {MR2192253 (2006g:91044)},
}
@incollection{Pla2008,
author = {T. Plambeck},
year = 2008,
title = {Advances in losing},
pages = {},
editor = {M. H. Albert and R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {},
booktitle = {Games of No Chance III, \emph{Proc. BIRS Workshop on
Combinatorial Games, July, 2005, Banff, Alberta, Canada, MSRI Publ.}},
}
@incollection{Ple1991,
author = {V. Pless},
year = 1991,
title = {Games and codes},
pages = {101-110},
editor = {R. K. Guy},
publisher = {Amer. Math. Soc., Providence, RI},
volume = 43,
booktitle = {Combinatorial Games, \emph{Proc. Symp. Appl. Math.}},
}
@article{Plu2002,
author = {A. Pluh\'{a}r},
year = 2002,
title = {The accelerated $k$-in-a-row game},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 270,
pages = {865-875},
mrnumber = {MR1871100 (2002i:05017)},
}
@book{PoSc1991,
author = {R. Polizzi and F. Schaefer},
title = {Spin Again},
publisher = {Chronicle Books},
year = 1991,
}
@inbook{Pol1921,
author = {G. P\'{o}lya},
year = 1921,
title = {\"{U}ber die ``doppelt-periodischen'' L\"{o}sungen des
$n$-Damen-Problems, in: W. Ahrens, Mathematische Unterhaltungen und
Spiele, Vol. {\rm 1}},
publisher = {B.G. Teubner, Leipzig, 1918},
note= {also appeared in vol. IV of P\'{o}lya's Collected Works,
MIT Press, Cambridge, London, 1984
(G.-C Rota ed.), pp. 237-247.},
pages = {364-374},
}
@article{Poo1992,
author = {D. Poole},
year = 1992,
title = {The bottleneck towers of Hanoi problem},
journal = {J. Recr. Math.},
volume = 24,
pages = {203-207},
}
@article{Poo1994,
author = {D. G. Poole},
year = 1994,
title = {The towers and triangles of Professor Claus (or, Pascal
knows Hanoi)},
journal = {Math. Mag.},
volume = 67,
pages = {323-344},
}
@article{Poo2002,
author = {O. Pretzel},
year = 2002,
title = {Characterization of simple edge-firing games},
journal = {Inform. Process. Lett.},
volume = 84,
pages = {235-236},
mrnumber = {MR1931725 (2003i:05128)},
}
@book{Pri1994,
author = {D. Pritchard},
title = {The Family Book of Games},
publisher = {Sceptre Books, Time-Life Books, Brockhampton Press},
year = 1994,
}
@incollection{Pro1994,
author = {J. Propp},
year = 1994,
title = {A new take-away game},
pages = {212-221},
editor = {R. K. Guy and R. E. Woodrow},
booktitle = {The Lighter Side of Mathematics, \emph{Proc. E. Strens
Memorial Conf. on Recr. Math. and its History, Calgary, 1986, Spectrum
Series}},
publisher = {Math. Assoc. of America, Washington, DC},
}
@incollection{Pro1996,
author = {J. Propp},
year = 1996,
title = {About David Richman (Prologue to the paper by J. D.
Lazarus et al.)},
editor = {R. J. Nowakowski},
pages = {437},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}
@article{Pro2000,
author = {J. Propp},
year = {2000},
title = {Three-player impartial games},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 233,
pages = {263-278},
mrnumber = {MR1732189 (2001i:91040)},
}
@article{PrUl1992,
author = {J. Propp and D. Ullman},
year = 1992,
title = {On the cookie game},
journal = {Internat. J. Game Theory},
volume = 20,
pages = {313-324},
mrnumber = {MR1163932 (93b:90131)},
}
@incollection{PuSg1997,
author = {P. Pudl\'ak and J. Sgall},
year = 1997,
title = {An upper bound for a communication game related to time-space
tradeoffs},
editor = {R. L. Graham and J. Ne\v{s}et\v{r}il},
pages = {393-399},
volume = {I},
booktitle = {The Mathematics of Paul Erd\H os},
publisher = {Springer},
address = {Berlin}
}
@article{PuMo1984,
author = {A. Pultr and F. L. Morris},
year = 1984,
title = {Prohibiting repetitions makes playing games substantially harder},
journal = {Internat. J. Game Theory},
volume = 13,
pages = {27-40},
}
@article{PuUl1985,
author = {A. Pultr and J. \'Ulehla},
year = 1985,
title = {Remarks on strategies in combinatorial games},
journal = {Discrete Appl. Math.},
volume = 12,
pages = {165-173},
}
@article{Qui1983,
author = {A. Quilliot},
year = 1983,
title = {Discrete pursuit games},
journal = {Congr. Numer.},
volume = 38,
pages = {227-241},
note = {Proc. 13th Southeastern Conf. on Combinatorics, Graph Theory
and Computing, Boca Raton, FL, 1982},
}
@article{Qui1985,
author = {A. Quilliot},
year = 1985,
title = {A short note about pursuit games played on a graph with a given genus},
journal = {J. Combin. Theory \emph{(Ser.~B)}},
volume = 38,
pages = {89-92},
}
@article{Rab1957,
author = {M. O. Rabin},
year = 1957,
title = {Effective computability of winning strategies},
journal = {Ann. of Math. Stud. \emph{(Contributions to the Theory of Games), Princeton}},
volume = 3,
number = 39,
pages = {147-157},
}
@inproceedings{Rab1976,
author = {M. O. Rabin},
year = 1976,
title = {Probabilistic algorithms},
booktitle = {Proc. Symp. on New Directions and Recent Results in
Algorithms and Complexity},
editor = {J. F. Traub},
organization = {Carnegie-Mellon, Academic Press, New York, NY},
pages = {21-39},
}
@article{RaWa1990,
author = {D. Ratner and M. Warmuth},
year = 1990,
title = {The $(n\sp 2-1)$-puzzle and related relocation problems},
journal = {J. Symbolic Comput.},
volume = 10,
pages = {111-137},
}
@article{Rav2004,
author = {B. Ravikumar},
year = 2004,
title = {Peg-solitaire, string rewriting systems and finite automata},
booktitle = {Proc. 8th Internat. Symp. Algorithms and Computation},
journal = {Theoret. Comput. Sci.},
volume = 321,
pages = {383-394},
note = {Appeared first under same title in Proc. 8th Internat.
Symp. Algorithms and Computation, Singapore, 233-242, 1997, MR 2005e:68119},
mrnumber = {MR2076153 (2005e:68119)},
}
@incollection {RaLa1982,
AUTHOR = {Ravikumar, B. and Lakshmanan, K. B.},
TITLE = {Coping with known patterns of lies in a search game},
BOOKTITLE = {Foundations of software technology and theoretical computer
science {\rm (}Bangalore, 1982{\rm )}},
PAGES = {363--377},
PUBLISHER = {Nat. Centre Software Develop. Comput. Tech.},
ADDRESS = {Bombay},
YEAR = {1982},
MRCLASS = {68E05 (90D05)},
MRNUMBER = {MR678245 (83m:68114)},
}
@article{RaLa1984,
author = {B. Ravikumar and K. B. Lakshmanan},
year = 1984,
title = {Coping with known patterns of lies in a search game},
journal = {Theoret. Comput. Sci.},
volume = 33,
pages = {85-94},
}
@article{Rea1999,
author = {N. Reading},
year = 1999,
title = {Nim-regularity of graphs},
journal = {Electr. J. Combinatorics},
volume = 6,
pages = {\#R11, 8 pp.},
url = {http://www.combinatorics.org/},
}
@article{Rei1987,
author = {M. Reichling},
year = 1987,
title = {A simplified solution of the $N$ queens' problem},
journal = {Inform. Process. Lett.},
volume = 25,
pages = {253-255},
}
@article{Rei1984,
author = {J. H. Reif},
year = 1984,
title = {The complexity of two-player games of incomplete information},
journal = {J. Comput. System Sci.},
volume = 29,
pages = {274-301},
note = {earlier draft entitled Universal games of incomplete information,
appeared in Proc. 11th Ann. ACM Symp. Theory of Computing (Atlanta, GA,
1979), Assoc. Comput. Mach., New York, NY, pp. 288--308},
}
@article{Rei1980,
author = {S. Reisch},
year = 1980,
title = {Gobang ist PSPACE-vollst\"andig},
journal = {Acta Informatica},
volume = 13,
pages = {59-66},
}
@article{Rei1981,
author = {S. Reisch},
year = 1981,
title = {Hex ist PSPACE-vollst\"andig},
journal = {Acta Informatica},
volume = 15,
pages = {167-191},
}
@article{Rei1857,
author = {M. Reiss},
year = 1857,
title = {Beitr\"age zur Theorie des Solit\"ar-Spiels},
journal = {Crelles Journal},
volume = 54,
pages = {344-379},
}
@inbook{Ren2001,
author = {P. Rendell},
year = 2001,
title = {{\rm Turing universality of the game of life, in:} Collision-Based Computing},
publisher = {Springer Verlag, London, UK},
chapter ={},
volume = {},
pages = {513 - 539},
}
@article{ReRo2000,
author = {C. S. ReVelle and K. E. Rosing},
year = 2000,
title = {Defendens imperium romanum [Defending the Roman Empire]: a
classical problem in military strategy},
journal = {Amer. Math. Monthly},
volume = 107,
pages = {585-594},
}
@article{Ric1953,
author = {M. Richardson},
year = 1953,
title = {Extension theorems for solutions of irreflexive relations},
journal = {Proc. Nat. Acad. Sci. USA},
volume = 39,
pages = {649},
}
@article{Ric1953a,
author = {M. Richardson},
year = 1953,
title = {Solutions of irreflexive relations},
journal = {Ann. of Math.},
volume = 58,
pages = {573-590},
}
@article{Rin1974,
author = {R. D. Ringeisen},
year = 1974,
title = {Isolation, a game on a graph},
journal = {Math. Mag.},
volume = 47,
pages = {132-138},
}
@article{RMKWS1980,
author = {R. L. Rivest and A. R. Meyer and D. J. Kleitman and K. Winklman
and J. Spencer},
year = 1980,
title = {Coping with errors in binary search procedures},
journal = {J. Comput. System Sci.},
volume = 20,
pages = {396-404},
}
@article{RVZ1994,
author = {I. Rivin and I. Vardi and P. Zimmermann},
year = 1994,
title = {The $n$-queens problem},
journal = {Amer. Math. Monthly},
volume = 101,
pages = {629-639},
}
@article{RiZa1992,
author = {I. Rivin and R. Zabih},
year = 1992,
title = {A dynamic programming solution to the $N$-queens problem},
journal = {Inform. Process. Lett.},
volume = 41,
pages = {253-256},
}
@article{RoMu1978,
author = {E. Robertson and I. Munro},
year = 1978,
title = {NP-completeness, puzzles and games},
journal = {Utilitas Math.},
volume = 13,
pages = {99-116},
}
@article{RoGo1989,
author = {A. G. Robinson and A. J. Goldman},
year = 1989,
title = {The set coincidence game: complexity, attainability, and
symmetric strategies},
journal = {J. Comput. System Sci.},
volume = 39,
pages = {376-387},
}
@article{RoGo1990,
author = {A. G. Robinson and A. J. Goldman},
year = 1990,
title = {On Ringeisen's isolation game},
journal = {Discrete Math.},
volume = 80,
pages = {297-312},
}
@article{RoGo1990a,
author = {A. G. Robinson and A. J. Goldman},
year = 1990,
title = {On the set coincidence game},
journal = {Discrete Math.},
volume = 84,
pages = {261-283},
}
@article{RoGo1991,
author = {A. G. Robinson and A. J. Goldman},
year = 1991,
title = {On Ringeisen's isolation game, II},
journal = {Discrete Math.},
volume = 90,
pages = {153-167},
}
@article{RoGo1993,
author = {A. G. Robinson and A. J. Goldman},
year = 1993,
title = {The isolation game for regular graphs},
journal = {Discrete Math.},
volume = 112,
pages = {173-184},
}
@inproceedings{Rob1983,
author = {J. M. Robson},
year = 1983,
title = {The complexity of Go},
booktitle = {Proc. Information Processing \emph{83}},
editor = {R. E. A. Mason},
organization = {Elsevier, Amsterdam},
pages = {413-417},
}
@inproceedings{Rob1984,
author = {J. M. Robson},
year = 1984,
title = {Combinatorial games with exponential space complete decision
problems},
booktitle = {Proc. 11th Symp. Math. Foundations of Computer Science,
\emph{Praha, Czechoslovakia, Lecture Notes in Computer Science}},
editor = {M. P. Chytil and V. Koubek},
volume = 176,
pages = {498-506},
publisher = {Springer},
address = {Berlin},
}
@article{Rob1984a,
author = {J. M. Robson},
year = 1984,
title = {$N$ by $N$ checkers is Exptime complete},
journal = {SIAM J. Comput.},
volume = 13,
pages = {252-267},
}
@article{Rob1985,
author = {J. M. Robson},
year = 1985,
title = {Alternation with restrictions on looping},
journal = {Inform. and Control},
volume = 67,
pages = {2-11},
}
@article{Rod1989,
author = {E. Y. Rodin},
year = 1989,
title = {A pursuit-evasion bibliography -- version 2},
journal = {Comput. Math. Appl.},
volume = 18,
pages = {245-320},
}
@article{Roh1983,
author = {J. S. Rohl},
year = 1983,
title = {A faster lexicographical $n$-queens algorithm},
journal = {Inform. Process. Lett.},
volume = 17,
pages = {231-233},
}
@article{RoGe1986,
author = {J. S. Rohl and T. D. Gedeon},
year = 1986,
title = {The Reve's puzzle},
journal = {Comput. J.},
volume = 29,
pages = {187-188},
note = {Corrigendum, {\it Ibid.} {\bf 31} (1988), 190},
}
@article{RoPe1983,
author = {I. Roizen and J. Pearl},
year = 1983,
title = {A minimax algorithm better than alpha-beta? Yes and no},
journal = {Artificial Intelligence},
volume = 21,
pages = {199-220},
}
@article{Ros1993,
author = {I. Rosenholtz},
year = 1993,
title = {Solving some variations on a variant of Tic-Tac-Toe using invariant subsets},
journal = {J. Recr. Math.},
volume = 25,
pages = {128-135},
}
@article{Ros1953,
author = {A. S. C. Ross},
year = 1953,
title = {The name of the game of Nim, Note 2334},
journal = {Math. Gaz.},
volume = 37,
pages = {119-120},
}
@article{Rot1978,
author = {A. E. Roth},
year = 1978,
title = {A note concerning asymmetric games on graphs},
journal = {Naval Res. Logistics},
volume = 25,
pages = {365-367},
}
@article{Rot1978a,
author = {A. E. Roth},
year = 1978,
title = {Two-person games on graphs},
journal = {J. Combin. Theory \emph{(Ser.~B)}},
volume = 24,
pages = {238-241},
}
@article{Rot1974,
author = {T. Roth},
year = 1974,
title = {The tower of Brahma revisited},
journal = {J. Recr. Math.},
volume = 7,
pages = {116-119},
}
@article{RoYa1974,
author = {E. M. Rounds and S. S. Yau},
year = 1974,
title = {A winning strategy for SIM},
journal = {J. Recr. Math.},
volume = 7,
pages = {193-202},
}
@article{Ruz1980,
author = {W. L. Ruzzo},
year = 1980,
title = {Tree-size bounded alternation},
journal = {J. Comput. Systems Sci.},
volume = 21,
pages = {218-235},
}
@book{Sac1969,
author = {S. Sackson},
year = 1969,
title = {A Gamut of Games},
publisher = {Random House},
}
@article{SaSe2003,
author = {I. Safro and L. Segel},
year = 2003,
title = {Collective stochastic versions of playable games as metaphors
for complex biosystems: team Connect Four},
journal = {Complexity},
volume = {8 {\rm issue 5}},
pages = {46-55},
mrnumber = {MR2018947},
}
@inproceedings{SaWi1986,
author = {M. Saks and A. Wigderson},
year = 1986,
title = {Probabilistic Boolean decision trees and the complexity of
evaluating game trees},
booktitle = {Proc. 27th Ann. Symp. Foundations of Computer Science
\emph{(Toronto, Ont., Canada)}},
organization = {IEEE Computer Soc., Washington, DC},
pages = {29-38},
}
@article{SSS2004,
author = {D. Samet and I. Samet and D. Schmeidler},
year = 2004,
title = {One observation behind two-envelope puzzles},
journal = {Amer. Math. Monthly},
volume = 111,
pages = {347-351},
mrnumber = {MR2057189 (2005e:00005)},
}
@article{Sap2004,
author = {A. Sapir},
year = 2004,
title = {The tower of Hanoi with forbidden moves},
journal = {Comput. J.},
volume = 47,
pages = {20-24},
}
@article{Sar2000,
author = {U. K. Sarkar},
year = 2000,
title = {On the design of a constructive algorithm to solve the multi-peg
towers of Hanoi problem},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 237,
pages = {407-421},
mrnumber = {MR1756218 (2001k:05025)},
}
@article{Sat1972,
author = {M. Sato},
year = 1972,
title = {Grundy functions and linear games},
journal = {Publ. Res. Inst. Math. Sciences, \emph{Kyoto Univ.}},
volume = 7,
pages = {645-658},
}
@article{ScSp1984,
author = {F. Scarioni and H. G. Speranza},
year = 1984,
title = {A probabilistic analysis of an error-correcting algorithm
for the Towers of Hanoi puzzle},
journal = {Inform. Process. Lett.},
volume = 18,
pages = {99-103},
}
@book{Sch1955,
author = {W. L. Schaaf},
year = {1955, 1970, 1973, 1978},
title = {A Bibliography of Recreational Mathematics},
volume = {I -- IV},
publisher = {Nat'l. Council of Teachers of Mathematics, Reston, VA},
}
@inproceedings{Sch1976,
author = {T. J. Schaefer},
year = 1976,
title = {Complexity of decision problems based on finite two-person
perfect information games},
booktitle = {Proc. 8th Ann. ACM Symp. Theory of Computing
\emph{(Hershey, PA, 1976)}},
organization = {Assoc. Comput. Mach., New York, NY},
pages = {41-49},
}
@article{Sch1978,
author = {T. J. Schaefer},
year = 1978,
title = {On the complexity of some two-person perfect-in\-for\-ma\-tion games},
journal = {J. Comput. System Sci.},
volume = 16,
pages = {185-225},
}
@article {SBBKMLLS2007,
AUTHOR = {Schaeffer, Jonathan and Burch, Neil and Bj{\"o}rnsson, Yngvi
and Kishimoto, Akihiro and M{\"u}ller, Martin and Lake, Robert
and Lu, Paul and Sutphen, Steve},
TITLE = {Checkers is solved},
JOURNAL = {Science},
FJOURNAL = {American Association for the Advancement of Science. Science},
VOLUME = {317},
YEAR = {2007},
NUMBER = {5844},
PAGES = {1518--1522},
ISSN = {0036-8075},
CODEN = {SCIEAS},
MRCLASS = {68T20 (91A46)},
MRNUMBER = {MR2348441},
}
@incollection{Sch1996,
author = {J. Schaeffer and R. Lake},
year = 1996,
title = {Solving the game of checkers},
pages = {119-133},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
url = {http://www.msri.org/publications/books/Book29/files/schaeffer.ps.gz},
}
@article{Sch1994,
author = {M. Scheepers},
year = 1994,
title = {Variations on a game of Gale (II): Markov strategies},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 129,
pages = {385-396},
}
@article {MR2270619,
AUTHOR = {Schleicher, Dierk and Stoll, Michael},
TITLE = {An introduction to {C}onway's games and numbers},
JOURNAL = {Mosc. Math. J.},
FJOURNAL = {Moscow Mathematical Journal},
VOLUME = {6},
YEAR = {2006},
NUMBER = {2},
PAGES = {359--388, 407},
ISSN = {1609-3321},
MRCLASS = {91A46 (91A05 91A70)},
MRNUMBER = {MR2270619 (2007m:91033)},
MRREVIEWER = {Bernhard von Stengel},
}
@article{ScSt1985,
author = {G. Schmidt and T. Str\"ohlein},
year = 1985,
title = {On kernels of graphs and solutions of games: a synopsis based on
relations and fixpoints},
journal = {SIAM J. Alg. Disc. Math.},
volume = 6,
pages = {54-65},
}
@book{Sch1992,
author = {R. W. Schmittberger},
year = 1992,
title = {New Rules for Classic Games},
publisher = {Wiley, New York},
}
@article{Sch1985,
author = {G. Schrage},
year = 1985,
title = {A two-dimensional generalization of Grundy's game},
journal = {Fibonacci Quart.},
volume = 23,
pages = {325-329},
}
@book{Sch1953,
author = {H. Schubert},
year = 1953,
title = {Mathematische Mussestunden},
note = {neubearbeitet von F. Fitting, Elfte Auflage},
publisher = {De Gruyter, Berlin},
}
@article{Sch1952,
author = {F. Schuh},
year = 1952,
title = {Spel van delers (The game of divisors)},
journal = {Nieuw Tijdschrift voor Wiskunde},
volume = 39,
pages = {299-304},
}
@book{Sch1968,
author = {F. Schuh},
year = 1968,
title = {The Master Book of Mathematical Recreations},
note = {translated by F. G\"obel, edited by T. H. O'Beirne},
publisher = {Dover, New York, NY},
}
@article{Sch1971,
author = {B. L. Schwartz},
year = 1971,
title = {Some extensions of Nim},
journal = {Math. Mag.},
volume = 44,
pages = {252-257},
}
@inbook{Sch1979,
editor = {B. L. Schwartz},
title = {Mathematical solitaires and games},
pages = {37-81},
publisher = {Baywood Publishing Company},
year = 1979,
address = {Farmingdale, NY},
}
@article{Sch1970,
author = {A. J. Schwenk},
year = 1970,
title = {Take-away games},
journal = {Fibonacci Quart.},
volume = 8,
pages = {225-234},
}
@article {MR1141559,
AUTHOR = {Schwenk, Allen J.},
TITLE = {Which rectangular chessboards have a knight's tour?},
JOURNAL = {Math. Mag.},
FJOURNAL = {Mathematics Magazine},
VOLUME = {64},
YEAR = {1991},
PAGES = {325--332},
ISSN = {0025-570X},
CODEN = {MAMGA8},
MRCLASS = {05C45 (05C38)},
MRNUMBER = {MR1141559 (93c:05081)},
MRREVIEWER = {Robin J. Wilson},
}
@article{Sch2000,
author = {A. J. Schwenk},
year = 2000,
title = {What is the correct way to seed a knockout tournament?},
journal = {Amer. Math. Monthly},
volume = 107,
pages = {140-150},
}
@article{SGS1944,
author = {R. S. Scorer and P. M. Grundy and C. A. B. Smith},
year = 1944,
title = {Some binary games},
journal = {Math. Gaz.},
volume = 280,
pages = {96-103},
}
@article {MR1664741,
AUTHOR = {Sereno, Matteo},
TITLE = {Binary search with errors and variable cost queries},
JOURNAL = {Inform. Process. Lett.},
FJOURNAL = {Information Processing Letters},
VOLUME = {68},
YEAR = {1998},
PAGES = {261--270},
ISSN = {0020-0190},
CODEN = {IFPLAT},
MRCLASS = {68P10},
MRNUMBER = {MR1664741 (99i:68026)},
}
@article{Ser1992,
author = {{\'A}. Seress},
year = 1992,
title = {On Hajnal's triangle-free game},
journal = {Graphs Combin.},
volume = 8,
pages = {75-79},
}
@article{SeSz1999,
author = {{\'A}. Seress and T. Szab\'o},
year = 1999,
title = {On Erd\"os' Eulerian trail game},
journal = {Graphs Combin.},
volume = 15,
pages = {233-237},
}
@article{Sga2001,
author = {J. Sgall},
year = 2001,
title = {Solution of David Gale's lion and man problem},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 259,
pages = {663-670},
mrnumber = {MR1832815 (2002b:91025)},
}
@article{Sha1978,
author = {L. E. Shader},
year = 1978,
title = {Another strategy for SIM},
journal = {Math. Mag.},
volume = 51,
pages = {60-64},
}
@inproceedings{ShCo1980,
author = {L. E. Shader and M. L. Cook},
title = {A winning strategy for the second player in the game {T}ri-tip},
booktitle = {Proc. Tenth S.E. Conference on Computing, Combinatorics and Graph Theory},
year = 1980,
address = {Utilitas, Winnipeg},
}
@article{Sha1979,
author = {A. S. Shaki},
year = 1979,
title = {Algebraic solutions of partizan games with cycles},
journal = {Math. Proc. Camb. Phil. Soc.},
volume = 85,
pages = {227-246},
}
@incollection{SRA1981,
author = {A. Shamir and R. L. Rivest and L. M. Adleman},
year = 1981,
title = {Mental Poker},
pages = {37-43},
editor = {D. A. Klarner},
publisher = {Wadsworth Internat., Belmont, CA},
booktitle = {The Mathematical Gardner},
}
@article{Oik2005,
author = {A. Shankar and M. Sridharan},
year = 2005,
title = {New temparatures in Domineering},
journal = {Integers, Electr. J. of Combinat. Number Theory},
volume = 5,
pages = {\#G04, 13 pp., Comb. Games Sect.},
url = {http://www.integers-ejcnt.org/vol5.html},
mrnumber = {MR2139167 (2006c:91036)},
}
@article {MR0034095,
AUTHOR = {Shannon, Claude E.},
TITLE = {Programming a computer for playing chess},
JOURNAL = {Philos. Mag. {\rm(}Ser. 7{\rm)}},
VOLUME = {41},
YEAR = {1950},
PAGES = {256--275},
MRCLASS = {65.0X},
MRNUMBER = {MR0034095 (11,543f)},
}
@inbook{She2007,
author = {K. Shelton},
year = 2007,
title = {The game of take turn},
publisher = {de Gruyter},
pages = {413-430},
note = {Proc.\ Integers Conference, Carrollton, Georgia, October 27-30,2005,
in celebration of the 70th birthday of Ronald Graham. B.\ Landman,
M.\ Nathanson, J.\ Ne\v{s}et\v{r}il, R.\ Nowakowski, C. Pomerance eds.,
appeared also in {\it Integers, Electr.\ J.\ of Combinat.\ Number Theory\/} {\bf 7(20)},
special volume in honor of Ron Graham, \#A31, 18 pp.},
url = {http://www.integers-ejcnt.org/vol7(2).html},
MRNUMBER = {MR2337065},
}
@article{She2000,
author = {A. Shen},
year = 2000,
title = {Lights out},
journal = {Math. Intelligencer},
volume = {22 {\rm issue 3}},
pages = {20-21},
}
@book{ShWi1995,
author = {R. Sheppard and J. Wilkinson},
title = {Strategy Games: A Collection Of 50 Games \& Puzzles To
Stimulate Mathematical Thinking},
publisher = {Parkwest Publications},
year = 1995,
}
@article{She1978,
author = {G. J. Sherman},
year = 1978,
title = {A child's game with permutations},
journal = {Math. Mag.},
volume = 51,
pages = {67-68},
}
@article{SGHKLR2005,
author = {Z. Shi and W. Goddard and S. T. Hedetniemi and K. Kennedy
and R. Laskar and A. McRae},
year = 2005,
title = {An algorithm for partial Grundy numbers on trees},
journal = {Discrete Math.},
volume = 304,
pages = {108-116},
}
@article{SiCo1992,
author = {W. L. Sibert and J. H. Conway},
year = 1992,
title = {Mathematical Kayles},
journal = {Internat. J. Game Theory},
volume = 20,
pages = {237-246},
mrnumber = {MR1146325},
}
@article{Sic2002,
author = {G. Sicherman},
year = 2002,
title = {Theory and practice of Sylver coinage},
journal = {Integers, Electr. J. of Combinat. Number Theory},
volume = 2,
pages = {\#G2, 8 pp., Comb. Games Sect. },
url = {http://www.integers-ejcnt.org/vol2.html},
mrnumber = {MR1934618 (2003h:05026)},
}
@article{Sie2004,
author = {N. Sieben},
year = 2004,
title = {Snaky is a 41-dimensional winner},
journal = {Integers, Electr. J. of Combinat. Number Theory},
volume = 4,
pages = {\#G5, 4 pp., Comb. Games Sect.},
url = {http://www.integers-ejcnt.org/vol4.html},
mrnumber = {MR2116011},
}
@article {MR2117357,
AUTHOR = {Sieben, N{\'a}ndor and Deabay, Elaina},
TITLE = {Polyomino weak achievement games on 3-dimensional rectangular
boards},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {290},
YEAR = {2005},
PAGES = {61--78},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05B50 (91A43)},
MRNUMBER = {MR2117357 (2005h:05044)},
}
@misc{Sie2000,
author = {A. N. Siegel},
year = 2000,
title = {Combinatorial Game Suite},
note = {a software tool for investigating games},
url = {http://cgsuite.sourceforge.net/},
}
@article {Sie2006,
AUTHOR = {Siegel, Aaron N.},
TITLE = {Reduced canonical forms of stoppers},
JOURNAL = {Electron. J. Combin.},
FJOURNAL = {Electronic Journal of Combinatorics},
VOLUME = {13},
YEAR = {2006},
NUMBER = {1},
PAGES = {\#R57, 14 pp.},
url = {http://www.combinatorics.org/},
ISSN = {1077-8926},
MRCLASS = {91A46 (05C99)},
MRNUMBER = {MR2240763 (2007b:91030)},
}
@incollection{Sie2008a,
author = {A. N. Siegel},
year = 2008,
title = {Backsliding Toads and Frogs},
pages = {},
editor = {M. H. Albert and R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {},
booktitle = {Games of No Chance III, \emph{Proc. BIRS Workshop on
Combinatorial Games, July, 2005, Banff, Alberta, Canada, MSRI Publ.}},
}
@incollection{Sie2008b,
author = {A. N. Siegel},
year = 2008,
title = {Coping with cycles},
pages = {},
editor = {M. H. Albert and R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {},
booktitle = {Games of No Chance III, \emph{Proc. BIRS Workshop on
Combinatorial Games, July, 2005, Banff, Alberta, Canada, MSRI Publ.}},
}
@incollection{Sie2008c,
author = {A. N. Siegel},
year = 2008,
title = {Loopy games},
pages = {},
editor = {M. H. Albert and R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {},
booktitle = {Games of No Chance III, \emph{Proc. BIRS Workshop on
Combinatorial Games, July, 2005, Banff, Alberta, Canada, MSRI Publ.}},
}
@article{Sil1976,
author = {R. Silber},
year = 1976,
title = {A Fibonacci property of Wythoff pairs},
journal = {Fibonacci Quart.},
volume = 14,
pages = {380-384},
}
@article{Sil1977,
author = {R. Silber},
year = 1977,
title = {Wythoff's Nim and Fibonacci representations},
journal = {Fibonacci Quart.},
volume = 15,
pages = {85-88},
}
@article{Sil1993,
author = {J.-N. O. Silva},
year = 1993,
title = {Some game bounds depending on birthdays},
journal = {Portugaliae Math.},
volume = 50,
pages = {353-358},
}
@article{Sil1967,
author = {R. Silver},
year = 1967,
title = {The group of automorphisms of the game of 3-dimensional ticktacktoe},
journal = {Amer. Math. Monthly},
volume = 74,
pages = {247-254},
}
@book{Sil1971,
author = {D. L. Silverman},
year = 1971,
title = {Your Move},
publisher = {McGraw-Hill},
}
@article{Sim1969,
author = {G. J. Simmons},
year = 1969,
title = {The game of SIM},
journal = {J. Recr. Math.},
volume = 2,
pages = {66},
}
@article{Sin1981,
author = {D. Singmaster},
year = 1981,
title = {Almost all games are first person games},
journal = {Eureka},
volume = 41,
pages = {33-37},
}
@article{Sin1982,
author = {D. Singmaster},
year = 1982,
title = {Almost all partizan games are first person and almost all
impartial games are maximal},
journal = {J. Combin. Inform. System Sci.},
volume = 7,
pages = {270-274},
}
@article{Sin1999,
author = {D. Singmaster},
year = 1999,
title = {Some diophantine recreations},
journal = {{\rm in:} The Mathemagician and Pied Puzzler{\rm ,}},
chapter = {},
pages = {},
note = {honoring Martin Gardner; E. Berlekamp and T. Rodgers, eds.,
A K Peters, Natick, MA, pp. 219-235},
publisher = {},
}
@inproceedings{Sla2001,
author = {W. Slany},
year = 2001,
title = {The complexity of graph Ramsey games},
booktitle = {Proc. Intern. Conference on Computers and Games CG'2000},
organization = {Hamamatsu, Japan, Oct.\ 2000, Lecture Notes in Computer
Science, Springer},
volume = {2063},
pages = {186-203},
editor = {T. Marsland and I. Frank},
mrnumber = {MR1909610},
}
@article{Sla2002,
author = {W. Slany},
year = 2002,
title = {Endgame problems of Sim-like graph Ramsey avoidance
games are PSPACE-complete},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 289,
pages = {829-843},
mrnumber = {MR1933803 (2003h:05177)},
}
@article{Smi1966,
author = {C. A. B. Smith},
year = 1966,
title = {Graphs and composite games},
journal = {J. Combin. Theory},
volume = 1,
pages = {51-81},
note = {reprinted in slightly modified form in: {\it A Seminar on
Graph Theory} (F. Harary, ed.), Holt, Rinehart and Winston, New York, NY, 1967, pp. 86-111},
}
@article{Smi1968,
author = {C. A. B. Smith},
year = 1968,
title = {Compound games with counters},
journal = {J. Recr. Math.},
volume = 1,
pages = {67-77},
}
@article{Smi1971,
author = {C. A. B. Smith},
year = 1971,
title = {Simple game theory and its applications},
journal = {Bull. Inst. Math. Appl.},
volume = 7,
pages = {352-357},
}
@article{SmEa1911,
author = {D. E. Smith and C. C. Eaton},
year = 1911,
title = {Rithmomachia, the great medieval number game},
journal = {Amer. Math. Montly},
volume = 18,
pages = {73-80},
}
@article{SmSt2002,
author = {F. Smith and P. St\u{a}nic\u{a}},
year = 2002,
title = {Comply/constrain games or games with a Muller twist},
journal = {Integers, Electr. J. of Combinat. Number Theory},
volume = 2,
pages = {\#G3, 10 pp., Comb. Games Sect.},
url = {http://www.integers-ejcnt.org/vol2.html},
mrnumber = {MR1945951 (2003i:91029)},
}
@article{Smu2005,
author = {R. Smullyan},
year = 2005,
title = {G\"{o}delian puzzles},
journal = {{\rm in:} Tribute to a Mathemagician{\rm ,}},
chapter = {},
note = {honoring Martin Gardner (B. Cipra, E. D. Demaine,
M. L. Demaine and T. Rodgers, eds.),
A K Peters, Wellesley, MA, pp. 49-54.},
publisher = {},
}
@incollection{Sna2002,
author = {R. G. Snatzke},
year = 2002,
title = {Exhaustive search in Amazons},
pages = {261--278},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1973017},
}
@article{SoGu1990,
author = {R. Sosic and J. Gu},
year = 1990,
title = {A polynomial time algorithm for the $n$-queens problem},
journal = {SIGART},
volume = {1 {\rm issue 3}},
pages = {7-11},
}
@article{Spe1977,
author = {J. Spencer},
year = 1977,
title = {Balancing games},
journal = {J. Combin. Theory \emph{(Ser.~B)}},
volume = 23,
pages = {68-74},
}
@article{Spe1984,
author = {J. Spencer},
year = 1984,
title = {Guess a number with lying},
journal = {Math. Mag.},
volume = 57,
pages = {105-108},
}
@article{Spe1986,
author = {J. Spencer},
year = 1986,
title = {Balancing vectors in the max norm},
journal = {Combinatorica},
volume = 6,
pages = {55-65},
}
@article{Spe1991,
author = {J. Spencer},
year = 1991,
title = {Threshold spectra via the Ehrenfeucht game},
journal = {Discrete Appl. Math.},
volume = 30,
pages = {235-252},
}
@article{Spe1992,
author = {J. Spencer},
year = 1992,
title = {Ulam's searching game with a fixed number of lies},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 95,
pages = {307-321},
}
@article{Spe1994,
author = {J. Spencer},
year = 1994,
title = {Randomization, derandomization and antirandomization: three games},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 131,
pages = {415-429},
}
@article{Spi2001,
author = {Spight, W. L.},
year = 2001,
title = {Extended thermography for multile kos in go},
journal = {Theoret. Comput. Sci.},
volume = 252,
pages = {23-43},
note = {special "Computers and Games" issue; first version appeared in
Proc. 1st Intern. Conf. on Computer Games CG'98, {\rm Tsukuba, Japan, Nov.
1998,} \emph{Lecture Notes in Computer Science}, Vol. 1558, Springer,
pp. 232-251, 1999.},
mrnumber = {MR1806224 (2001k:91041)},
}
@incollection{Spi2002,
author = {Spight, W. L.},
year = 2002,
title = {Go thermography: the 4/2/98 Jiang-Rui endgame},
pages = {89-105},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1973007 (2004d:91050)},
}
@article{Spi1967,
author = {Spitznagel, Jr., E. L.},
year = 1967,
title = {A new look at the fifteen puzzle},
journal = {Math. Mag.},
volume = 40,
pages = {171-174},
}
@article{Spi1973,
author = {Spitznagel, Jr., E. L.},
year = 1973,
title = {Properties of a game based on Euclid's algorithm},
journal = {Math. Mag.},
volume = 46,
pages = {87-92},
}
@article{Spr1935,
author = {R. Sprague},
year = {1935--36},
title = {\"Uber mathematische Kampfspiele},
journal = {T\^oho\-ku Math. J.},
volume = 41,
pages = {438-444},
}
@article{Spr1937,
author = {R. Sprague},
year = 1937,
title = {\"Uber zwei Abarten von Nim},
journal = {T\^ohoku Math. J.},
volume = 43,
pages = {351-354},
}
@article{Spr1947,
author = {R. Sprague},
year = 1947,
title = {Bemerkungen \"uber eine spezielle Abelsche Gruppe},
journal = {Math. Z.},
volume = 51,
pages = {82-84},
}
@book{Spr1961,
author = {R. Sprague},
year = 1961,
title = {Unterhaltsame Mathematik},
note = {translation by T. H. O'Beirne: {\it Recreation in Mathematics},
Blackie, 1963},
publisher = {Vieweg and Sohn, Braunschweig, Paperback reprint},
}
@article{Sta2004,
author = {R. G. Stanton},
year = 2004,
title = {Some design theory games},
journal = {Bull. Inst. Combin. Appl.},
volume = 41,
pages = {61-63},
}
@article{Ste1960,
author = {H. Steinhaus},
year = 1960,
title = {Definitions for a theory of games and pursuit},
journal = {Naval Res. Logistics},
volume = 7,
pages = {105-108},
}
@article{Ste1975,
author = {V. N. Stepanenko},
year = 1975,
title = {Grundy games under conditions of semidefiniteness},
journal = {Cybernetics},
volume = 11,
pages = {167-172 (trans. of {\it Kibernetika} {\bf 11} (1975) 145--149)},
}
@article{Ste1939,
author = {B. M. Stewart},
year = 1939,
title = {Problem 3918 ($k$-peg tower of Hanoi)},
journal = {Amer. Math. Monthly},
volume = 46,
pages = {363},
note = {solution by J. S. Frame, {\it ibid.} {\bf 48} (1941) 216--217;
by the proposer, {\it ibid.} 217--219},
}
@article{Ste1991,
author = {I. Stewart},
year = 1991,
title = {Concentration: a winning strategy},
journal = {Sci. Amer.},
volume = {265},
pages = {167-172},
note = {October issue},
}
@article{Ste2000,
author = {I. Stewart},
year = 2000,
title = {Hex marks the spot},
journal = {Sci. Amer.},
volume = {283},
pages = {100-103},
note = {September issue},
}
@article {MR2299809,
AUTHOR = {Stewart, Fraser},
TITLE = {The sequential join of combinatorial games},
JOURNAL = {Integers, Electr. J. of Combinat. Number Theory},
FJOURNAL = {Integers. Electronic Journal of Combinatorial Number Theory},
VOLUME = {7},
YEAR = {2007},
PAGES = {\#G03, 10 pp.},
url = {http://www.integers-ejcnt.org/vol7.html},
ISSN = {1553-1732},
MRCLASS = {91A46 (05A99)},
MRNUMBER = {MR2299809},
MRREVIEWER = {Rudolf Avenhaus},
}
@techreport{Sti1988,
author = {L. Stiller},
year = 1988,
title = {Massively parallel retrograde analysis},
number = {BU-CS TR88--014},
institution = {Comp. Sci. Dept., Boston University},
}
@article{Sti1989,
author = {L. Stiller},
year = 1989,
title = {Parallel analysis of certain endgames},
journal = {Internat. Comp. Chess Assoc. J.},
volume = 12,
pages = {55-64},
}
@article{Sti1991,
author = {L. Stiller},
year = 1991,
title = {Group graphs and computational symmetry on massively parallel architecture},
journal = {J. Supercomputing},
volume = 5,
pages = {99-117},
}
@incollection{Sti1996,
author = {L. Stiller},
year = 1996,
title = {Multilinear algebra and chess endgames},
pages = {151-192},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}
@article{Sto1989,
author = {D. L. Stock},
year = 1989,
title = {Merlin's magic square revisited},
journal = {Amer. Math. Monthly},
volume = 96,
pages = {608-610},
}
@article{Sto1994,
author = {P. K. Stockmeyer},
year = 1994,
title = {Variations on the four-post Tower of Hanoi puzzle},
journal = {Congr. Numer.},
volume = 102,
pages = {3-12},
note = {Proc. 25th Southeastern Internat. Conf. on Combinatorics,
Graph Theory and Computing (Boca Raton, FL, 1994)},
}
@inproceedings{Sto1999,
author = {P. K. Stockmeyer},
year = 1999,
title = {The average distance between nodes in the cyclic Tower of
Hanoi digraph},
booktitle = {Combinatorics, Graph Theory, and Algorithms, Vol. I, II
$($Kalamazoo, MI, 1996$)$},
pages = {799-808},
publisher = {New Issues Press, Kalamazoo, MI},
}
@article{Sto2005,
author = {P. K. Stockmeyer},
year = 2005,
title = {The Tower of Hanoi: a bibliography},
journal = {Internet publication},
volume = {},
pages = {},
note = {38 pp.},
url = {http://www.cs.wm.edu/$\sim$pkstoc/{hpapers}.html},
}
@article{SBCEHLRS1995,
author = {P. K. Stockmeyer and C. D. Bateman and J. W. Clark and C. R. Eyster and M. T. Harrison and
N. A. Loehr and P. J. Rodriguez and J. R. Simmons III},
year = 1995,
title = {Exchanging disks in the tower of Hanoi},
journal = {Intern. J. Computer Math.},
volume = 59,
pages = {37-47},
}
@article{StCh1979,
author = {L. J. Stockmeyer and A. K. Chandra},
year = 1979,
title = {Provably difficult combinatorial games},
journal = {SIAM J. Comput.},
volume = 8,
pages = {151-174},
}
@article {MR0444558,
AUTHOR = {Stolarsky, Kenneth B.},
TITLE = {Beatty sequences, continued fractions, and certain shift
operators},
JOURNAL = {Canad. Math. Bull.},
FJOURNAL = {Canadian Mathematical Bulletin. Bulletin Canadien de
Math\'ematiques},
VOLUME = {19},
YEAR = {1976},
PAGES = {473--482},
ISSN = {0008-4395},
MRCLASS = {10A40 (10L10)},
MRNUMBER = {MR0444558 (56 \#2908)},
MRREVIEWER = {Aviezri S. Fraenkel},
}
@article {MR0472674,
AUTHOR = {Stolarsky, Kenneth B.},
TITLE = {A set of generalized {F}ibonacci sequences such that each
natural number belongs to exactly one},
JOURNAL = {Fibonacci Quart.},
FJOURNAL = {The Fibonacci Quarterly. Official Organ of the Fibonacci
Association},
VOLUME = {15},
YEAR = {1977},
PAGES = {224},
ISSN = {0015-0517},
MRCLASS = {10A35},
MRNUMBER = {MR0472674 (57 \#12369)},
MRREVIEWER = {J. Chidambaraswamy},
}
@article {MR1137536,
AUTHOR = {Stolarsky, Kenneth B.},
TITLE = {From {W}ythoff's {N}im to {C}hebyshev's inequality},
JOURNAL = {Amer. Math. Monthly},
FJOURNAL = {The American Mathematical Monthly},
VOLUME = {98},
YEAR = {1991},
NUMBER = {10},
PAGES = {889--900},
ISSN = {0002-9890},
CODEN = {AMMYAE},
MRCLASS = {90D46 (05A99 26D99)},
MRNUMBER = {MR1137536 (93b:90132)},
MRREVIEWER = {A. Pultr},
}
@article{Sto1983,
author = {J. A. Storer},
year = 1983,
title = {On the complexity of chess},
journal = {J. Comput. System Sci.},
volume = 27,
pages = {77-100},
}
@article{Sto1879,
author = {W. E. Story},
year = 1879,
title = {Notes on the "15" puzzle},
journal = {Amer. J. Math.},
volume = 2,
pages = {399-404},
}
@article{Str1985,
author = {Straffin, Jr., P. D.},
year = 1985,
title = {Three-person winner-take-all games with McCarthy's revenge rule},
journal = {College J. Math.},
volume = 16,
pages = {386-394},
}
@book{Str1993,
author = {P. D. Straffin},
year = 1993,
title = {Game Theory and Strategy},
publisher = {New Mathematical Library, MAA, Washington, DC},
}
@article{Str1995,
author = {Straffin, Jr., P. D.},
year = 1995,
title = {Position graphs for Pong Hau K'i and Mu Torere},
journal = {Math. Mag.},
volume = 68,
pages = {382-386},
}
Straffin, Philip D.jun.
Position graphs for Pong Hau K?i and Mu Torere. (English)
Math. Mag. 68, No.5, 382-386 (1995).
@article{StZa1977,
author = {Th. Str\"ohlein and L. Zagler},
year = 1977,
title = {Analyzing games by Boolean matrix iteration},
journal = {Discrete Math.},
volume = 19,
pages = {183-193},
}
@article {Str2007,
AUTHOR = {Stromquist, Walter},
TITLE = {Winning paths in {$N$}-by-infinity hex},
JOURNAL = {Integers, Electr. J. of Combinat. Number Theory},
FJOURNAL = {Integers. Electronic Journal of Combinatorial Number Theory},
VOLUME = {7},
YEAR = {2007},
PAGES = {\#G05, 3 pp.},
url = {http://www.integers-ejcnt.org/vol7.html},
ISSN = {1553-1732},
MRCLASS = {91A46 (05A99)},
MRNUMBER = {MR2299811},
}
@article{StUl1993,
author = {W. Stromquist and D. Ullman},
year = 1993,
title = {Sequential compounds of combinatorial games},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 119,
pages = {311-321},
}
@article{SuSu1989,
author = {K. Sugihara and I. Suzuki},
year = 1989,
title = {Optimal algorithms for a pursuit-evasion problem in grids},
journal = {SIAM J. Disc. Math.},
volume = 2,
pages = {126-143},
}
@article{Sun2002,
author = {X. Sun},
year = 2002,
title = {Improvements on Chomp},
journal = {Integers, Electr. J. of Combinat. Number Theory},
volume = 2,
pages = {\#G1, 8 pp., Comb. Games Sect.},
url = {http://www.integers-ejcnt.org/vol2.html},
mrnumber = {MR1917957 (2003e:05015)},
}
@article{Sun2005,
author = {X. Sun},
year = 2005,
title = {Wythoff's sequence and $N$-heap Wythoff's conjectures},
journal = {Discrete Math.},
volume = 300,
pages = {180-195},
mrnumber = {MR2170125},
}
@article{SuZe2004,
author = {X. Sun and D. Zeilberger},
year = 2004,
title = {On Fraenkel's $N$-heap Wythoff's conjectures},
journal = {Ann. Comb.},
volume = 8,
pages = {225-238},
mrnumber = {MR2079933 (2005e:91039)},
}
@article {MR987520,
AUTHOR = {Sutner, Klaus},
TITLE = {Additive automata on graphs},
JOURNAL = {Complex Systems},
FJOURNAL = {Complex Systems},
VOLUME = {2},
YEAR = {1988},
PAGES = {649--661},
ISSN = {0891-2513},
MRCLASS = {68Q80 (05C99)},
MRNUMBER = {MR987520 (90k:68127)},
}
@article{Sut1988,
author = {K. Sutner},
year = 1988,
title = {On $\sigma$-automata},
journal = {Complex Systems},
volume = 2,
pages = {1-28},
}
@article{Sut1989,
author = {K. Sutner},
year = 1989,
title = {Linear cellular automata and the Garden-of-Eden},
journal = {Math. Intelligencer},
volume = 11,
pages = {49-53},
}
@article{Sut1990,
author = {K. Sutner},
year = 1990,
title = {The $\sigma$-game and cellular automata},
journal = {Amer. Math. Monthly},
volume = 97,
pages = {24-34},
}
@article{Sut1995,
author = {K. Sutner},
year = 1995,
title = {On the computational complexity of finite cellular automata},
journal = {J. Comput. System Sci.},
volume = 50,
pages = {87-97},
}
@article {MR1916041,
AUTHOR = {Sutner, Klaus},
TITLE = {Decomposition of additive cellular automata},
JOURNAL = {Complex Systems},
FJOURNAL = {Complex Systems},
VOLUME = {13},
YEAR = {2001},
PAGES = {245--270},
ISSN = {0891-2513},
MRCLASS = {37B15 (68Q80)},
MRNUMBER = {MR1916041 (2003e:37016)},
MRREVIEWER = {Edgardo Ugalde},
}
@article{Swa2000,
author = {K. J. Swanepoel},
year = 2000,
title = {Balancing unit vectors},
journal = {J. Combin. Theory \emph{(Ser.~A)}},
volume = 89,
pages = {105-112},
}
@incollection{Sze1999,
author = {M. Szegedy},
year = 1999,
title = {In how many steps the $k$ peg version of the towers of Hanoi
game can be solved?},
pages = {356-361},
editor = {},
publisher = {Springer, Berlin},
volume = {1563},
booktitle = {STACS 99, Trier, Lecture Notes in Computer Science},
}
@article {MR2354439,
AUTHOR = {Sz{\'e}kely, G{\'a}bor J. and Rizzo, Maria L.},
TITLE = {The uncertainty principle of game theory},
JOURNAL = {Amer. Math. Monthly},
FJOURNAL = {American Mathematical Monthly},
VOLUME = {114},
YEAR = {2007},
NUMBER = {8},
PAGES = {688--702},
ISSN = {0002-9890},
CODEN = {AMMYAE},
MRCLASS = {91A05 (90C47)},
MRNUMBER = {MR2354439},
}
@inbook{Sze1984,
author = {L. A. Sz\'{e}kely},
year = 1984,
title = {{\rm On two concepts of discrepancy in a class of combinatorial
games in:} Finite and infinite sets, Vol. I, II, Colloq. Math. Soc.
J\'{a}nos Bolyai, 37},
publisher = {North-Holland, Amsterdam},
chapter ={},
pages = {679-683},
}
@article{SzCh1994,
author = {J. L. Szwarcfiter and G. Chaty},
year = 1994,
title = {Enumerating the kernels of a directed graph with no odd circuits},
journal = {Inform. Process. Lett.},
volume = 51,
pages = {149-153},
}
@article{TUK1995,
author = {A. Takahashi and S. Ueno and Y. Kajitani},
year = 1995,
title = {Mixed searching and proper-path-width},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 137,
pages = {253-268},
}
@incollection{Tak2002,
author = {Takizawa, T.},
year = 2002,
title = {An application of mathematical game theory to Go endgames:
some width-two-entrance rooms with and without kos},
pages = {108-124},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1973008},
}
@article{Tar1988,
author = {G. Tardos},
year = 1988,
title = {Polynomial bound for a chip firing game on graphs},
journal = {SIAM J. Disc. Math.},
volume = 1,
pages = {397-398},
}
@article{Tar1983,
author = {M. Tarsi},
year = 1983,
title = {Optimal search on some game trees},
journal = {J. Assoc. Comput. Mach.},
volume = 30,
pages = {389-396},
}
@article{Tel1987,
author = {R. Telg\'arsky},
year = 1987,
title = {Topological games: on the 50th anniversary of the Banach-Mazur game},
journal = {Rocky Mountain J. Math.},
volume = 17,
pages = {227-276},
}
@article{ThGe1998,
author = {W. F. D. Theron and G. Geldenhuys},
year = 1998,
title = {Domination by queens on a square beehive},
journal = {Discrete Math.},
volume = 178,
pages = {213-220},
}
@article{Tho1986,
author = {K. Thompson},
year = 1986,
title = {Retrograde analysis of certain endgames},
journal = {Internat. Comp. Chess Assoc. J.},
volume = 9,
pages = {131-139},
}
@article{ToAd2000,
author = {H. Tohyama and A. Adachi},
year = 2000,
title = {Complexity of path discovery problems},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 237,
pages = {381-406},
}
@article{ToLe2000,
author = {G. P. Tollisen and T. Lengyel},
year = 2000,
title = {Color switching games},
journal = {Ars Combin.},
volume = 56,
pages = {223-234},
mrnumber = {MR1768618 (2001b:05094)},
}
@article{Tom1990,
author = {I. Tomescu},
year = 1990,
title = {Almost all digraphs have a kernel},
journal = {Discrete Math.},
volume = 84,
pages = {181-192},
}
@inproceedings{ToSc1983,
author = {R. To\v{s}i\'c and S. \v{S}\'ceki\'c},
year = 1983,
title = {An analysis of some partizan graph games},
booktitle = {Proc. 4th Yugoslav Seminar on Graph Theory, \emph{Novi Sad}},
pages = {311-319},
}
@article {Tun1987,
AUTHOR = {Tung, S. P.},
TITLE = {Computational complexities of {D}iophantine equations with
parameters},
JOURNAL = {J. Algorithms},
FJOURNAL = {Journal of Algorithms},
VOLUME = {8},
YEAR = {1987},
PAGES = {324--336},
ISSN = {0196-6774},
CODEN = {JOALDV},
MRCLASS = {03D15 (11U05 11Y05 68Q25)},
MRNUMBER = {MR905990 (88m:03063)},
MRREVIEWER = {James P. Jones},
}
@incollection{TBBS1953,
author = {A. M. Turing and M. A. Bates and B. V. Bowden and C. Strachey},
year = 1953,
title = {Digital computers applied to games},
pages = {286-310},
editor = {B. V. Bowden},
publisher = {Pitman, London},
booktitle = {Faster Than Thought},
}
@article{UeIw1990,
author = {R. Uehara and S. Iwata},
year = 1990,
title = {Generalized Hi-Q is NP-complete},
journal = {Trans. IEICE},
volume = {E73},
pages = {270-273},
}
@article{Ule1980,
author = {J. \'Ulehla},
year = 1980,
title = {A complete analysis of von Neumann's Hackendot},
journal = {Internat. J. Game Theory},
volume = 9,
pages = {107-113},
}
@article{Ull1992,
author = {D. Ullman},
year = 1992,
title = {More on the four-numbers game},
journal = {Math. Mag.},
volume = 65,
pages = {170-174},
}
@article{Usp1927,
author = {J. V. Uspensky},
year = 1927,
title = {On a problem arising out of the theory of a certain game},
journal = {Amer. Math. Monthly},
volume = 34,
pages = {516-521},
}
@book{Vaj1992,
author = {S. Vajda},
year = 1992,
title = {Mathematical Games and How to Play Them},
publisher = {Ellis Horwood Series in Mathematics and its Applications,
Chichester, England},
}
@article{HeHe1985,
author = {H. J. van den Herik and I. S. Herschberg},
year = 1985,
title = {The construction of an omniscient endgame database},
journal = {Internat. Comp. Chess Assoc. J.},
volume = 8,
pages = {66-87},
}
@article{vdH2001,
author = {J. van den Heuvel},
year = 2001,
title = {Algorithmic aspects of a chip-firing game},
journal = {Combin. Probab. Comput.},
volume = 10,
pages = {505-529},
mrnumber = {MR1869843 (2002h:05154)},
}
@article {vdW1974,
AUTHOR = {van der Waerden, B. L.},
TITLE = {The game of rectangles},
JOURNAL = {Ann. Mat. Pura Appl.},
FJOURNAL = {Annali di Matematica Pura ed Applicata. Serie Quarta},
VOLUME = {98},
YEAR = {1974},
PAGES = {63--75},
MRNUMBER = {MR0351854 (50 \#4342)},
}
@techreport{Lee1976,
author = {J. van Leeuwen},
year = 1976,
title = {Having a Grundy-numbering is NP-complete},
institution = {Computer Science Dept., Pennsylvania State University,
University Park, PA},
type = {Report},
number = {No.~207},
}
@article{Zan1990,
author = {A. J. van Zanten},
year = 1990,
title = {The complexity of an optimal algorithm for the generalized tower
of Hanoi problem},
journal = {Intern. J. Comput. Math.},
volume = 36,
pages = {1-8},
}
@article{Zan1991,
author = {A. J. van Zanten},
year = 1991,
title = {An iterative optimal algorithm for the generalized tower of Hanoi problem},
journal = {Intern. J. Comput. Math.},
volume = 39,
pages = {163-168},
}
@book{Var1991,
author = {I. Vardi},
year = 1991,
title = {Computational Recreations in Mathematica},
publisher = {Addison Wesley},
}
@article {Var68a,
AUTHOR = {Varvak, L. P.},
TITLE = {A generalization of the concept of {$p$}-sum of graphs},
JOURNAL = {Dopov\=\i d\=\i\ Akad. Nauk Ukra\"\i n. RSR Ser. A},
FJOURNAL = {Akademiya Nauk Ukrainsko\u\i\ SSR. Doklady. Seriya A.
Fiziko-Matematicheskie i Tekhnicheskie Nauki},
VOLUME = {1968},
YEAR = {1968},
PAGES = {965--968},
MRNUMBER = {MR0245468 (39 \#6776)},
}
@article{Var1968b,
author = {L. P. Varvak},
year = 1968,
title = {Games on the sum of graphs},
journal = {Cybernetics},
volume = 4,
pages = {49-51 (trans. of {\it Kibernetika (Kiev)} {\bf 4} (1968) 63--66)},
MRNUMBER = {MR0299238 (45 \#8287)},
}
@article {Var1970,
AUTHOR = {Varvak, L. P.},
TITLE = {A certain generalization of the Grundy function},
JOURNAL = {Kibernetika {\rm (Kiev)}},
FJOURNAL = {Otdelenie Matematiki, Mekhaniki i Kibernetiki Akademii Nauk
Ukrainsko\u\i\ SSR. Kibernetika},
YEAR = {1970},
volume = {},
NUMBER = {5},
PAGES = {112--116},
MRNUMBER = {MR0295968 (45 \#5029)},
}
@article {Var1971,
AUTHOR = {Varvak, L. P.},
TITLE = {Game properties of generalized {$p$}-sums of graphs},
JOURNAL = {Dopov\=\i d\=\i\ Akad. Nauk Ukra\"\i n. RSR Ser. A},
FJOURNAL = {Akademiya Nauk Ukrainsko\u\i\ SSR. Doklady. Seriya A.
Fiziko-Matematicheskie i Tekhnicheskie Nauki},
YEAR = {1971},
PAGES = {1059--1061, 1148},
MRNUMBER = {MR0307731 (46 \#6851)},
}
@article {Var1973,
AUTHOR = {Varvak, L. P.},
TITLE = {A certain generalization of the nucleus of a graph},
JOURNAL = {Ukrainian Math. J.},
FJOURNAL = {Akademiya Nauk Ukrainsko\u\i\ SSR. Institut Matematiki.
Ukrainski\u\i\ Matematicheski\u\i\ Zhurnal},
VOLUME = {25},
YEAR = {1973},
PAGES = {78-81},
MRNUMBER = {MR0323649 (48 \#2005)},
}
@article{VePa1994,
author = {J. Veerasamy and I. Page},
year = 1994,
title = {On the towers of Hanoi problem with multiple spare pegs},
journal = {Intern. J. Comput. Math.},
volume = 52,
pages = {17-22},
}
@article{VeTo1989,
author = {H. Venkateswaran and M. Tompa},
year = 1989,
title = {A new pebble game that characterizes parallel complexity classes},
journal = {SIAM J. Comput.},
volume = 18,
pages = {533-549},
}
@article{Via1987,
author = {D. Viaud},
year = 1987,
title = {Une strat\'egie g\'en\'erale pour jouer au Master-Mind},
journal = {RAIRO Recherche op\'erationelle/Operations Research},
volume = 21,
pages = {87-100},
}
@article{VSV2002,
author = {F. R. Villegas and L. Sadun and J. F. Voloch},
year = 2002,
title = {Blet: a mathematical puzzle},
journal = {Amer. Math. Monthly},
volume = 109,
pages = {729-740},
}
@article{Neu1928,
author = {J. von Neumann},
year = 1928,
title = {Zur Theorie der Gesellschaftsspiele},
journal = {Math. Ann.},
volume = 100,
pages = {295-320},
}
@book{NeMo2004,
author = {J. von Neumann and O. Morgenstern},
year = 2004,
title = {Theory of Games and Economic Behaviour},
edition = {},
publisher = {Princeton University Press, Princeton, NJ},
note = {reprint of the 3rd 1980 edition; first edition appeared in 1944},
}
@inproceedings{Wal2005,
author = {R. G. Wahl},
year = 2005,
title = {The Butler University game},
booktitle = {Tribute to a Mathemagician},
pages = {37-40},
publisher = {A K Peters, Wellesley},
note = {honoring Martin Gardner},
}
@inproceedings{Wal2002,
author = {J. Waldmann},
year = 2002,
title = {Rewrite games},
booktitle = {Rewriting Techniques and Applications, Copenhagen,
22-24 July 2002},
editor = {S. Tison},
volume = {LNCS 2378},
pages = {144-158},
publisher = {Lecture Notes in Computer Science, Springer},
}
@article{Wal1955,
author = {C. T. C. Wall},
year = 1955,
title = {Nim-arithmetic},
journal = {Eureka {\rm no. 18}},
volume = {},
pages = {3-7},
}
@article{Wal1953,
author = {J. L. Walsh},
year = 1953,
title = {The name of the game of Nim, Letter to the Editor},
journal = {Math. Gaz.},
volume = 37,
pages = {290},
}
@article{Wal2003,
author = {M. Walsh},
year = 2003,
title = {A note on the Grundy number},
journal = {Bull. Inst. Combin. Appl.},
volume = 38,
pages = {23-26},
}
@article{Wal1982,
author = {T. R. Walsh},
year = 1982,
title = {The towers of Hanoi revisited: moving the rings by counting the moves},
journal = {Inform. Process. Lett.},
volume = 15,
pages = {64-67},
}
@article{Wal1983,
author = {T. R. Walsh},
year = 1983,
title = {Iteration strikes back at the cyclic towers of Hanoi},
journal = {Inform. Process. Lett.},
volume = 16,
pages = {91-93},
}
@article{Wan2006,
author = {W.-F. Wang},
year = 2006,
title = {Edge-partitions of graphs of nonnegative characteristic and their game coloring
numbers},
journal = {Discrete Math.},
volume = 306,
pages = {262-270},
}
@article {MR2347414,
AUTHOR = {Wang, Xinmao and Wu, Yaokun},
TITLE = {Minimum light number of lit-only {$\sigma$}-game on a tree},
JOURNAL = {Theoret. Comput. Sci.},
FJOURNAL = {Theoretical Computer Science},
VOLUME = {381},
YEAR = {2007},
PAGES = {292--300},
ISSN = {0304-3975},
CODEN = {TCSDI},
MRCLASS = {68R05 (05C05 91A43)},
MRNUMBER = {MR2347414},
}
@article{Wan1997,
author = {I. M. Wanless},
year = 1997,
title = {On the periodicity of graph games},
journal = {Australas. J. Combin.},
volume = 16,
pages = {113-123},
mrnumber = {MR1477524 (98i:05159)},
}
@article{Wan2001,
author = {I. M. Wanless},
year = 2001,
title = {Path achievement games},
journal = {Australas. J. Combin.},
volume = 23,
pages = {9-18},
mrnumber = {MR1814595 (2002k:91050)},
}
@article{War1996,
author = {R. H. Warren},
year = 1996,
title = {Disks on a chessboard},
journal = {Amer. Math. Monthly},
volume = 103,
pages = {305-307},
}
@article{Was1990,
author = {A. Washburn},
year = 1990,
title = {Deterministic graphical games},
journal = {J. Math. Anal. Appl.},
volume = 153,
pages = {84-96},
}
@article {Wat1997,
AUTHOR = {Watkins, John J.},
TITLE = {Knight's tours on triangular honeycombs},
BOOKTITLE = {Proceedings of the Twenty-eighth Southeastern International
Conference on Combinatorics, Graph Theory and Computing (Boca
Raton, FL, 1997)},
JOURNAL = {Congr. Numer.},
FJOURNAL = {Congressus Numerantium. A Conference Journal on Numerical
Themes},
VOLUME = {124},
YEAR = {1997},
PAGES = {81--87},
note = {Proc. 28th Southeastern Internat. Conf. on Combinatorics,
Graph Theory and Computing (Boca Raton, FL, 1997)},
ISSN = {0384-9864},
MRCLASS = {05A99},
MRNUMBER = {MR1605097},
}
@article{Wat2000,
AUTHOR = {Watkins, John J.},
TITLE = {Knight's tours on cylinders and other surfaces},
BOOKTITLE = {Proceedings of the Thirty-first Southeastern International
Conference on Combinatorics, Graph Theory and Computing (Boca
Raton, FL, 2000)},
JOURNAL = {Congr. Numer.},
FJOURNAL = {Congressus Numerantium. A Conference Journal on Numerical
Themes},
VOLUME = {143},
YEAR = {2000},
note = {Proc. 31st Southeastern Internat. Conf. on Combinatorics,
Graph Theory and Computing (Boca Raton, FL, 2000)},
PAGES = {117--127},
ISSN = {0384-9864},
MRCLASS = {05C45 (05C10)},
MRNUMBER = {MR1817914 (2001k:05136)},
}
@book{Wat2004,
author = {J. J. Watkins},
year = 2004,
title = {Across the Board: The Mathematics of Chessboard Problems},
edition = {},
publisher = {Princeton University Press, Princeton and Oxford},
mrnumber = {MR2041306 (2004m:00002)},
}
@article {MR1456114,
AUTHOR = {Watkins, John J. and Hoenigman, Rebecca L.},
TITLE = {Knight's tours on a torus},
JOURNAL = {Math. Mag.},
FJOURNAL = {Mathematics Magazine},
VOLUME = {70},
YEAR = {1997},
PAGES = {175--184},
ISSN = {0025-570X},
CODEN = {MAMGA8},
MRCLASS = {00A08 (05C10 05C45)},
MRNUMBER = {MR1456114 (98i:00003)},
MRREVIEWER = {R. H. Schelp},
}
@incollection{Wea1995,
author = {W. D. Weakley},
year = 1995,
title = {Domination in the queen's graph},
pages = {1223-1232},
editor = {Y. Alavi and A. J. Schwenk},
publisher = {Wiley, New York},
booktitle = {Graph theory, Combinatorics, and Algorithms, {\rm Vol. {\bf 2}
(Kalamazoo, MI, 1992)}},
}
@article{Wea2002a,
author = {W. D. Weakley},
year = 2002,
title = {A lower bound for domination numbers of the queen's graph},
journal = {J. Combin. Math. Combin. Comput.},
volume = 43,
pages = {231--254},
}
@article{Wea2002b,
author = {W. D. Weakley},
year = 2002,
title = {Upper bounds for domination numbers of the queen's graph},
journal = {Discrete Math.},
volume = 242,
pages = {229-243},
}
@article{Web1982,
author = {W. A. Webb},
year = 1982,
title = {The length of the four-number game},
journal = {Fibonacci Quart.},
volume = 20,
pages = {33-35},
mrnumber = {MR0660757 (84e:10017)},
}
@misc{Wel1952,
author = {C. P. Welter},
year = 1952,
title = {The advancing operation in a special abelian group},
note = {{\it Nederl. Akad. Wetensch. Proc. \emph{(Ser.~A)} {\bf 55} =
Indag. Math.{\bf 14}}, 304-314},
}
@misc{Wel1954,
author = {C. P. Welter},
year = 1954,
title = {The theory of a class of games on a sequence of squares, in
terms of the advancing operation in a special group},
journal = {Nederl. Akad. Wetensch. Proc. \emph{(Ser.~A)}},
volume = 57,
note = {{\it Nederl. Akad. Wetensch. Proc. \emph{(Ser.~A)} {\bf 57} =
Indag. Math.{\bf 16}}, 194-200},
}
@incollection{Wes1996,
author = {J. West},
year = 1996,
title = {Champion-level play of domineering},
pages = {85-91},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}
@incollection{Wes1996a,
author = {J. West},
year = 1996,
title = {Champion-level play of dots-and-boxes},
pages = {79-84},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1427958},
}
@incollection{Wes1996b,
author = {J. West},
year = 1996,
title = {New values for Top Entails},
pages = {345-350},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}
@article{Whi1963,
author = {M. J. Whinihan},
year = 1963,
title = {Fibonacci Nim},
journal = {Fibonacci Quart.},
volume = 1,
number = 4,
pages = {9-13},
}
@article{Wil1988,
author = {R. Wilber},
year = 1988,
title = {White pebbles help},
journal = {J. Comput. System Sci.},
volume = 36,
pages = {108-124},
}
@article{Wil1991,
author = {R. Wilfong},
year = 1991,
title = {Motion planning in the presence of movable obstacles.
Algorithmic motion planning in robotics},
journal = {Ann. Math. Artificial Intelligence},
volume = 3,
pages = {131-150},
}
@article{Wil1974,
author = {R. M. Wilson},
year = 1974,
title = {Graph puzzles, homotopy and the alternating group},
journal = {J. Combin. Theory \emph{(Ser.~B)}},
volume = 16,
pages = {86-96},
}
@article{Win2002,
author = {P. Winkler},
year = 2002,
title = {Games people don't play},
journal = {{\rm in:} Puzzler's Tribute: a Feast for the Mind{\rm ,}},
chapter = {},
pages = {301-313},
note = {honoring Martin Gardner (D. Wolfe and T. Rodgers, eds.),
A K Peters, Natick, MA},
publisher = {},
mrnumber = {MR2034896 (2006c:00002)},
}
@article{Wol1993,
author = {D. Wolfe},
year = 1993,
title = {Snakes in domineering games},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 119,
pages = {323-329},
}
@incollection{Wol1996,
author = {D. Wolfe},
year = 1996,
title = {The gamesman's toolkit},
pages = {93-98},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
url = {http://www.gustavus.edu/$\sim$wolfe/games/}
}
@incollection{Wol2002,
author = {D. Wolfe},
year = 2002,
title = {Go endgames are PSPACE-hard},
pages = {125-136},
editor = {R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {42},
booktitle = {More Games of No Chance, \emph{Proc. MSRI Workshop on
Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ.}},
mrnumber = {MR1973009 (2004b:91052)},
}
@incollection{Wol2008,
author = {D. Wolfe},
year = 2008,
title = {on day $n$},
pages = {},
editor = {M. H. Albert and R. J. Nowakowski},
publisher = {Cambridge University Press, Cambridge},
volume = {},
booktitle = {Games of No Chance III, \emph{Proc. BIRS Workshop on
Combinatorial Games, July, 2005, Banff, Alberta, Canada, MSRI Publ.}},
}
@article{WoFr2004,
author = {D. Wolfe and W. Fraser},
year = 2004,
title = {Counting the number of games},
journal = {Theoret. Comp. Sci.},
volume = {313},
pages = {527-532},
note = {special issue of Dagstuhl Seminar ``Algorithmic Combinatorial
Game Theory'', Feb. 2002},
mrnumber = {MR2056944},
}
@article{Woo1981,
author = {D. Wood},
year = 1981,
title = {The towers of Brahma and Hanoi revisited},
journal = {J. Recr. Math.},
volume = 14,
pages = {17-24},
}
@article{Woo1983,
author = {D. Wood},
year = 1983,
title = {Adjudicating a towers of Hanoi contest},
journal = {Intern. J. Comput. Math.},
volume = 14,
pages = {199-207},
}
@article{WuCh1992,
author = {J.-S. Wu and R.-J. Chen},
year = 1992,
title = {The towers of Hanoi problem with parallel moves},
journal = {Inform. Process. Lett.},
volume = 44,
pages = {241-243},
}
@article{WuCh1993,
author = {J.-S. Wu and R.-J. Chen},
year = 1993,
title = {The towers of Hanoi problem with cyclic parallel moves},
journal = {Inform. Process. Lett.},
volume = 46,
pages = {1-6},
}
@article {MR2267825,
AUTHOR = {Wu, Jiaojiao and Zhu, Xuding},
TITLE = {Relaxed game chromatic number of outer planar graphs},
JOURNAL = {Ars Combin.},
FJOURNAL = {Ars Combinatoria},
VOLUME = {81},
YEAR = {2006},
PAGES = {359--367},
ISSN = {0381-7032},
CODEN = {ACOMDN},
MRCLASS = {05C15},
MRNUMBER = {MR2267825 (2007f:05067)},
}
@article{WuZh2008,
author = {J. Wu and X. Zhu},
year = 2008,
title = {Lower bounds for the game colouring number of partial $k$-trees
and planar graphs},
journal = {Discrete Math.},
volume = 308,
pages = {2637-2642},
mrnumber = {**MR pending},
}
@article{Wyt1907,
author = {W. A. Wythoff},
year = 1907,
title = {A modification of the game of Nim},
journal = {Nieuw Arch. Wisk.},
volume = 7,
pages = {199-202},
}
@book{YaYa1967,
author = {A. M. Yaglom and I. M. Yaglom},
year = 1967,
title = {Challenging Mathematical Problems with Elementary Solutions},
note = {translated by J. McCawley, Jr., revised and edited by B. Gordon},
volume = {II},
publisher = {Holden-Day, San Francisco},
}
@article{Yam1978,
author = {Y. Yamasaki},
year = 1978,
title = {Theory of division games},
journal = {Publ. Res. Inst. Math. Sciences, Kyoto Univ.},
volume = 14,
pages = {337-358},
}
@article{Yam1980,
author = {Y. Yamasaki},
year = 1980,
title = {On mis\`ere Nim-type games},
journal = {J. Math. Soc. Japan},
volume = 32,
pages = {461-475},
}
@article{Yam1981,
author = {Y. Yamasaki},
year = 1981,
title = {The projectivity of $Y$-games},
journal = {Publ. Res. Inst. Math. Sciences, Kyoto Univ.},
volume = 17,
pages = {245-248},
}
@article{Yam1981a,
author = {Y. Yamasaki},
year = 1981,
title = {Theory of Connexes I},
journal = {Publ. Res. Inst. Math. Sciences, Kyoto Univ.},
volume = 17,
pages = {777-812},
}
@article{Yam1985,
author = {Y. Yamasaki},
year = 1985,
title = {Theory of connexes II},
journal = {Publ. Res. Inst. Math. Sciences, Kyoto Univ.},
volume = 21,
pages = {403-409},
}
@book{Yam1989,
author = {Y. Yamasaki},
year = 1989,
title = {Combinatorial Games: Back and Front},
publisher = {Springer Verlag, Tokyo (in Japanese)},
}
@article{Yam1989a,
author = {Y. Yamasaki},
year = 1989,
title = {Shannon switching games without terminals II},
journal = {Graphs Combin.},
volume = 5,
pages = {275-282},
}
@article{Yam1991,
author = {Y. Yamasaki},
year = 1991,
title = {A difficulty in particular Shannon-like games},
journal = {Discrete Appl. Math.},
volume = 30,
pages = {87-90},
}
@article{Yam1992,
author = {Y. Yamasaki},
year = 1992,
title = {Shannon switching games without terminals III},
journal = {Graphs Combin.},
volume = 8,
pages = {291-297},
}
@article{Yam1993,
author = {Y. Yamasaki},
year = 1993,
title = {Shannon-like games are difficult},
journal = {Discrete Math.},
volume = 111,
pages = {481-483},
}
@article{Yam1997,
author = {Y. Yamasaki},
year = 1997,
title = {The arithmetic of reversed positional games},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 174,
pages = {247-249},
note = {also in {\it Discrete Math.} {\bf 165/166} (1997) 639--641},
}
@incollection{YLP2001,
author = {J. Yang and S. Liao and M. Pawlak},
year = 2001,
title = {On a decomposition method for finding winning
strategy in Hex game},
pages = {96-111},
editor = {A. L. W. Sing and W. H. Man and W. Wai},
publisher = {City University of Honkong},
volume = {},
booktitle = {Proceedings ADCOG: Internat.\ Conf.\ Application and
Development of Computer Games},
}
@mastersthesis{Yed1985,
author = {L. J. Yedwab},
year = 1985,
title = {On playing well in a sum of games},
school = {MIT},
note = {MIT/LCS/TR-348},
}
@article{Yeh1995,
author = {Y. N. Yeh},
year = 1995,
title = {A remarkable endofunction involving compositions},
journal = {Stud. Appl. Math},
volume = 95,
pages = {419--432},
}
@phdthesis{Yes1978,
author = {Y. Yesha},
year = 1978,
title = {Theory of annihilation games},
school = {Weizmann Institute of Science, Rehovot, Israel},
}
@article{YuBa1982,
author = {Y. K. Yu and R. B. Banerji},
year = 1982,
title = {Periodicity of Sprague--Grundy function in graphs with decomposable nodes},
journal = {Cybernetics and Systems: An Internat. J.},
volume = 13,
pages = {299-310},
}
@article{Zac1988,
author = {S. Zachos},
year = 1988,
title = {Probabilistic quantifiers and games},
journal = {J. Comput. System Sci.},
volume = 36,
pages = {433-451},
}
@article {MR2113717,
AUTHOR = {Zaker, Manouchehr},
TITLE = {Grundy chromatic number of the complement of bipartite graphs},
JOURNAL = {Australas. J. Combin.},
FJOURNAL = {The Australasian Journal of Combinatorics},
VOLUME = {31},
YEAR = {2005},
PAGES = {325--329},
ISSN = {1034-4942},
MRCLASS = {05C15},
MRNUMBER = {MR2113717 (2005h:05087)},
}
@article {Zak2006,
AUTHOR = {Zaker, Manouchehr},
TITLE = {Results on the {G}rundy chromatic number of graphs},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {306},
YEAR = {2006},
NUMBER = {23},
PAGES = {3166--3173},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05C15},
MRNUMBER = {MR2273147},
}
@article{Zei2001,
author = {D. Zeilberger},
year = 2001,
title = {Three-rowed Chomp},
journal = {Adv. in Appl. Math.},
volume = 26,
pages = {168-179},
mrnumber = {MR1808446 (2001k:91009)},
}
@article {MR2100728,
AUTHOR = {Zeilberger, Doron},
TITLE = {Chomp, recurrences and chaos(?)},
JOURNAL = {J. Difference Equ. Appl.},
FJOURNAL = {Journal of Difference Equations and Applications},
VOLUME = {10},
YEAR = {2004},
PAGES = {1281--1293},
ISSN = {1023-6198},
MRCLASS = {39A10 (05A99 37B99 91A46)},
MRNUMBER = {MR2100728 (2005g:39014)},
MRREVIEWER = {Kimmo Eriksson},
}
@inproceedings{Zer1913,
author = {E. Zermelo},
year = 1913,
title = {\"Uber eine Anwendung der Mengenlehre auf die Theorie des Schachspiels},
booktitle = {Proc. 5th Int. Cong. Math.\, Cambridge 1912},
publisher = {Cambridge University Press},
volume = {II},
pages = {501-504},
}
@article{Zhu1999,
author = {X. Zhu},
year = 1999,
title = {The game coloring number of planar graphs},
journal = {J. Combin. Theory \emph{(Ser.~B)}},
volume = 75,
pages = {245-258},
mrnumber = {MR1676891 (99m:05064)},
}
@article{Zhu2000,
author = {X. Zhu},
year = 2000,
title = {The game coloring number of pseudo partial $k$-trees},
journal = {Discrete Math.},
volume = 215,
pages = {245-262},
mrnumber = {MR1746462 (2000m:05102)},
}
@article {MR2368019,
AUTHOR = {Zhu, Xuding},
TITLE = {Refined activation strategy for the marking game},
JOURNAL = {J. Combin. Theory Ser. B},
FJOURNAL = {Journal of Combinatorial Theory. Series B},
VOLUME = {98},
YEAR = {2008},
PAGES = {1--18},
ISSN = {0095-8956},
CODEN = {JCBTB8},
MRCLASS = {91A43 (05C15)},
MRNUMBER = {MR2368019},
}
@incollection{Zie1996,
author = {M. Zieve},
year = 1996,
title = {Take-away games},
pages = {351-361},
editor = {R. J. Nowa\-kowski},
publisher = {Cambridge University Press, Cambridge},
volume = 29,
booktitle = {Games of No Chance, \emph{Proc. MSRI Workshop on Combinatorial
Games, July, 1994, Berkeley, CA, MSRI Publ.}},
}
@article{ZwPa1993,
author = {U. Zwick and M. S. Paterson},
year = 1993,
title = {The memory game},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 110,
pages = {169-196},
}
@article{ZwPa1996,
author = {U. Zwick and M. S. Paterson},
year = 1996,
title = {The complexity of mean payoff games on graphs},
journal = {Theoret. Comput. Sci. \emph{(Math Games)}},
volume = 158,
pages = {343-359},
}
@article{Zwi1987,
author = {W. S. Zwicker},
year = 1987,
title = {Playing games with games: the hypergame paradox},
journal = {Amer. Math. Monthly},
volume = 94,
pages = {507-514},
}