The Game Creation operator

Slides:



Advertisements
Similar presentations
Boyce/DiPrima 9th ed, Ch 2.8: The Existence and Uniqueness Theorem Elementary Differential Equations and Boundary Value Problems, 9th edition, by William.
Advertisements

Order Structure, Correspondence, and Shape Based Categories Presented by Piotr Dollar October 24, 2002 Stefan Carlsson.
Primitive Recursive Functions (Chapter 3)
Closure Properties of CFL's
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved. CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION.
Basic Properties of Relations
II. Linear Independence 1.Definition and Examples.
1 Introduction to Computability Theory Lecture12: Reductions Prof. Amos Israeli.
Discrete Mathematics Lecture 4 Harper Langston New York University.
Discrete Structures Chapter 2 Part B Mathematical Induction
I. Isomorphisms II. Homomorphisms III. Computing Linear Maps IV. Matrix Operations V. Change of Basis VI. Projection Topics: Line of Best Fit Geometry.
5.IV. Jordan Form 5.IV.1. Polynomials of Maps and Matrices 5.IV.2. Jordan Canonical Form.
Normal forms for Context-Free Grammars
Optical Flow Estimation using Variational Techniques Darya Frolova.
Linear Equations in Linear Algebra
Boyce/DiPrima 9th ed, Ch 11.2: Sturm-Liouville Boundary Value Problems Elementary Differential Equations and Boundary Value Problems, 9th edition, by.
Discrete Structures Chapter 5: Sequences, Mathematical Induction, and Recursion 5.2 Mathematical Induction I [Mathematical induction is] the standard proof.
Copyright © Cengage Learning. All rights reserved. 3 Differentiation Rules.
6 6.3 © 2012 Pearson Education, Inc. Orthogonality and Least Squares ORTHOGONAL PROJECTIONS.
Induction and recursion
Copyright © Cengage Learning. All rights reserved. CHAPTER 11 ANALYSIS OF ALGORITHM EFFICIENCY ANALYSIS OF ALGORITHM EFFICIENCY.
GROUPS & THEIR REPRESENTATIONS: a card shuffling approach Wayne Lawton Department of Mathematics National University of Singapore S ,
Diophantine Approximation and Basis Reduction
The Integers. The Division Algorithms A high-school question: Compute 58/17. We can write 58 as 58 = 3 (17) + 7 This forms illustrates the answer: “3.
Independence and Bernoulli Trials. Sharif University of Technology 2 Independence  A, B independent implies: are also independent. Proof for independence.
Mathematical Induction
Section 2.3 Properties of Solution Sets
CS 103 Discrete Structures Lecture 13 Induction and Recursion (1)
Theory of Computation Lecture 5: Primitive Recursive Functions I
Basic Theory (for curve 01). 1.1 Points and Vectors  Real life methods for constructing curves and surfaces often start with points and vectors, which.
MA5233 Lecture 6 Krylov Subspaces and Conjugate Gradients Wayne M. Lawton Department of Mathematics National University of Singapore 2 Science Drive 2.
1 Section 4.4 Inductive Proof What do we believe about nonempty subsets of N? Since  N, <  is well-founded, and in fact it is linear, it follows that.
Dilworth’s theorem and extremal set theory 張雁婷 國立交通大學應用數學系.
Computing with Laminated Integral Lattices. Richard Parker Aachen Sept
Sporadic and Related groups Lecture 15 Introduction to Fusion.
Lecture 2: Proofs and Recursion. Lecture 2-1: Proof Techniques Proof methods : –Inductive reasoning Lecture 2-2 –Deductive reasoning Using counterexample.
7.3 Linear Systems of Equations. Gauss Elimination
CS 9633 Machine Learning Support Vector Machines
The Acceptance Problem for TMs
Keeping your Distance is Hard
Copyright © Cengage Learning. All rights reserved.
Silvia Heubach Department of Mathematics NSS Retreat, May 25, 2017
Great Theoretical Ideas in Computer Science
CSE15 Discrete Mathematics 02/08/17
The minimum cost flow problem
Mathematical Induction II
CSNB 143 Discrete Mathematical Structures
New results in Circular Nim
Gray Code Can you find an ordering of all the n-bit strings in such a way that two consecutive n-bit strings differed by only one bit? This is called the.
Sets and Logic…. Chapters 5 and 6
Chapter 10: Mathematical proofs
Math 344 Winter 07 Group Theory Part 1: Basic definitions and Theorems
GROUPS & THEIR REPRESENTATIONS: a card shuffling approach
Copyright © Cengage Learning. All rights reserved.
Basis and Dimension Basis Dimension Vector Spaces and Linear Systems
Alternating tree Automata and Parity games
Copyright © Cengage Learning. All rights reserved.
Computing Nash Equilibrium
2.III. Basis and Dimension
The Fundamental Theorem of Calculus
Copyright © Cengage Learning. All rights reserved.
Quantum Two.
Properties of Solution Sets
Quantum Foundations Lecture 2
Part 7. Phantoms: Legal States That Cannot Be Constructed
Copyright © Cengage Learning. All rights reserved.
NON-NEGATIVE COMPONENT PARTS OF SOUND FOR CLASSIFICATION Yong-Choon Cho, Seungjin Choi, Sung-Yang Bang Wen-Yi Chu Department of Computer Science &
THE LAPLACE TRANSFORM LEARNING GOALS Definition
Approximation of Functions
Presentation transcript:

The Game Creation operator Joint work with Urban Larsson and Matthieu Dufour Silvia Heubach California State University Los Angeles Combinatorial Game Theory Colloquium II January 25 - 27, 2017

Much of this work was done during my sabbatical visit to Berkeley in October 2015

Vector Subtraction Games A vector subtraction or vector take-away game is played on one or more stacks of tokens Positions are described as vectors of stack heights The subtraction set M consists of the possible moves in the form of subtraction vectors. A move can be used as long as it does not result in negative stack height(s) Make sure to talk about moves also as positions – reinterpreted? Examples, same structure, then segway into the *-operator. Take one token from stack 1 (1, 0, 0, 0) (5, 3, 2, 1)

Misère-Play ★-Operator Observation: For vector subtraction games, positions and allowed moves have the same structure! This allows us to iteratively create new games. The misère ★-operator is defined as follows: We start with a subtraction game M that is described by the allowed moves. We compute the set of P-positions, P(M) The losing positions of M become the moves for the game M★ Notation: M0 = M, Mn = (Mn-1)★ M is reflexive if M = M★

Complementary Beatty Sequences & Games Duchêne-Rigo Conjecture: Every complementary pair of homogeneous Beatty sequences forms the set of losing positions for some invariant impartial game. This conjecture was proved by Larsson, Hegarty and Fraenkel using the normal-play ★-operator M★ = P(M) - 0; M is reflexive if M = M★★

Questions for Misère-Play ★-Operator Question 1: Does the misère-play ★-operator converge (point-wise)? Question 2: What feature(s) of M determine(s) the limit game for its sequence? Question 3: Limit games are (by definition) reflexive. What is the structure of reflexive games and/or limit games (if they exist)? Question 4: How quickly does convergence occur? Limit games: [in normal play little is known is known about structure] Speed of convergence: [not known in normal play?]

Example for One Stack Misère-Play ★-operator applied five times to initial game M5 M4 M3 M2 M1 M0 M0 = {4, 7, 11} G0 = {4, 9}

Observations from Example Looks like there is convergence (fixed point) for each of the two games Limit games seem to have a periodic structure: blocks of moves alternate with blocks of non-moves M0 = {4, 7, 11} and G0 = {4, 9} seem to have the same limit game Question: What do the two sets M0 and G0 have in common? Answer: The minimal element, k = 4.

Q1: Convergence Result Theorem Starting from any game M on d stacks, the sequence of games created by the misère-play ★-operator converges to a (reflexive) limit game M∞.

Convergence Result Proof idea: (for d stacks) Weight of a position = sum of stack heights = number of tokens Inductive proof: For game Mn, all positions of weight n or less are fixed as either move or non-move. Basis: In game M0, the position of weight 0 (the zero vector) is fixed as an N-position Convergence is faster than increase by one token

Example M0 = {4, 7, 11} Point out that there are switches from non-move to move and then to non-move, but it is not the smallest such non-fixed position. Smallest one is important as we use that there is no move from a P-position to another P-position. Any move from that smallest position that is different will get us into the territory that is fixed already. Go back to slide 8 x = 5 x = 15 x = 26 x = 38

Q2: Which Feature of M Determines M∞ ? Theorem Two games M and G (played on the same number of stacks) have the same limit game if and only if their unique sets of minimal elements (with the usual partial order) are the same.

Q3: Characteristic of Reflexive Games The following lemma is used to prove specific results for one and two stacks. Lemma The game A on d stacks is reflexive if and only if its set of moves A (as a set) satisfies A + A = Ac \ TA where TA is the set of terminal positions of the game A. Note that there is a similar result for **-operator P-position + move = non-terminal N-position

Structure of Reflexive Games on One Stack Mk:= { i pk + k, …, i pk + (2k – 1)| i = 0,1,…}, where pk = 3k-1 Pattern: period 3k-1; starts at k has k moves, followed by 2k-1 non-moves. Theorem The game M is reflexive iff M = Mk for some k > 0.

Structure of Limit/Reflexive Games on Two Stacks Classification of games according to minimal moves Exactly one minimal move Not on an axis On one of the axes Exactly two minimal moves No minimal move on an axis Exactly one move is on an axis Both moves are on the axes Three or more minimal moves Two moves are on the axes

Example: Two Minima on Axes Indicate that this is a somewhat difficult example to show the variety of what can happen

Definition of Game Mj,k pk (0,k) (j,0) pj

Reflexivity of Mj,k Theorem [Bloomfield, Dufour, Heubach, Larsson] The game Mj,k is reflexive. Corollary The limit game of a set M equals the game Mj,k if and only if the set of minimal elements of M is {(j,0),(0,k)}. Corollary follows from the general result in d dimensions that the limit game has same minimal set as limit game. Together with the fact that M_j,k is reflexive (and hence a limit game of itself?), we get the corollary.

Q4: How Long until Convergence? We can only answer this question for games on one stack and for specific initial games Proof: We explicitly derive the games M1 through M5. For games on two stacks we have very varied results from our computer explorations Theorem For M = {k} with k > 1 it takes exactly 5 iterations for the limit game to appear for the first time. For k = 1, it takes 2 steps???

Future Work Investigate the structure of the limit games in the other classes for games on two stacks Computer experiments for three minimal elements have produced “L-shaped” limit games, limit games with diagonal stripes, and limit games that combine the two features

Three Minimal Moves – Two on Axes Convergence after 8 steps

Three minimal moves – two on axes Convergence after 7 steps

Three Minimal Moves – Two on Axes Convergence after 7 steps

Three Minimal Moves – Two on Axes Convergence after 6 steps

More than three Minimal Moves – None on Axis Convergence after 2 steps

Future Work Investigate the structure of the limit games in the other classes for games on two stacks Number of steps to convergence, or showing that it happens in a finite number of steps for all games or for games of a particular (sub-) class

Future Work Conjecture For all vector subtraction games on two stacks, limit games under the misère-play ★-operator are ultimately periodic along any line of rational slope.

References E. Duchêne and M. Rigo. Invariant games, Theoretical Computer Science, 411, pp 3169-3180, 2010. U. Larsson, P. Hegarty, and A. S. Fraenkel. Invariant and dual subtraction games resolving the Duchêne-Rigo conjecture, Theoretical Computer Science, 412, pp 729-735, 2011. U. Larsson. The ★-operator and invariant subtraction games. Theoretical Computer Science, 422, pp 52-58, 2012. M. Dufour, S. Heubach, and U. Larsson, A Misère-Play ★-Operator, preprint. (arXiv:1608.06996v1)

Slides will be posted on my web site THANK YOU! sheubac@calstatela.edu Slides will be posted on my web site http://www.calstatela.edu/faculty/silvia-heubach