Crystal Bennett Joshua Chukwuka Advisor: Dr. K. Berg.

Slides:



Advertisements
Similar presentations
How to play SUDOKU adapted from Tilda Rosander.
Advertisements

CS 450: COMPUTER GRAPHICS LINEAR ALGEBRA REVIEW SPRING 2015 DR. MICHAEL J. REALE.
4.3 Matrix Approach to Solving Linear Systems 1 Linear systems were solved using substitution and elimination in the two previous section. This section.
Two-Player Zero-Sum Games
Tutorial 6 of CSCI2110 Bipartite Matching Tutor: Zhou Hong ( 周宏 )
New Toads and Frogs Results By Jeff Erickson Presented by Nate Swanson.
BINGO! Topic Create Your Game Card You will need a blank piece of paper.
    agic quares by Patti Bodkin.
CSE115/ENGR160 Discrete Mathematics 02/07/12
Sprouts By Tamsen Hunter Special Topics Background on Sprouts Invented in 1967 by John H. Conway, and Michael S. Paterson Paterson and Conway were.
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 68 Chapter 9 The Theory of Games.
Using Reduction for the Game of NIM. At each turn, a player chooses one pile and removes some sticks. The player who takes the last stick wins. Problem:
DAST 2005 Tirgul 6 Heaps Induction. DAST 2005 Heaps A binary heap is a nearly complete binary tree stored in an array object In a max heap, the value.
VOCABULARY  Deck or pack  Suit  Hearts  Clubs  Diamonds  Spades  Dealer  Shuffle  Pick up  Rank  Draw  Set  Joker  Jack 
Great Theoretical Ideas in Computer Science.
Matthew Marcon Project 19 1/10/12
 Take a card  Solve the task  Record your solution on a post-it  Find 3 other people with the same result.
The Pythagorean Theorem Objective: Find the length of a using the Pythagorean Theorem.
Great Theoretical Ideas in Computer Science.
Salvador Badillo-Rios and Verenice Mojica. Goal The goal of this research project was to provide an extended analysis of 2-D Chomp using computational.
Kim Moore, Program Manager Dr. Tonya Jeffery, Co-PI.
Row Reduction Method Lesson 6.4.
Brian Duddy.  Two players, X and Y, are playing a card game- goal is to find optimal strategy for X  X has red ace (A), black ace (A), and red two (2)
Investigation #1 Factors (Factor Game).
Solving Quadratic Equations
Investigation #1 (cont.)
Part II - Sums of Games Consider a game called Boxing Match which was defined in a programming contest m.short.html.
PSSA Survivor – Math Outwit Lesson.  comparing grades  placing events in date order  comparing the cost of two or more objects.
Investigation #1 Factors and Products.
Set Theory Topic 1: Logical Reasoning. I can determine and explain a strategy to solve a puzzle. I can verify a strategy to win a game. I can analyze.
Algebra 2: Module 4 Lesson 1
Section 3.1: Proof Strategy Now that we have a fair amount of experience with proofs, we will start to prove more difficult theorems. Our experience so.
6 Sums of Games.. Lecture6 Admin Plagiarism forms Answer football cup final problem. //Daisy Problem hints e.g. try a smaller size. General problem solving.
5.4 Factoring Greatest Common Factor,
How to Play Checkers This presentation is a tutorial on how to play on of the oldest and most popular games in history. Presented By: Cathryn Depuy Project.
Senior Project Poster Day 2007, CIS Dept. University of Pennsylvania Reversi Meng Tran Faculty Advisor: Dr. Barry Silverman Strategies: l Corners t Corners.
Investigation #1 (cont.) Products and Multiples. 1.3 The Product Game.
A game based off of the esteemed classic By: Tadziu Kosiara.
CSE 321 Discrete Structures Winter 2008 Lecture 5 Rules of Inference.
Lecture Coursework 2 AGAIN. Rectangle Game Look at proof of matchsticks A rectangular board is divided into m columns by n rows. The area of the board.
Multiples and Factors. Multiples A multiple is a number that is in the times tables. A multiple is a number that is in the times tables. Multiples of.
How Do I Solve This Thing?. You are familiar with Sudoku puzzles. For this variation, place the integers 1 – 9 into each row or column such that the.
Grid References.
A “Difference of Squares” is a binomial ( *2 terms only*) and it factors like this:
What is Matrix Multiplication? Matrix multiplication is the process of multiplying two matrices together to get another matrix. It differs from scalar.
Confidential1 Multiplying Decimals. Confidential2 WARM UP – = = – = Is it true?
Chomp. How is the game played Human player goes first choose a square, all to the right and down are “eaten” computer takes a turn whoever is forced to.
Battleships. You need to know How to draw two 11 x 11 grids How to read off names of squares.
Lecture Coursework 2. Rectangle Game Look at proof of matchsticks Read thru the question. A rectangular board is divided into m columns by n rows. The.
Patrick Racy Project 19 1/9/12
2-33. THE COLOR SQUARE GAME OBJECTIVE: FIGURE OUT THE ARRANGEMENT OF COLORED SQUARES ON A 3 × 3 GRID OR A 4 × 4 GRID USING AS FEW CLUES AS POSSIBLE. Rules:
Unit 3: Matrices. Matrix: A rectangular arrangement of data into rows and columns, identified by capital letters. Matrix Dimensions: Number of rows, m,
Modeling the Game of Brain Cube Leslie Muzulu, Kristal Jameson, and Kathy Radloff; St. Catherine University Game Description Brain Cube is a puzzle game.
K 3 -Saturator By Roy Oursler. What is K 3 -Saturator K 3 -Saturator is a combinatorial game A combinatorial game is a two player game where both of the.
Maths in Biosciences – Strategic sampling. Find the infected ash tree Column vector Coordinate Ash dieback DiseaseFungus epidemic.
{ Module 4 Lesson 3 Model tiling with centimeter and inch unit squares as a strategy to measure area.
Content Game of Nim Impartial Games Sprague-Grundy theorem
Hex: a Game of Connecting Faces. Player 1 Player 2 Players take turns placing blue chips (player 1) and red chips (player 2). Player 1 plays first. Player.
Hubert Chan (Chapters 1.6, 1.7, 4.1)
Great Theoretical Ideas in Computer Science
Christopher Hodgson and Gregory Tyler Loftis
Pathways and Pascal's Triangle.
NIM - a two person game n objects are in one pile
Lecture 20 Linear Program Duality
This is an Arithmagon….
Question 32.
Question 34.
CSE 321 Discrete Structures
CSE 321 Discrete Structures
Building pattern  Complete the following tables and write the rule 
Presentation transcript:

Crystal Bennett Joshua Chukwuka Advisor: Dr. K. Berg

Chomp.  Game Setup  Rules of gameplay  Positions  Theorem 1  Proof of Theorem 1  Approach to 3x5  Approach to 3xn  Theorem 1  Theorem 2  Theorem 3

Game Setup  Standard game consists of a grid of size mxn.  m = # of rows, n = # of columns.  Position on grid denoted by (i, j)

Game Setup  The (1, 1) square marked by “P” for poison is the least desired square.  You lose the game if you take the (1, 1) piece.

Rules of Gameplay

Rules of Game play. P P P

Positions

Plan  We will analyze Chomp positions for w = 0, 1, 2.

Theorem 1

Proof

Theorem 2  For any complete chomp grid of size m by n, there is a winning strategy. In other words, any one player before the starting of the game can always be sure of winning. PROOF: Because it is a complete m by n grid, it will have a square at its upper-right hand corner. Either taking that square is a winning move or it is not. Case 1: If it is a winning move, player 1 makes it and wins the game. Case 2: If it is a losing move then player 2 has a winning move in response to the first move which he makes and then wins the game. However, player 1 could have made player 2 move because it would require the removal of the square at the upper right hand corner and he would win the game.

Theorem 2. P

Theorem 3  For any chomp grid of size m by n (where m=n), that is a m by m grid, there is a winning strategy and the winning move is to take the (2,2) square. If the first player take the (2,2) square we would have 1 row and 1 column. Excluding the poisoned square,, there is (m-1) columns and rows. Then, the second player can only chomp from the bottom squares or the left squares. Since both are equal, it does not matter which squares player 2 takes from. His move always makes them unequal and the winning strategy for player 1 is to make his next move such that the 1nth row and column(without poison) have equal number of squares. This way, player 1 takes the last square from either the row or the column and then player 2 is left with the poisoned square and then loses.

Theorem 3 P

Theorem 4  For all stair case kind of chomp grid of step size 1, that is any row has one square more than the row above it there is a winning strategy.(except the first staircase) Case 1: For the staircase with three rows, the winning move is to chomp the (2,2) square. Case 2: For any staircase, the winning move is to chomp any square that makes the staircase a 2 by n with a winning move already made. PROOF: Case 1 is true by theorem 3. Case 2 is true by theorem 1.  Therefore, there is always a winning strategy for all staircase(excluding the (1,1))

Theorem 4 contd.

Approach to 3x5  Start at the 2x2 Square finding the winning positions.  Add one square at a time to the grid solving for the winning moves up until the 3x5 grid.  Analyze different types of staircase grids where the bottom, middle, and top row all have different lengths. P

Approach to 3x5  The position (3,4) is a winning position for the 3x5 grid.  How do I prove this. Analyze the winning moves for all grids up to the 3x5. Identify any patterns, or relations that may exist. P

Approach to 3x5 **** P

*** P

** P

* P

3x6 Chomp Grid. P W 1 Losing Position.

3x6 Chomp Grid. CASE 10CASE 11CASE 12 CASE 7CASE 8CASE 9 CASE 1CASE 2CASE 3 Possible Cases. CASE 4CASE 5CASE 6

3x6 Chomp Grid. Case 1 Case 1 is true by the Rules of Game play

3x6 Chomp Grid. Case 2 P Case 2 is true by Theorem 2

3x6 Chomp Grid. P Case 3 is true by Theorem 2. Case 3

3x6 Chomp Grid. Case 4 P Case 4 is true by Theorem 2.

3x6 Chomp Grid. Case 5 P Case 5 is true by Theorem 1.

3x6 Chomp Grid. Case 6 P Case 6 is true by Theorem 1.

3x6 Chomp Grid. Case 7 P Case 7 is true by Theorem 1.

3x6 Chomp Grid. Case 8. P Case 8 is true by the square chomp Theorem 3.

3x6 Chomp grid. Case 9 P

3x6 Chomp Grid. Case 10 P Case 10 is true by Theorem 3.(2xn)

3x6 Chomp Grid. Case 11 P Case 11 is true by Theorem C.

3x6 Chomp Grid Case 12 P Case 12 is true by Theorem c

Approach to 3xn  Use 2x2 up to 3x5 findings to solve larger grids at finding the winning positions.  Add one square at a time to the grid solving for the winning moves.  Analyze different types of staircase grids where the bottom, middle, and top row all have different lengths.  Record winning positions to see if we can find a relationship between the winning positions.

3x7 Chomp Grid.

CASE 15CASE 16CASE 17CASE 18 CASE 8CASE 9CASE 10CASE 11 CASE 1CASE 2CASE 3CASE 4 CASE 12CASE 13CASE 14 CASE 5CASE 6CASE 7

Q U E S T I O N S COMMENTS CONCERNS