DOCSLIB.ORG

Combinatorial Game Theory

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Combinatorial Game Theory Combinatorial Game Theory Cordelia Theseira and Nathan Josephs Boston University 1/31/19 Cordelia Theseira and Nathan Josephs ONAG 1 / 17 Let's Play a Game Rules of the Game: On your turn, you can take any number of coins provided they all come from the same heap The person who takes the last coin from all the heaps, wins. i.e. there are no coins left Cordelia Theseira and Nathan Josephs ONAG 2 / 17 Outline 1 What is a Game? 2 Games which are numbers Winning Strategies Simplicity Rule 3 Game of Nim Nim Addition 4 Conclusion Cordelia Theseira and Nathan Josephs ONAG 3 / 17 What is a Game? 8 rules for Combinatorial Games: 1 Two players, Left and Right 2 Finite many positions, including a starting position 3 Clearly defined rules for players to move from the current position to its options 4 Left and Right alternate in turns 5 Complete information 6 No chance moves 7 In the normal play convention the player unable to move loses 8 There exists an ending condition, i.e. game ends when either player is unable to move Cordelia Theseira and Nathan Josephs ONAG 4 / 17 G = fa; b; c; :::jd; e; f ; :::g Where G is the current position of the game and is determined by the options of the Left and Right players. G is a number when a; b; c; ::: ≤ d; e; f ; ::: Which Games are numbers? Cordelia Theseira and Nathan Josephs ONAG 5 / 17 G is a number when a; b; c; ::: ≤ d; e; f ; ::: Which Games are numbers? G = fa; b; c; :::jd; e; f ; :::g Where G is the current position of the game and is determined by the options of the Left and Right players. Cordelia Theseira and Nathan Josephs ONAG 5 / 17 Which Games are numbers? G = fa; b; c; :::jd; e; f ; :::g Where G is the current position of the game and is determined by the options of the Left and Right players. G is a number when a; b; c; ::: ≤ d; e; f ; ::: Cordelia Theseira and Nathan Josephs ONAG 5 / 17 Winning Strategies If G > 0, there is a winning strategy for Left. If G < 0, there is a winning strategy for Right. If G = 0, there is a winning strategy for the second player. Gjj0, there is a winning strategy for the first player. Cordelia Theseira and Nathan Josephs ONAG 6 / 17 Common Games 0 = fjg which is the ending condition n + 1 = fnjg which is a Left player win −n + 1 = fj − ng which is a Right player win ∗ = f0j0g which is a first player win Cordelia Theseira and Nathan Josephs ONAG 7 / 17 1 1 If Left has options f-3, 2 , 7g, options −3 and 2 would be dominated by 7. If Right had options f-6, -2, 0g, options 0 and 2 would be dominated by −6. Simplifying Games To simplify a game, we eliminate dominated options Cordelia Theseira and Nathan Josephs ONAG 8 / 17 Simplifying Games To simplify a game, we eliminate dominated options 1 1 If Left has options f-3, 2 , 7g, options −3 and 2 would be dominated by 7. If Right had options f-6, -2, 0g, options 0 and 2 would be dominated by −6. Cordelia Theseira and Nathan Josephs ONAG 8 / 17 a A whole number is simpler than 2 . a a 2 is simpler than 4 and so on. The smallest number that satisfies the above is the simplest number. Simplicity Rule Definition If all the options for both players of some game G are numbers, and every Left option is less than or equal to every Right option, then G itself is a number, namely the simplest number greater than every Left option and less than every Right option. 2p + 1 2p 2p + 2 p p + 1 G = = f j g = f j g 2n+1 2n+1 2n+1 2n 2n Cordelia Theseira and Nathan Josephs ONAG 9 / 17 Simplicity Rule Definition If all the options for both players of some game G are numbers, and every Left option is less than or equal to every Right option, then G itself is a number, namely the simplest number greater than every Left option and less than every Right option. 2p + 1 2p 2p + 2 p p + 1 G = = f j g = f j g 2n+1 2n+1 2n+1 2n 2n a A whole number is simpler than 2 . a a 2 is simpler than 4 and so on. The smallest number that satisfies the above is the simplest number. Cordelia Theseira and Nathan Josephs ONAG 9 / 17 5 , then G = 2 . If G = {−2j2g, then G = −1. 5 3 If G = f 4 j2g, then G = 2 . Examples If G = f2j3g Cordelia Theseira and Nathan Josephs ONAG 10 / 17 If G = {−2j2g, then G = −1. 5 3 If G = f 4 j2g, then G = 2 . Examples 5 If G = f2j3g, then G = 2 . Cordelia Theseira and Nathan Josephs ONAG 10 / 17 , then G = −1. 5 3 If G = f 4 j2g, then G = 2 . Examples 5 If G = f2j3g, then G = 2 . If G = {−2j2g Cordelia Theseira and Nathan Josephs ONAG 10 / 17 5 3 If G = f 4 j2g, then G = 2 . Examples 5 If G = f2j3g, then G = 2 . If G = {−2j2g, then G = −1. Cordelia Theseira and Nathan Josephs ONAG 10 / 17 3 , then G = 2 . Examples 5 If G = f2j3g, then G = 2 . If G = {−2j2g, then G = −1. 5 If G = f 4 j2g Cordelia Theseira and Nathan Josephs ONAG 10 / 17 Examples 5 If G = f2j3g, then G = 2 . If G = {−2j2g, then G = −1. 5 3 If G = f 4 j2g, then G = 2 . Cordelia Theseira and Nathan Josephs ONAG 10 / 17 A nimber, i.e. ?1, ?2, ?3..., represents the number of objects available to the players at every position of the game. E.g. The game we played was: G = f?1;?2;?3;?4;?5;?6j ? 1;?2;?3;?4;?5;?6g Nimbers are their own negatives. i.e. ?1 + ?2 + ?3 = 0 is the same as ?1 + ?3 = ?2 Game of Nim Nim is an impartial game. i.e. At every position, both players have the same legal moves. Cordelia Theseira and Nathan Josephs ONAG 11 / 17 E.g. The game we played was: G = f?1;?2;?3;?4;?5;?6j ? 1;?2;?3;?4;?5;?6g Nimbers are their own negatives. i.e. ?1 + ?2 + ?3 = 0 is the same as ?1 + ?3 = ?2 Game of Nim Nim is an impartial game. i.e. At every position, both players have the same legal moves. A nimber, i.e. ?1, ?2, ?3..., represents the number of objects available to the players at every position of the game. Cordelia Theseira and Nathan Josephs ONAG 11 / 17 Nimbers are their own negatives. i.e. ?1 + ?2 + ?3 = 0 is the same as ?1 + ?3 = ?2 Game of Nim Nim is an impartial game. i.e. At every position, both players have the same legal moves. A nimber, i.e. ?1, ?2, ?3..., represents the number of objects available to the players at every position of the game. E.g. The game we played was: G = f?1;?2;?3;?4;?5;?6j ? 1;?2;?3;?4;?5;?6g Cordelia Theseira and Nathan Josephs ONAG 11 / 17 Game of Nim Nim is an impartial game. i.e. At every position, both players have the same legal moves. A nimber, i.e. ?1, ?2, ?3..., represents the number of objects available to the players at every position of the game. E.g. The game we played was: G = f?1;?2;?3;?4;?5;?6j ? 1;?2;?3;?4;?5;?6g Nimbers are their own negatives. i.e. ?1 + ?2 + ?3 = 0 is the same as ?1 + ?3 = ?2 Cordelia Theseira and Nathan Josephs ONAG 11 / 17 How to lose in a 3-heap game: Equalize two heaps Empty a heap 3-Heap Game Facts: A single non-empty heap is fuzzy. Two equal-sized heaps is a zero game. Two unequal-sized heaps is fuzzy. Cordelia Theseira and Nathan Josephs ONAG 12 / 17 3-Heap Game Facts: A single non-empty heap is fuzzy. Two equal-sized heaps is a zero game. Two unequal-sized heaps is fuzzy. How to lose in a 3-heap game: Equalize two heaps Empty a heap Cordelia Theseira and Nathan Josephs ONAG 12 / 17 Nim Addition Table Cordelia Theseira and Nathan Josephs ONAG 13 / 17 Break each nimber into distinct parts whose sizes are powers of 2, beginning with the largest size. ?10 + ?6 = ?8 + ?2 + ?4 + ?2 ?10 + ?6 = ?8 + ?4 = 12 Nim Addition ?10 + ?6 = 12 Cordelia Theseira and Nathan Josephs ONAG 14 / 17 ?10 + ?6 = ?8 + ?2 + ?4 + ?2 ?10 + ?6 = ?8 + ?4 = 12 Nim Addition ?10 + ?6 = 12 Break each nimber into distinct parts whose sizes are powers of 2, beginning with the largest size. Cordelia Theseira and Nathan Josephs ONAG 14 / 17 ?10 + ?6 = ?8 + ?4 = 12 Nim Addition ?10 + ?6 = 12 Break each nimber into distinct parts whose sizes are powers of 2, beginning with the largest size. ?10 + ?6 = ?8 + ?2 + ?4 + ?2 Cordelia Theseira and Nathan Josephs ONAG 14 / 17 Nim Addition ?10 + ?6 = 12 Break each nimber into distinct parts whose sizes are powers of 2, beginning with the largest size. ?10 + ?6 = ?8 + ?2 + ?4 + ?2 ?10 + ?6 = ?8 + ?4 = 12 Cordelia Theseira and Nathan Josephs ONAG 14 / 17 In the game of Nim: Nimbers are their own negatives In a 3-heap game, the player who equalizes two heaps or empties a heap loses To add nimbers, break each nimber into distinct parts whose sizes are powers of 2 and use arithmetic addition Conclusion A game is a number if: all the options for both players are numbers every Left option is less than or equal to every Right option G will be the simplest number greater than every Left option and less than every Right option.
Load more

Recommended publications
  • 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]
  • An Very Brief Overview of Surreal Numbers for Gandalf MM 2014
    An very brief overview of Surreal Numbers for Gandalf MM 2014 Steven Charlton 1 History and Introduction Surreal numbers were created by John Horton Conway (of Game of Life fame), as a greatly simplified construction of an earlier object (Alling’s ordered field associated to the class of all ordinals, as constructed via modified Hahn series). The name surreal numbers was coined by Donald Knuth (of TEX and the Art of Computer Programming fame) in his novel ‘Surreal Numbers’ [2], where the idea was first presented. Surreal numbers form an ordered Field (Field with a capital F since surreal numbers aren’t a set but a class), and are in some sense the largest possible ordered Field. All other ordered fields, rationals, reals, rational functions, Levi-Civita field, Laurent series, superreals, hyperreals, . , can be found as subfields of the surreals. The definition/construction of surreal numbers leads to a system where we can talk about and deal with infinite and infinitesimal numbers as naturally and consistently as any ‘ordinary’ number. In fact it let’s can deal with even more ‘wonderful’ expressions 1 √ 1 ∞ − 1, ∞, ∞, ,... 2 ∞ in exactly the same way1. One large area where surreal numbers (or a slight generalisation of them) finds application is in the study and analysis of combinatorial games, and game theory. Conway discusses this in detail in his book ‘On Numbers and Games’ [1]. 2 Basic Definitions All surreal numbers are constructed iteratively out of two basic definitions. This is an wonderful illustration on how a huge amount of structure can arise from very simple origins.
    [Show full text]
  • An Introduction to Conway's Games and Numbers
    AN INTRODUCTION TO CONWAY’S GAMES AND NUMBERS DIERK SCHLEICHER AND MICHAEL STOLL 1. Combinatorial Game Theory Combinatorial Game Theory is a fascinating and rich theory, based on a simple and intuitive recursive definition of games, which yields a very rich algebraic struc- ture: games can be added and subtracted in a very natural way, forming an abelian GROUP (§ 2). There is a distinguished sub-GROUP of games called numbers which can also be multiplied and which form a FIELD (§ 3): this field contains both the real numbers (§ 3.2) and the ordinal numbers (§ 4) (in fact, Conway’s definition gen- eralizes both Dedekind sections and von Neumann’s definition of ordinal numbers). All Conway numbers can be interpreted as games which can actually be played in a natural way; in some sense, if a game is identified as a number, then it is under- stood well enough so that it would be boring to actually play it (§ 5). Conway’s theory is deeply satisfying from a theoretical point of view, and at the same time it has useful applications to specific games such as Go [Go]. There is a beautiful microcosmos of numbers and games which are infinitesimally close to zero (§ 6), and the theory contains the classical and complete Sprague-Grundy theory on impartial games (§ 7). The theory was founded by John H. Conway in the 1970’s. Classical references are the wonderful books On Numbers and Games [ONAG] by Conway, and Win- ning Ways by Berlekamp, Conway and Guy [WW]; they have recently appeared in their second editions.
    [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]
  • 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]
  • On Numbers, Germs, and Transseries
    On Numbers, Germs, and Transseries Matthias Aschenbrenner, Lou van den Dries, Joris van der Hoeven Abstract Germs of real-valued functions, surreal numbers, and transseries are three ways to enrich the real continuum by infinitesimal and infinite quantities. Each of these comes with naturally interacting notions of ordering and deriva- tive. The category of H-fields provides a common framework for the relevant algebraic structures. We give an exposition of our results on the model theory of H-fields, and we report on recent progress in unifying germs, surreal num- bers, and transseries from the point of view of asymptotic differential algebra. Contemporaneous with Cantor's work in the 1870s but less well-known, P. du Bois- Reymond [10]{[15] had original ideas concerning non-Cantorian infinitely large and small quantities [34]. He developed a \calculus of infinities” to deal with the growth rates of functions of one real variable, representing their \potential infinity" by an \actual infinite” quantity. The reciprocal of a function tending to infinity is one which tends to zero, hence represents an \actual infinitesimal”. These ideas were unwelcome to Cantor [39] and misunderstood by him, but were made rigorous by F. Hausdorff [46]{[48] and G. H. Hardy [42]{[45]. Hausdorff firmly grounded du Bois-Reymond's \orders of infinity" in Cantor's set-theoretic universe [38], while Hardy focused on their differential aspects and introduced the logarithmico-exponential functions (short: LE-functions). This led to the concept of a Hardy field (Bourbaki [22]), developed further mainly by Rosenlicht [63]{[67] and Boshernitzan [18]{[21]. For the role of Hardy fields in o-minimality see [61].
    [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]
  • Combinatorial Game Theory
    Combinatorial Game Theory Aaron N. Siegel Graduate Studies MR1EXLIQEXMGW Volume 146 %QIVMGER1EXLIQEXMGEP7SGMIX] Combinatorial Game Theory https://doi.org/10.1090//gsm/146 Combinatorial Game Theory Aaron N. Siegel Graduate Studies in Mathematics Volume 146 American Mathematical Society Providence, Rhode Island EDITORIAL COMMITTEE David Cox (Chair) Daniel S. Freed Rafe Mazzeo Gigliola Staffilani 2010 Mathematics Subject Classification. Primary 91A46. For additional information and updates on this book, visit www.ams.org/bookpages/gsm-146 Library of Congress Cataloging-in-Publication Data Siegel, Aaron N., 1977– Combinatorial game theory / Aaron N. Siegel. pages cm. — (Graduate studies in mathematics ; volume 146) Includes bibliographical references and index. ISBN 978-0-8218-5190-6 (alk. paper) 1. Game theory. 2. Combinatorial analysis. I. Title. QA269.S5735 2013 519.3—dc23 2012043675 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 is permitted only under license from the American Mathematical Society. Requests for such permission should be addressed to the Acquisitions Department, American Mathematical Society, 201 Charles Street, Providence, Rhode Island 02904-2294 USA. Requests can also be made by e-mail to [email protected]. c 2013 by the American Mathematical Society. All rights reserved. The American Mathematical Society retains all rights except those granted to the United States Government.
    [Show full text]
  • Interview with John Horton Conway
    Interview with John Horton Conway Dierk Schleicher his is an edited version of an interview with John Horton Conway conducted in July 2011 at the first International Math- ematical Summer School for Students at Jacobs University, Bremen, Germany, Tand slightly extended afterwards. The interviewer, Dierk Schleicher, professor of mathematics at Jacobs University, served on the organizing com- mittee and the scientific committee for the summer school. The second summer school took place in August 2012 at the École Normale Supérieure de Lyon, France, and the next one is planned for July 2013, again at Jacobs University. Further information about the summer school is available at http://www.math.jacobs-university.de/ summerschool. John Horton Conway in August 2012 lecturing John H. Conway is one of the preeminent the- on FRACTRAN at Jacobs University Bremen. orists in the study of finite groups and one of the world’s foremost knot theorists. He has written or co-written more than ten books and more than one- received the Pólya Prize of the London Mathemati- hundred thirty journal articles on a wide variety cal Society and the Frederic Esser Nemmers Prize of mathematical subjects. He has done important in Mathematics of Northwestern University. work in number theory, game theory, coding the- Schleicher: John Conway, welcome to the Interna- ory, tiling, and the creation of new number systems, tional Mathematical Summer School for Students including the “surreal numbers”. He is also widely here at Jacobs University in Bremen. Why did you known as the inventor of the “Game of Life”, a com- accept the invitation to participate? puter simulation of simple cellular “life” governed Conway: I like teaching, and I like talking to young by simple rules that give rise to complex behavior.
    [Show full text]
  • Flipping the Winner of a Poset Game Adam O
    Illinois Mathematics and Science Academy DigitalCommons@IMSA Published Student Papers Student Works 1-1-2011 Flipping the winner of a poset game Adam O. Kalinich '12 Illinois Mathematics and Science Academy Follow this and additional works at: http://digitalcommons.imsa.edu/published_student_papers Part of the Mathematics Commons, and the Theory and Algorithms Commons Recommended Citation Kalinich, Adam O. (2011). Flipping the winner of a poset game. Information Processing Letters, 112 (2012), 86-89. This Article is brought to you for free and open access by the Student Works at DigitalCommons@IMSA. It has been accepted for inclusion in Published Student Papers by an authorized administrator of DigitalCommons@IMSA. For more information, please contact [email protected], [email protected]. Flipping the winner of a poset game Adam O. Kalinich Illinois Math and Science Academy, 1500 Sullivan Road, Aurora, IL 60506, United States ARTICLE INFO ABSTRACT Article history: Partially-ordered set games, also called poset games, are a class of two-player Received 4 May 2011 combinatorial games. The playing field consists of a set of elements, some of which are Received in revised form 30 September 2011 greater than other elements. Two players take turns removing an element and all elements Accepted 30 September 2011 greater than it, and whoever takes the last element wins. Examples of poset games include Available online 15 October 2011 Nim and Chomp. We investigate the complexity of computing which player of a poset Communicated by J. Torán game has a winning strategy. We give an inductive procedure that modifies poset games to change the nim-value which informally captures the winning strategies in the game.
    [Show full text]
  • Crash Course on Combinatorial Game Theory
    CRASH COURSE ON COMBINATORIAL GAME THEORY ALFONSO GRACIA{SAZ Disclaimer: These notes are a sketch of the lectures delivered at Mathcamp 2009 containing only the definitions and main results. The lectures also included moti- vation, exercises, additional explanations, and an opportunity for the students to discover the patterns by themselves, which is always more enjoyable than merely reading these notes. 1. The games we will analyze We will study combinatorial games. These are games: • with two players, who take turns moving, • with complete information (for example, there are no cards hidden in your hand that only you can see), • deterministic (for example, no dice or flipped coins), • guaranteed to finish in a finite amount of time, • without loops, ties, or draws, • where the first player who cannot move loses. In this course, we will specifically concentrate on impartial combinatorial games. Those are combinatorial games in which the legal moves for both players are the same. 2. Nim Rules of nim: • We play with various piles of beans. • On their turn, a player removes one or more beans from the same pile. • Final position: no beans left. Notation: • A P-position is a \previous player win", e.g. (0,0,0), (1,1,0). • An N-position is a \next player win", e.g. (1,0,0), (2,1,0). We win by always moving onto P-positions. Definition. Given two natural numbers a and b, their nim-sum, written a ⊕ b, is calculated as follows: • write a and b in binary, • \add them without carrying", i.e., for each position digit, 0 ⊕ 0 = 1 ⊕ 1 = 0, 0 ⊕ 1 = 1 ⊕ 0 = 1.
    [Show full text]