Combinatorial Games, Volume 43

Total Page:16

File Type:pdf, Size:1020Kb

Combinatorial Games, Volume 43 http://dx.doi.org/10.1090/psapm/043 AMS SHORT COURSE LECTURE NOTES Introductory Survey Lectures A Subseries of Proceedings of Symposia in Applied Mathematics Volume 43 COMBINATORIAL GAMES Edited by Richard K Guy [Columbus, Ohio, August 1990) Volume 42 CRYPTOLOGY AND COMPUTATIONAL NUMBER THEORY Edited by C. Pomerance {Boulder, Colorado, August 1989) Volume 41 ROBOTICS Edited by R. W. Brockett (Louisville, Kentucky, January 1990) Volume 40 MATRIX THEORY AND APPLICATIONS Edited by Charles R. Johnson (Phoenix, Arizona, January 1989) Volume 39 CHAOS AND FRACTALS: THE MATHEMATICS BEHIND THE COMPUTER GRAPHICS Edited by Robert L. Devaney and Linda Keen (Providence, Rhode Island, August 1988) Volume 38 COMPUTATIONAL COMPLEXITY THEORY Edited by Juris Hartmanis (Atlanta, Georgia, January 1988) Volume 37 MOMENTS IN MATHEMATICS Edited by Henry J. Landau (San Antonio, Texas, January 1987) Volume 36 APPROXIMATION THEORY Edited by Carl de Boor (New Orleans, Louisiana, January 1986) Volume 35 ACTUARIAL MATHEMATICS Edited by Harry H. Panjer (Laramie, Wyoming, August 1985) Volume 34 MATHEMATICS OF INFORMATION PROCESSING Edited by Michael Anshel and William Gewirtz (Louisville, Kentucky, January 1984) Volume 33 FAIR ALLOCATION Edited by H. Peyton Young (Anaheim, California, January 1985) Volume 32 ENVIRONMENTAL AND NATURAL RESOURCE MATHEMATICS Edited by R. W. McKelvey (Eugene, Oregon, August 1984) Volume 31 COMPUTER COMMUNICATIONS Edited by B. Gopinath (Denver, Colorado, January 1983) Volume 30 POPULATION BIOLOGY Edited by Simon A. Levin (Albany, New York, August 1983) Volume 29 APPLIED CRYPTOLOGY, CRYPTOGRAPHIC PROTOCOLS, AND COMPUTER SECURITY MODELS By R. A. DeMillo, G I. Davida, D. P. Dobkin, M. A. Harrison, and R. J. Lipton (San Francisco, California, January 1981) Volume 28 STATISTICAL DATA ANALYSIS Edited by R. Gnanadesikan (Toronto, Ontario, August 1982) Volume 27 COMPUTED TOMOGRAPHY Edited by L. A. Shepp (Cincinnati, Ohio, January 1982) Volume 26 THE MATHEMATICS OF NETWORKS Edited by S. A. Burr (Pittsburgh, Pennsylvania, August 1981) Volume 25 OPERATIONS RESEARCH: MATHEMATICS AND MODELS Edited by S. I. Gass (Duluth, Minnesota, August 1979) Volume 24 GAME THEORY AND ITS APPLICATIONS Edited by W. F. Lucas (Biloxi, Mississippi, January 1979) PROCEEDINGS OF SYMPOSIA IN APPLIED MATHEMATICS Volume 23 MODERN STATISTICS: METHODS AND APPLICATIONS Edited by R. V. Hogg {San Antonio, Texas, January 1980) Volume 22 NUMERICAL ANALYSIS Edited by G. H. Golub and J. Oliger {Atlanta, Georgia, January 1978) Volume 21 MATHEMATICAL ASPECTS OF PRODUCTION AND DISTRIBUTION OF ENERGY Edited by P. D. Lax (San Antonio, Texas, January 1976) Volume 20 THE INFLUENCE OF COMPUTING ON MATHEMATICAL RESEARCH AND EDUCATION Edited by J. P LaSalle {University of Montana, August 1973) Volume 19 MATHEMATICAL ASPECTS OF COMPUTER SCIENCE Edited by J. T Schwartz {New York City, April 1966) Volume 18 MAGNETO-FLUID AND PLASMA DYNAMICS Edited by H. Grad {New York City, April 1965) Volume 17 APPLICATIONS OF NONLINEAR PARTIAL DIFFERENTIAL EQUATIONS IN MATHEMATICAL PHYSICS Edited by R. Finn {New York City, April 1964) Volume 16 STOCHASTIC PROCESSES IN MATHEMATICAL PHYSICS AND ENGINEERING Edited by R. Bellman {New York City, April 1963) Volume 15 EXPERIMENTAL ARITHMETIC, HIGH SPEED COMPUTING, AND MATHEMATICS Edited by N. C Metropolis, A. H. Taub, J. Todd, and C B. Tompkins {Atlantic City and Chicago, April 1962) Volume 14 MATHEMATICAL PROBLEMS IN THE BIOLOGICAL SCIENCES Edited by R. Bellman {New York City, April 1961) Volume 13 HYDRODYNAMIC INSTABILITY Edited by R. Bellman, G. Birkhoff and C C Lin {New York City, April I960) Volume 12 STRUCTURE OF LANGUAGE AND ITS MATHEMATICAL ASPECTS Edited by R. Jakobson {New York City, April I960) Volume 11 NUCLEAR REACTOR THEORY Edited by G. Birkhoff and E. P. Wigner {New York City, April 1959) Volume 10 COMBINATORIAL ANALYSIS Edited by R. Bellman and M. Hall, Jr. {New York University, April 1957) Volume 9 ORBIT THEORY Edited by G. Birkhoff and R. E. Langer {Columbia University, April 1958) Volume 8 CALCULUS OF VARIATIONS AND ITS APPLICATIONS Edited by L. M. Graves {University of Chicago, April 1956) Volume 7 APPLIED PROBABILITY Edited by L. A. MacColl {Polytechnic Institute of Brooklyn, April 1955) Volume 6 NUMERICAL ANALYSIS Edited by J. H. Curtiss {Santa Monica City College, August 1953) Volume 5 WAVE MOTION AND VIBRATION THEORY Edited by A. E. Heins {Carnegie Institute of Technology, June 1952) Volume 4 FLUID DYNAMICS Edited by M. H. Martin {University of Maryland, June 1951) PROCEEDINGS OF SYMPOSIA IN APPLIED MATHEMATICS Volume 3 ELASTICITY Edited by R. V. Churchill (University of Michigan, June 1949) Volume 2 ELECTROMAGNETIC THEORY Edited by A. H. Taub (Massachusetts Institute of Technology, July 1948) Volume 1 NON-LINEAR PROBLEMS IN MECHANICS OF CONTINUA Edited by E. Reissner (Brown University, August 1947) AMS SHORT COURSE LECTURE NOTES Introductor y Surve y Lecture s publishe d a s a subserie s of Proceeding s of Symposi a in Applie d Mathematic s PROCEEDING S O F SYMPOSI A IN APPLIE D MATHEMATIC S Volum e 43 Combinatoria l Game s Richar d K . Guy , Edito r Elwy n R . Berlekam p Joh n Horto n Conwa y Aviezr i S . Fraenke l Richar d J. Nowakowsk i Ver a Ples s America n Mathematica l Societ y Providence , Rhod e Islan d LECTURE NOTES PREPARED FOR THE AMERICAN MATHEMATICAL SOCIETY SHORT COURSE COMBINATORIAL GAMES HELD IN COLUMBUS, OHIO AUGUST 6-7, 1990 The AMS Short Course Series is sponsored by the Society's Committee on Employment and Educational Policy (CEEP). The series is under the direction of the Short Course Advisory Subcommittee of CEEP. 2000 Mathematics Subject Classification. Primary 91A05; Secondary 94B99. Library of Congress Cataloging-in-Publication Data Combinatorial games/Richard K. Guy, editor. p. cm. — (Proceedings of symposia in applied mathematics; v. 43. AMS short course lecture notes) ISBN 0-8218-0166-X 1. Game theory—Congresses. 2. Combinatorial analysis—Congresses. I. Guy, Richard K. II. Series: Proceedings of symposia in applied mathematics; v. 43. III. Series: Proceedings of symposia in applied mathematics. AMS Short course lecture notes. QA269.C65 1991 90-22771 519.3—dc20 CIP Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy a chapter for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given. Republication, systematic copying, or multiple reproduction of any material in this publication (including abstracts) is permitted only under license from the American Mathematical Society. Requests for such permission should be addressed to the Manager of Bkiitorial Services, American Mathematical Society, P.O. Box 6248, Providence, Rhode Island 02940-6248. Requests can also be made by e-mail to reprint-permissionCmath.ams.org. Copyright © 1991 by the American Mathematical Society The American Mathematical Society retains all rights except those granted to the United States Government. ) The paper used in this book is acid-free and falls within the guidelines established to ensure permanence and durability. Printed in the United States of America. This publication was prepared by the authors using T£jX. Visit the AMS home page at URL: http://www.ams.org/ 10 9 8 7 6 5 4 3 04 03 02 01 00 Table of Contents Preface xi What is a Game? RICHARD K. GUY 1 Numbers and Games JOHN HORTON CONWAY 23 Impartial Games RICHARD K. GUY 35 More Ways of Combining Games JOHN HORTON CONWAY 57 Introductory Overview of Mathematical Go Endgames ELWYN R. BERLEKAMP 73 Games and Codes VERA PLESS 101 Complexity of Games AVIEZRI S. FRAENKEL 111 ..., Welter's Game, Sylver Coinage, Dots-and-Boxes ,... RICHARD J. NOWAKOWSKI 155 Unsolved Problems in Combinatorial Games RICHARD K. GUY 183 Selected Bibliography on Combinatorial Games and Some Related Material AVIEZRI S. FRAENKEL 191 Index 227 Preface The subject of combinatorics is only slowly acquiring respectability and combinatorial games will clearly take longer than the rest of combina­ torics. Perhaps this partly stems from the puritanical view that anything amusing can't possibly involve any worthwhile mathematics. In the past, "game theory" has meant the subject delineated by von Neumann and Morgenstern, which has found wide, though usually un­ successful, application in economics, management, military strategy, and other useful forms of human activity. Combinatorial games, with com­ plete information, no chance moves, and no place for bluffing or coalitions, are of little interest to the classical game theorist, who knows that there is always at least one pure optimal strategy. Why, then, should we be interested in combinatorial games? Aviezri Praenkel gives some cogent reasons in the introduction to his Selected Bibliography at the end of this volume. There are many connexions with other parts of mathematics, only a few of which have so far begun to be explored, and only one of which is seriously considered here. Vera Pless explains the several connexions with coding theory, through which we make contact with most of the branches of the main stream of combinatorics, including graph theory. A whole new theory of number, including infinitesimals and transfinite numbers, has emerged as a special case of the theory of games. This is introduced by John Conway in the second chapter. Investigation of this remarkable area is only slowly gaining momentum, in spite of the early appearance of Donald Knuth's popularization, Surreal Numbers. Perhaps this only served to perpetuate the myth that we are dealing with a frivolous subject. As Aviezri Praenkel explains, complexity theory is very well illustrated by combinatorial games, which supply a plethora of examples of harder problems than most of those which have been considered in the past. XI xii Preface We have been able to do no more than touch on the theory of "hot" games, which are, of course, the interesting ones from a practical, as well as a theoretical point of view.
Recommended publications
  • The 'Crisis of Noosphere'
    The ‘crisis of noosphere’ as a limiting factor to achieve the point of technological singularity Rafael Lahoz-Beltra Department of Applied Mathematics (Biomathematics). Faculty of Biological Sciences. Complutense University of Madrid. 28040 Madrid, Spain. [email protected] 1. Introduction One of the most significant developments in the history of human being is the invention of a way of keeping records of human knowledge, thoughts and ideas. The storage of knowledge is a sign of civilization, which has its origins in ancient visual languages e.g. in the cuneiform scripts and hieroglyphs until the achievement of phonetic languages with the invention of Gutenberg press. In 1926, the work of several thinkers such as Edouard Le Roy, Vladimir Ver- nadsky and Teilhard de Chardin led to the concept of noosphere, thus the idea that human cognition and knowledge transforms the biosphere coming to be something like the planet’s thinking layer. At present, is commonly accepted by some thinkers that the Internet is the medium that brings life to noosphere. Hereinafter, this essay will assume that the words Internet and noosphere refer to the same concept, analogy which will be justified later. 2 In 2005 Ray Kurzweil published the book The Singularity Is Near: When Humans Transcend Biology predicting an exponential increase of computers and also an exponential progress in different disciplines such as genetics, nanotechnology, robotics and artificial intelligence. The exponential evolution of these technologies is what is called Kurzweil’s “Law of Accelerating Returns”. The result of this rapid progress will lead to human beings what is known as tech- nological singularity.
    [Show full text]
  • On Variations of Nim and Chomp Arxiv:1705.06774V1 [Math.CO] 18
    On Variations of Nim and Chomp June Ahn Benjamin Chen Richard Chen Ezra Erives Jeremy Fleming Michael Gerovitch Tejas Gopalakrishna Tanya Khovanova Neil Malur Nastia Polina Poonam Sahoo Abstract We study two variations of Nim and Chomp which we call Mono- tonic Nim and Diet Chomp. In Monotonic Nim the moves are the same as in Nim, but the positions are non-decreasing numbers as in Chomp. Diet-Chomp is a variation of Chomp, where the total number of squares removed is limited. 1 Introduction We study finite impartial games with two players where the same moves are available to both players. Players alternate moves. In a normal play, the person who does not have a move loses. In a misère play, the person who makes the last move loses. A P-position is a position from which the previous player wins, assuming perfect play. We can observe that all terminal positions are P-positions. An N-position is a position from which the next player wins given perfect play. When we play we want to end our move with a P-position and want to see arXiv:1705.06774v1 [math.CO] 18 May 2017 an N-position before our move. Every impartial game is equivalent to a Nim heap of a certain size. Thus, every game can be assigned a non-negative integer, called a nimber, nim- value, or a Grundy number. The game of Nim is played on several heaps of tokens. A move consists of taking some tokens from one of the heaps. The game of Chomp is played on a rectangular m by n chocolate bar with grid lines dividing the bar into mn squares.
    [Show full text]
  • Elementary Functions: Towards Automatically Generated, Efficient
    Elementary functions : towards automatically generated, efficient, and vectorizable implementations Hugues De Lassus Saint-Genies To cite this version: Hugues De Lassus Saint-Genies. Elementary functions : towards automatically generated, efficient, and vectorizable implementations. Other [cs.OH]. Université de Perpignan, 2018. English. NNT : 2018PERP0010. tel-01841424 HAL Id: tel-01841424 https://tel.archives-ouvertes.fr/tel-01841424 Submitted on 17 Jul 2018 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Délivré par l’Université de Perpignan Via Domitia Préparée au sein de l’école doctorale 305 – Énergie et Environnement Et de l’unité de recherche DALI – LIRMM – CNRS UMR 5506 Spécialité: Informatique Présentée par Hugues de Lassus Saint-Geniès [email protected] Elementary functions: towards automatically generated, efficient, and vectorizable implementations Version soumise aux rapporteurs. Jury composé de : M. Florent de Dinechin Pr. INSA Lyon Rapporteur Mme Fabienne Jézéquel MC, HDR UParis 2 Rapporteur M. Marc Daumas Pr. UPVD Examinateur M. Lionel Lacassagne Pr. UParis 6 Examinateur M. Daniel Menard Pr. INSA Rennes Examinateur M. Éric Petit Ph.D. Intel Examinateur M. David Defour MC, HDR UPVD Directeur M. Guillaume Revy MC UPVD Codirecteur À la mémoire de ma grand-mère Françoise Lapergue et de Jos Perrot, marin-pêcheur bigouden.
    [Show full text]
  • Arxiv:2101.07237V2 [Cs.CC] 19 Jan 2021 Ohtedsg N Oprtv Nlsso Obntra Games
    TRANSVERSE WAVE: AN IMPARTIAL COLOR-PROPAGATION GAME INSPRIED BY SOCIAL INFLUENCE AND QUANTUM NIM Kyle Burke Department of Computer Science, Plymouth State University, Plymouth, New Hampshire, https://turing.plymouth.edu/~kgb1013/ Matthew Ferland Department of Computer Science, University of Southern California, Los Angeles, California, United States Shang-Hua Teng1 Department of Computer Science, University of Southern California, Los Angeles, California, United States https://viterbi-web.usc.edu/~shanghua/ Abstract In this paper, we study a colorful, impartial combinatorial game played on a two- dimensional grid, Transverse Wave. We are drawn to this game because of its apparent simplicity, contrasting intractability, and intrinsic connection to two other combinatorial games, one inspired by social influence and another inspired by quan- tum superpositions. More precisely, we show that Transverse Wave is at the intersection of social-influence-inspired Friend Circle and superposition-based Demi-Quantum Nim. Transverse Wave is also connected with Schaefer’s logic game Avoid True. In addition to analyzing the mathematical structures and com- putational complexity of Transverse Wave, we provide a web-based version of the game, playable at https://turing.plymouth.edu/~kgb1013/DB/combGames/transverseWave.html. Furthermore, we formulate a basic network-influence inspired game, called Demo- graphic Influence, which simultaneously generalizes Node-Kyles and Demi- arXiv:2101.07237v2 [cs.CC] 19 Jan 2021 Quantum Nim (which in turn contains as special cases Nim, Avoid True, and Transverse Wave.). These connections illuminate the lattice order, induced by special-case/generalization relationships over mathematical games, fundamental to both the design and comparative analyses of combinatorial games. 1Supported by the Simons Investigator Award for fundamental & curiosity-driven research and NSF grant CCF1815254.
    [Show full text]
  • Impartial Games
    Combinatorial Games MSRI Publications Volume 29, 1995 Impartial Games RICHARD K. GUY In memory of Jack Kenyon, 1935-08-26 to 1994-09-19 Abstract. We give examples and some general results about impartial games, those in which both players are allowed the same moves at any given time. 1. Introduction We continue our introduction to combinatorial games with a survey of im- partial games. Most of this material can also be found in WW [Berlekamp et al. 1982], particularly pp. 81{116, and in ONAG [Conway 1976], particu- larly pp. 112{130. An elementary introduction is given in [Guy 1989]; see also [Fraenkel 1996], pp. ??{?? in this volume. An impartial game is one in which the set of Left options is the same as the set of Right options. We've noticed in the preceding article the impartial games = 0=0; 0 0 = 1= and 0; 0; = 2: {|} ∗ { | } ∗ ∗ { ∗| ∗} ∗ that were born on days 0, 1, and 2, respectively, so it should come as no surprise that on day n the game n = 0; 1; 2;:::; (n 1) 0; 1; 2;:::; (n 1) ∗ {∗ ∗ ∗ ∗ − |∗ ∗ ∗ ∗ − } is born. In fact any game of the type a; b; c;::: a; b; c;::: {∗ ∗ ∗ |∗ ∗ ∗ } has value m,wherem =mex a;b;c;::: , the least nonnegative integer not in ∗ { } the set a;b;c;::: . To see this, notice that any option, a say, for which a>m, { } ∗ This is a slightly revised reprint of the article of the same name that appeared in Combi- natorial Games, Proceedings of Symposia in Applied Mathematics, Vol. 43, 1991. Permission for use courtesy of the American Mathematical Society.
    [Show full text]
  • Combinatorial Game Theory Théorie Des Jeux Combinatoires (Org
    Combinatorial Game Theory Théorie des jeux combinatoires (Org: Melissa Huggan (Ryerson), Svenja Huntemann (Concordia University of Edmonton) and/et Richard Nowakowski (Dalhousie)) ALEXANDER CLOW, St. Francis Xavier University Red, Blue, Green Poset Games This talk examines Red, Blue, Green (partizan) poset games under normal play. Poset games are played on a poset where players take turns choosing an element of the partial order and removing every element greater than or equal to it in the ordering. The Left player can choose Blue elements (Right cannot) and the Right player can choose Red elements (while the Left cannot) and both players can choose Green elements. Red, Blue and Red, Blue, Green poset games have not seen much attention in the literature, do to most questions about Green poset games (such as CHOMP) remaining open. We focus on results that are true of all Poset games, but time allowing, FENCES, the poset game played on fences (or zig-zag posets) will be considered. This is joint work with Dr.Neil McKay. MATTHIEU DUFOUR AND SILVIA HEUBACH, UQAM & California State University Los Angeles Circular Nim CN(7,4) Circular Nim CN(n; k) is a variation on Nim. A move consists of selecting k consecutive stacks from n stacks arranged in a circle, and then to remove at least one token (and as many as all tokens) from the selected stacks. We will briefly review known results on Circular Nim CN(n; k) for small values of n and k and for some families, and then discuss new features that have arisen in the set of the P-positions of CN(7,4).
    [Show full text]
  • Algorithmic Combinatorial Game Theory∗
    Playing Games with Algorithms: Algorithmic Combinatorial Game Theory∗ Erik D. Demaine† Robert A. Hearn‡ Abstract Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we begin with general background in Combinatorial Game Theory, which analyzes ideal play in perfect-information games, and Constraint Logic, which provides a framework for showing hardness. Then we survey results about the complexity of determining ideal play in these games, and the related problems of solving puzzles, in terms of both polynomial-time algorithms and computational intractability results. Our review of background and survey of algorithmic results are by no means complete, but should serve as a useful primer. 1 Introduction Many classic games are known to be computationally intractable (assuming P 6= NP): one-player puzzles are often NP-complete (as in Minesweeper) or PSPACE-complete (as in Rush Hour), and two-player games are often PSPACE-complete (as in Othello) or EXPTIME-complete (as in Check- ers, Chess, and Go). Surprisingly, many seemingly simple puzzles and games are also hard. Other results are positive, proving that some games can be played optimally in polynomial time. In some cases, particularly with one-player puzzles, the computationally tractable games are still interesting for humans to play. We begin by reviewing some basics of Combinatorial Game Theory in Section 2, which gives tools for designing algorithms, followed by reviewing the relatively new theory of Constraint Logic in Section 3, which gives tools for proving hardness.
    [Show full text]
  • COMPSCI 575/MATH 513 Combinatorics and Graph Theory
    COMPSCI 575/MATH 513 Combinatorics and Graph Theory Lecture #34: Partisan Games (from Conway, On Numbers and Games and Berlekamp, Conway, and Guy, Winning Ways) David Mix Barrington 9 December 2016 Partisan Games • Conway's Game Theory • Hackenbush and Domineering • Four Types of Games and an Order • Some Games are Numbers • Values of Numbers • Single-Stalk Hackenbush • Some Domineering Examples Conway’s Game Theory • J. H. Conway introduced his combinatorial game theory in his 1976 book On Numbers and Games or ONAG. Researchers in the area are sometimes called onagers. • Another resource is the book Winning Ways by Berlekamp, Conway, and Guy. Conway’s Game Theory • Games, like everything else in the theory, are defined recursively. A game consists of a set of left options, each a game, and a set of right options, each a game. • The base of the recursion is the zero game, with no options for either player. • Last time we saw non-partisan games, where each player had the same options from each position. Today we look at partisan games. Hackenbush • Hackenbush is a game where the position is a diagram with red and blue edges, connected in at least one place to the “ground”. • A move is to delete an edge, a blue one for Left and a red one for Right. • Edges disconnected from the ground disappear. As usual, a player who cannot move loses. Hackenbush • From this first position, Right is going to win, because Left cannot prevent him from killing both the ground supports. It doesn’t matter who moves first.
    [Show full text]
  • ~Umbers the BOO K O F Umbers
    TH E BOOK OF ~umbers THE BOO K o F umbers John H. Conway • Richard K. Guy c COPERNICUS AN IMPRINT OF SPRINGER-VERLAG © 1996 Springer-Verlag New York, Inc. Softcover reprint of the hardcover 1st edition 1996 All rights reserved. No part of this publication may be reproduced, stored in a re­ trieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of the publisher. Published in the United States by Copernicus, an imprint of Springer-Verlag New York, Inc. Copernicus Springer-Verlag New York, Inc. 175 Fifth Avenue New York, NY lOOlO Library of Congress Cataloging in Publication Data Conway, John Horton. The book of numbers / John Horton Conway, Richard K. Guy. p. cm. Includes bibliographical references and index. ISBN-13: 978-1-4612-8488-8 e-ISBN-13: 978-1-4612-4072-3 DOl: 10.l007/978-1-4612-4072-3 1. Number theory-Popular works. I. Guy, Richard K. II. Title. QA241.C6897 1995 512'.7-dc20 95-32588 Manufactured in the United States of America. Printed on acid-free paper. 9 8 765 4 Preface he Book ofNumbers seems an obvious choice for our title, since T its undoubted success can be followed by Deuteronomy,Joshua, and so on; indeed the only risk is that there may be a demand for the earlier books in the series. More seriously, our aim is to bring to the inquisitive reader without particular mathematical background an ex­ planation of the multitudinous ways in which the word "number" is used.
    [Show full text]
  • ES.268 Dynamic Programming with Impartial Games, Course Notes 3
    ES.268 , Lecture 3 , Feb 16, 2010 http://erikdemaine.org/papers/AlgGameTheory_GONC3 Playing Games with Algorithms: { most games are hard to play well: { Chess is EXPTIME-complete: { n × n board, arbitrary position { need exponential (cn) time to find a winning move (if there is one) { also: as hard as all games (problems) that need exponential time { Checkers is EXPTIME-complete: ) Chess & Checkers are the \same" computationally: solving one solves the other (PSPACE-complete if draw after poly. moves) { Shogi (Japanese chess) is EXPTIME-complete { Japanese Go is EXPTIME-complete { U. S. Go might be harder { Othello is PSPACE-complete: { conjecture requires exponential time, but not sure (implied by P 6= NP) { can solve some games fast: in \polynomial time" (mostly 1D) Kayles: [Dudeney 1908] (n bowling pins) { move = hit one or two adjacent pins { last player to move wins (normal play) Let's play! 1 First-player win: SYMMETRY STRATEGY { move to split into two equal halves (1 pin if odd, 2 if even) { whatever opponent does, do same in other half (Kn + Kn = 0 ::: just like Nim) Impartial game, so Sprague-Grundy Theory says Kayles ≡ Nim somehow { followers(Kn) = fKi + Kn−i−1;Ki + Kn−i−2 j i = 0; 1; :::;n − 2g ) nimber(Kn) = mexfnimber(Ki + Kn−i−1); nimber(Ki + Kn−i−2) j i = 0; 1; :::;n − 2g { nimber(x + y) = nimber(x) ⊕ nimber(y) ) nimber(Kn) = mexfnimber(Ki) ⊕ nimber(Kn−i−1); nimber(Ki) ⊕ nimber(Kn−i−2) j i = 0; 1; :::n − 2g RECURRENCE! | write what you want in terms of smaller things Howe do w compute it? nimber(K0) = 0 (BASE CASE) nimber(K1) = mexfnimber(K0) ⊕ nimber(K0)g 0 ⊕ 0 = 0 = 1 nimber(K2) = mexfnimber(K0) ⊕ nimber(K1); 0 ⊕ 1 = 1 nimber(K0) ⊕ nimber(K0)g 0 ⊕ 0 = 0 = 2 so e.g.
    [Show full text]
  • Blue-Red Hackenbush
    Basic rules Two players: Blue and Red. Perfect information. Players move alternately. First player unable to move loses. The game must terminate. Mathematical Games – p. 1 Outcomes (assuming perfect play) Blue wins (whoever moves first): G > 0 Red wins (whoever moves first): G < 0 Mover loses: G = 0 Mover wins: G0 Mathematical Games – p. 2 Two elegant classes of games number game: always disadvantageous to move (so never G0) impartial game: same moves always available to each player Mathematical Games – p. 3 Blue-Red Hackenbush ground prototypical number game: Blue-Red Hackenbush: A player removes one edge of his or her color. Any edges not connected to the ground are also removed. First person unable to move loses. Mathematical Games – p. 4 An example Mathematical Games – p. 5 A Hackenbush sum Let G be a Blue-Red Hackenbush position (or any game). Recall: Blue wins: G > 0 Red wins: G < 0 Mover loses: G = 0 G H G + H Mathematical Games – p. 6 A Hackenbush value value (to Blue): 3 1 3 −2 −3 sum: 2 (Blue is two moves ahead), G> 0 3 2 −2 −2 −1 sum: 0 (mover loses), G= 0 Mathematical Games – p. 7 1/2 value = ? G clearly >0: Blue wins mover loses! x + x - 1 = 0, so x = 1/2 Blue is 1/2 move ahead in G. Mathematical Games – p. 8 Another position What about ? Mathematical Games – p. 9 Another position What about ? Clearly G< 0. Mathematical Games – p. 9 −13/8 8x + 13 = 0 (mover loses!) x = -13/8 Mathematical Games – p.
    [Show full text]
  • When Waiting Moves You in Scoring Combinatorial Games
    WHEN WAITING MOVES YOU IN SCORING COMBINATORIAL GAMES Urban Larsson1 Dalhousie University, Canada Richard J. Nowakowski Dalhousie University, Canada Carlos P. Santos2 Center for Linear Structures and Combinatorics, Portugal Abstract Combinatorial Scoring games, with the property ‘extra pass moves for a player does no harm’, are characterized. The characterization involves an order embedding of Conway’s Normal-play games. Also, we give a theorem for comparing games with scores (numbers) which extends Ettinger’s work on dicot Scoring games. 1 Introduction The Lawyer’s offer: To settle a dispute, a court has ordered you and your oppo- nent to play a Combinatorial game, the winner (most number of points) takes all. Minutes before the contest is to begin, your opponent’s lawyer approaches you with an offer: "You, and you alone, will be allowed a pass move to use once, at any time in the game, but you must use it at some point (unless the other player runs out of moves before you used it)." Should you accept this generous offer? We will show when you should accept and when you should decline the offer. It all depends on whether Conway’s Normal-play games (last move wins) can be embedded in the ‘game’ in an order preserving way. Combinatorial games have perfect information, are played by two players who move alternately, but moreover, the games finish regardless of the order of moves. When one of the players cannot move, the winner of the game is declared by some predetermined winning condition. The two players are usually called Left (female pronoun) and Right (male pronoun).
    [Show full text]