Numan Sheikh FC College Lahore
|
|
- Liliana West
- 5 years ago
- Views:
Transcription
1 Numan Sheikh FC College Lahore
2 2
3 Five men crash-land their airplane on a deserted island in the South Pacific. On their first day they gather as many coconuts as they can find into one big pile. They decide that, since it is getting dark, they will wait until the next day to divide the coconuts. That night each man took a turn watching for rescue searchers while the others slept. The first watcher got bored so he decided to divide the coconuts into five equal piles. When he did this, he found he had one remaining coconut. He gave this coconut to a monkey, took one of the piles, and hid it for himself. Then he jumbled up the four other piles into one big pile again. To cut a long story short, each of the five men ended up doing exactly the same thing. They each divided the coconuts into five equal piles and had one extra coconut left over, which they gave to the monkey. They each took one of the five piles and hid those coconuts. They each came back and jumbled up the remaining four piles into one big pile. What is the smallest number of coconuts there could have been in the original pile? 3
4 Answer!!!!! Algebra, Discrete Maths, etc!!! 4
5 Well of course you can memorize the solution!!! There are plenty available on the internet But in order to teach a computer or to come up with an algorithm to solve it you may need graph theory, group theory, etc. and may be Computer Vision 5
6 The instant insanity game consists of four cubes which are colored differently on each face with the colors red, white (or yellow), blue, and green. The object of the game is given four of these blocks the player is to figure out how to stack the four blocks on top of one another so as to obtain four different colored faces on each side of the stack. There are many different games and many different solutions. 6
7 The problem with this game is in using four blocks which can each be placed in 24 different positions in the stack the possibility of stacks is: 24 2 = 331,776 possible stacks That is a lot of stacks! 7
8 One way is to play around with the cubes for hours until you figure it out. However, there is a math approach using graphs and graph theory 8
9 9
10 I am sure you are all familiar with Tic-tac-toe? No? زریو-اکاٹ In 1976, Frank Harary introduced a new form of tictac-toe. As usual, players alternate X's and O's. 10
11 For a particular shape and board, player X attempts to make the shape, while player O prevents the shape. For example, let us look at the following shape Who wins on a particular board, For example, our familiar 8x8 chess board? No-body knows. What would it take to solve? 11
12 Two Players: I and II A move consists of removing one, two, or three chips from the pile Players alternate moves, with Player I starting Player that removes the last chip wins 12
13 If there are 1, 2, or 3 only, player who moves next wins If there are 4 chips left, player who moves next must leave 1, 2 or 3 chips, and his opponent will win With 5, 6 or 7 chips left, the player who moves next can win by leaving 4 chips 13
14 0, 4, 8, 12, 16, are target positions; if a player moves to that position, they can win the game Therefore, with 21 chips, Player I can win! 14
15 If there is 1 chip, the player who moves next loses If there are 2,3, or 4 chips left, the player who moves next can win by leaving only 1 In this case, 1, 5, 9, 13, are a win for the second player 15
16 There are two players There is a finite set of possible positions The rules of the game specify for both players and each position which moves to other positions are legal moves The players alternate moving The game ends in a finite number of moves (no draws!) 16
17 Normal Play Rule: The last player to move wins Misère Play Rule: The last player to move loses A Terminal Position is one where neither player can move anymore 17
18 No random moves (This rules out games like Poker, Ludo and other dice games) No hidden moves (This rules out games like battleship and a lot of card games) No draws in a finite number of moves (This rules out tic-tac-toe) 18
19 P-Position: Positions that are winning for the Previous player (the player who just moved) N-Position: Positions that are winning for the Next player (the player who is about to move) 19
20 0, 4, 8, 12, 16, are P-positions; if a player moves to that position, they can win the game 21 chips is an N-position 20
21 That means: For any move that N makes There exists a move for P such that For any move that N makes There exists a move for P such that There exists a move for P such that There are no possible moves for N 21
22 P-positions and N-positions can be defined recursively by the following: (1) All terminal positions are P-positions (2) From every N-position, there is at least one move to a P-position (3) From every P-position, every move is to an N-position 22
23 Two-player game, where each move consists of taking a square and removing it and all squares to the right and above. So it is a Misère game!!! Player who takes position (0,0) loses 23
24 N-Positions! 24
25 P-position! 25
26 26
27 27
28 28
29 Theorem: Proof: The winning strategy for player I is to chomp on (1,1), leaving only an L shaped position Then, for any move that Player II takes, Player I can simply mirror it on the flip side of the L 29
30 30
31 Proof: Theorem: Look at this first move: If this is a P-position, then player 1 wins Otherwise, there exists a P-position that can be obtained from this position And player I could have just taken that move originally 31
32 So we have just learnt that Player I can win in any rectangular starting position of Chomp What about his strategy? What about the strategy of a non-rectangular Chomp This is an Open Question!!! 32
33 Two-player game, where each move consists of taking the token and moving it either downwards or to the left (but not both). Player who makes the last move (to (0,0)) wins Similarities with Chomp? Any? Differences? 33
34 34
35 A Graph or Network is a set of vertices (dots) with edges (lines) connecting them. A B A B A multiple edge D C D C A loop A B D C Two vertices are adjacent if there is a line between them. The vertices A and B above are adjacent because the edge AB is between them. An edge is incident to each of the vertices which are its end points. The degree of a vertex is the number of edges sticking out from it. 35
36 Lets take a complete graph on 6 vertices. 2 players: green and yellow. All the edges in the graph are initially not colored. Players alternate by coloring an uncolored edge. Green draws green edges. Yellow draws yellow edges. If a green triangle is formed, green loses. If a yellow triangle is formed, yellow loses. If all possible edges get drawn without a monochromatic triangle (triangle of a single color) being formed, green and yellow tie. 36
37 Is it possible that the game ends in a tie, even if two players cooperate? The answer is NO, Why? Well we require a proof!!! What about game on complete graph on 5 vertices? What about the game on other graphs? other substructures? more than two players? All are interesting questions, and a lot of them are still open 37
38 B R G W R G G W G B W 1 B 2 G R R W R B R W B G R 3 W 4 Graph Theory Yay!!! 38
39 We will model each cube with a multi-graph. The vertices will correspond to the four colors and we connect the corresponding vertices u and v if there is a pair of opposite faces colored u and v. 39
40 1 Now construct a single multi-graph with 4 vertices and the 12 edges, labeling each edge by the cube associated with it R W B G 2 40
41 Suppose the puzzle has a solution. How would it be represented on the final multi-graph? One sub-graph will represent the front and back of the tower and a second sub-graph will represent the sides of the tower. Using an edge in a sub-graph corresponds to a positioning of the cube (either front/back or sides). 3 4 R W 1 4 B G 2 41
42 What are the restrictions on the sub-graphs and how do they relate to the solution? Uses all four vertices. (all four colors) 42
43 What are the restrictions on the sub-graphs and how do they relate to the solution? Uses all four vertices. Must contain four edges, one from each cube. (all four colors) (orient each cube) 43
44 What are the restrictions on the sub-graphs and how do they relate to the solution? Uses all four vertices. Must contain four edges, one from each cube. No edge can be used more than once. (all four colors) (orient each cube) (can t use same orientation twice) 44
45 What are the restrictions on the sub-graphs and how do they relate to the solution? Uses all four vertices. Must contain four edges, one from each cube. No edge can be used more than once. Each vertex must be of degree 2. (all four colors) (orient each cube) (can t use same orientation twice) (use that color twice, one front & one back, or one left & one right) Remember any similar Graph property??? 45
46 4 f b b f 2 3 b f f 1 b l r r l 1 l r l r Now, stack the cubes using these faces as the front/back and sides. Since each edge represents an orientation, label the edges to determine the orientation. Is there another solution? Is it possible to find a set of sub-graphs that use the loops? 3 4 R B W 1 G
47 47
Plan. Related courses. A Take-Away Game. Mathematical Games , (21-801) - Mathematical Games Look for it in Spring 11
V. Adamchik D. Sleator Great Theoretical Ideas In Computer Science Mathematical Games CS 5-25 Spring 2 Lecture Feb., 2 Carnegie Mellon University Plan Introduction to Impartial Combinatorial Games Related
More informationTutorial 1. (ii) There are finite many possible positions. (iii) The players take turns to make moves.
1 Tutorial 1 1. Combinatorial games. Recall that a game is called a combinatorial game if it satisfies the following axioms. (i) There are 2 players. (ii) There are finite many possible positions. (iii)
More informationTangent: Boromean Rings. The Beer Can Game. Plan. A Take-Away Game. Mathematical Games I. Introduction to Impartial Combinatorial Games
K. Sutner D. Sleator* Great Theoretical Ideas In Computer Science CS 15-251 Spring 2014 Lecture 110 Feb 4, 2014 Carnegie Mellon University Tangent: Boromean Rings Mathematical Games I Challenge for next
More informationRamsey Theory The Ramsey number R(r,s) is the smallest n for which any 2-coloring of K n contains a monochromatic red K r or a monochromatic blue K s where r,s 2. Examples R(2,2) = 2 R(3,3) = 6 R(4,4)
More informationGrade 7 & 8 Math Circles. Mathematical Games
Faculty of Mathematics Waterloo, Ontario N2L 3G1 The Loonie Game Grade 7 & 8 Math Circles November 19/20/21, 2013 Mathematical Games In the loonie game, two players, and, lay down 17 loonies on a table.
More informationFigure 1: The Game of Fifteen
1 FIFTEEN One player has five pennies, the other five dimes. Players alternately cover a number from 1 to 9. You win by covering three numbers somewhere whose sum is 15 (see Figure 1). 1 2 3 4 5 7 8 9
More informationCS 32 Puzzles, Games & Algorithms Fall 2013
CS 32 Puzzles, Games & Algorithms Fall 2013 Study Guide & Scavenger Hunt #2 November 10, 2014 These problems are chosen to help prepare you for the second midterm exam, scheduled for Friday, November 14,
More informationGame, Set, and Match Carl W. Lee September 2016
Game, Set, and Match Carl W. Lee September 2016 Note: Some of the text below comes from Martin Gardner s articles in Scientific American and some from Mathematical Circles by Fomin, Genkin, and Itenberg.
More information(b) In the position given in the figure below, find a winning move, if any. (b) In the position given in Figure 4.2, find a winning move, if any.
Math 5750-1: Game Theory Midterm Exam Mar. 6, 2015 You have a choice of any four of the five problems. (If you do all 5, each will count 1/5, meaning there is no advantage.) This is a closed-book exam,
More informationThe Mathematics of Playing Tic Tac Toe
The Mathematics of Playing Tic Tac Toe by David Pleacher Although it has been shown that no one can ever win at Tic Tac Toe unless a player commits an error, the game still seems to have a universal appeal.
More informationMath 152: Applicable Mathematics and Computing
Math 152: Applicable Mathematics and Computing April 16, 2017 April 16, 2017 1 / 17 Announcements Please bring a blue book for the midterm on Friday. Some students will be taking the exam in Center 201,
More informationGAMES AND STRATEGY BEGINNERS 12/03/2017
GAMES AND STRATEGY BEGINNERS 12/03/2017 1. TAKE AWAY GAMES Below you will find 5 different Take Away Games, each of which you may have played last year. Play each game with your partner. Find the winning
More informationPositive Triangle Game
Positive Triangle Game Two players take turns marking the edges of a complete graph, for some n with (+) or ( ) signs. The two players can choose either mark (this is known as a choice game). In this game,
More informationGraph Nim. PURE Insights. Breeann Flesch Western Oregon University,
PURE Insights Volume rticle 0 Graph Nim reeann Flesch Western Oregon University, fleschb@mail.wou.edu kaanchya Pradhan Western Oregon University, apradhan0@mail.wou.edu Follow this and additional works
More informationCombined Games. Block, Alexander Huang, Boao. icamp Summer Research Program University of California, Irvine Irvine, CA
Combined Games Block, Alexander Huang, Boao icamp Summer Research Program University of California, Irvine Irvine, CA 92697 August 17, 2013 Abstract What happens when you play Chess and Tic-Tac-Toe at
More informationGames, Triangulations, Theory
KTdCW Spieltheorie Games, Triangulations, Theory Oswin Aichholzer, University of Technology, Graz (Austria) KTdCW, Spieltheorie, Aichholzer NIM & Co 0 What is a (mathematical) game? 2 players [ A,B / L(eft),R(ight)
More informationBackground. Game Theory and Nim. The Game of Nim. Game is Finite 1/27/2011
Background Game Theory and Nim Dr. Michael Canjar Department of Mathematics, Computer Science and Software Engineering University of Detroit Mercy 26 January 2010 Nimis a simple game, easy to play. It
More informationContents. MA 327/ECO 327 Introduction to Game Theory Fall 2017 Notes. 1 Wednesday, August Friday, August Monday, August 28 6
MA 327/ECO 327 Introduction to Game Theory Fall 2017 Notes Contents 1 Wednesday, August 23 4 2 Friday, August 25 5 3 Monday, August 28 6 4 Wednesday, August 30 8 5 Friday, September 1 9 6 Wednesday, September
More informationExploring Concepts with Cubes. A resource book
Exploring Concepts with Cubes A resource book ACTIVITY 1 Gauss s method Gauss s method is a fast and efficient way of determining the sum of an arithmetic series. Let s illustrate the method using the
More informationOCTAGON 5 IN 1 GAME SET
OCTAGON 5 IN 1 GAME SET CHESS, CHECKERS, BACKGAMMON, DOMINOES AND POKER DICE Replacement Parts Order direct at or call our Customer Service department at (800) 225-7593 8 am to 4:30 pm Central Standard
More informationSelected Game Examples
Games in the Classroom ~Examples~ Genevieve Orr Willamette University Salem, Oregon gorr@willamette.edu Sciences in Colleges Northwestern Region Selected Game Examples Craps - dice War - cards Mancala
More informationGrade 6 Math Circles Combinatorial Games - Solutions November 3/4, 2015
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 6 Math Circles Combinatorial Games - Solutions November 3/4, 2015 Chomp Chomp is a simple 2-player
More informationUNC Charlotte 2012 Comprehensive
March 5, 2012 1. In the English alphabet of capital letters, there are 15 stick letters which contain no curved lines, and 11 round letters which contain at least some curved segment. How many different
More informationMidterm 2 6:00-8:00pm, 16 April
CS70 2 Discrete Mathematics and Probability Theory, Spring 2009 Midterm 2 6:00-8:00pm, 16 April Notes: There are five questions on this midterm. Answer each question part in the space below it, using the
More informationCircular Nim Games. S. Heubach 1 M. Dufour 2. May 7, 2010 Math Colloquium, Cal Poly San Luis Obispo
Circular Nim Games S. Heubach 1 M. Dufour 2 1 Dept. of Mathematics, California State University Los Angeles 2 Dept. of Mathematics, University of Quebeq, Montreal May 7, 2010 Math Colloquium, Cal Poly
More informationCS 2710 Foundations of AI. Lecture 9. Adversarial search. CS 2710 Foundations of AI. Game search
CS 2710 Foundations of AI Lecture 9 Adversarial search Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square CS 2710 Foundations of AI Game search Game-playing programs developed by AI researchers since
More informationProblem Solving Problems for Group 1(Due by EOC Sep. 13)
Problem Solving Problems for Group (Due by EOC Sep. 3) Caution, This Induction May Induce Vomiting! 3 35. a) Observe that 3, 3 3, and 3 3 56 3 3 5. 3 Use inductive reasoning to make a conjecture about
More informationMath 152: Applicable Mathematics and Computing
Math 152: Applicable Mathematics and Computing May 8, 2017 May 8, 2017 1 / 15 Extensive Form: Overview We have been studying the strategic form of a game: we considered only a player s overall strategy,
More informationGame, Set, and Match Carl W. Lee September 2016
Game, Set, and Match Carl W. Lee September 2016 Note: Some of the text below comes from Martin Gardner s articles in Scientific American and some from Mathematical Circles by Fomin, Genkin, and Itenberg.
More information1, 2,, 10. Example game. Pieces and Board: This game is played on a 1 by 10 board. The initial position is an empty board.
,,, 0 Pieces and Board: This game is played on a by 0 board. The initial position is an empty board. To Move: Players alternate placing either one or two pieces on the leftmost open squares. In this game,
More informationDice Activities for Time and Money
Dice Activities for Time and Money Foreword Contents Successful math students construct their own strategies for solving problems and performing mathematical operations. The activities in Dice Activities
More informationGrade 6 Math Circles Combinatorial Games November 3/4, 2015
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 6 Math Circles Combinatorial Games November 3/4, 2015 Chomp Chomp is a simple 2-player game. There
More informationUCI Math Circle October 10, Clock Arithmetic
UCI Math Circle October 10, 2016 Clock Arithmetic 1. Pretend that it is 3:00 now (ignore am/pm). (a) What time will it be in 17 hours? (b) What time was it 22 hours ago? (c) The clock on the right has
More informationGrade 7/8 Math Circles Game Theory October 27/28, 2015
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Game Theory October 27/28, 2015 Chomp Chomp is a simple 2-player game. There is
More informationJUSTIN. 2. Go play the following game with Justin. This is a two player game with piles of coins. On her turn, a player does one of the following:
ADAM 1. Play the following hat game with Adam. Each member of your team will receive a hat with a colored dot on it (either red or black). Place the hat on your head so that everyone can see the color
More informationLEARNING ABOUT MATH FOR GR 1 TO 2. Conestoga Public School OCTOBER 13, presented by Kathy Kubota-Zarivnij
LEARNING ABOUT MATH FOR GR 1 TO 2 Conestoga Public School OCTOBER 13, 2016 6:30 pm 8:00 pm presented by Kathy Kubota-Zarivnij kathkubo@gmail.com TODAY S MATH TOOLS FOR counters playing cards dice interlocking
More informationRealizing Strategies for winning games. Senior Project Presented by Tiffany Johnson Math 498 Fall 1999
Realizing Strategies for winning games Senior Project Presented by Tiffany Johnson Math 498 Fall 1999 Outline of Project Briefly show how math relates to popular board games in playing surfaces & strategies
More informationPROBLEMS & INVESTIGATIONS. Introducing Add to 15 & 15-Tac-Toe
Unit One Connecting Mathematical Topics Session 10 PROBLEMS & INVESTIGATIONS Introducing Add to 15 & 15-Tac-Toe Overview To begin, students find many different ways to add combinations of numbers from
More informationCS 1571 Introduction to AI Lecture 12. Adversarial search. CS 1571 Intro to AI. Announcements
CS 171 Introduction to AI Lecture 1 Adversarial search Milos Hauskrecht milos@cs.pitt.edu 39 Sennott Square Announcements Homework assignment is out Programming and experiments Simulated annealing + Genetic
More informationarxiv: v1 [math.ho] 17 Mar 2009
BIDDING CHESS JAY BHAT AND SAM PAYNE arxiv:090.99v [math.ho] Mar 009 It all started with a chessboard and a bottle of raki at an otherwise respectable educational institution. SP s friend Ed had just returned
More informationProblem A To and Fro (Problem appeared in the 2004/2005 Regional Competition in North America East Central.)
Problem A To and Fro (Problem appeared in the 2004/2005 Regional Competition in North America East Central.) Mo and Larry have devised a way of encrypting messages. They first decide secretly on the number
More informationInstruction Cards Sample
Instruction Cards Sample mheducation.com/prek-12 Instruction Cards Table of Contents Level A: Tunnel to 100... 1 Level B: Race to the Rescue...15 Level C: Fruit Collector...35 Level D: Riddles in the Labyrinth...41
More informationSenior Math Circles February 10, 2010 Game Theory II
1 University of Waterloo Faculty of Mathematics Centre for Education in Mathematics and Computing Senior Math Circles February 10, 2010 Game Theory II Take-Away Games Last Wednesday, you looked at take-away
More informationGrade 7/8 Math Circles November 24/25, Review What have you learned in the past seven weeks?
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles November 24/25, 2015 Review What have you learned in the past seven weeks? First
More informationThe learner will recognize and use geometric properties and relationships.
The learner will recognize and use geometric properties and relationships. Notes 3and textbook 3.01 Use the coordinate system to describe the location and relative position of points and draw figures in
More informationCard Racer. By Brad Bachelor and Mike Nicholson
2-4 Players 30-50 Minutes Ages 10+ Card Racer By Brad Bachelor and Mike Nicholson It s 2066, and you race the barren desert of Indianapolis. The crowd s attention span isn t what it used to be, however.
More informationSolutions to Part I of Game Theory
Solutions to Part I of Game Theory Thomas S. Ferguson Solutions to Section I.1 1. To make your opponent take the last chip, you must leave a pile of size 1. So 1 is a P-position, and then 2, 3, and 4 are
More informationmywbut.com Two agent games : alpha beta pruning
Two agent games : alpha beta pruning 1 3.5 Alpha-Beta Pruning ALPHA-BETA pruning is a method that reduces the number of nodes explored in Minimax strategy. It reduces the time required for the search and
More informationMake Math Meaningful!
Make Math Meaningful! I hear, and I forget. I see, and I remember. I do, and I understand. Knowledge comes easily to those who understand. Proverbs 14:6 B-A-T Place Value Game B = Brilliant; right number
More informationGames of Skill ANSWERS Lesson 1 of 9, work in pairs
Lesson 1 of 9, work in pairs 21 (basic version) The goal of the game is to get the other player to say the number 21. The person who says 21 loses. The first person starts by saying 1. At each turn, the
More informationGough, John , Doing it with dominoes, Australian primary mathematics classroom, vol. 7, no. 3, pp
Deakin Research Online Deakin University s institutional research repository DDeakin Research Online Research Online This is the published version (version of record) of: Gough, John 2002-08, Doing it
More informationSTUDENT S BOOKLET. Geometry 2. Contents. Meeting 7 Student s Booklet. May 24 UCI. 1 Circular Mountains 2 Rotations
Meeting 7 Student s Booklet Geometry 2 Contents May 24 2017 @ UCI 1 Circular Mountains 2 Rotations STUDENT S BOOKLET UC IRVINE MATH CEO http://www.math.uci.edu/mathceo/ 1 CIRCULAR MOUNTAINS 2 1 CIRCULAR
More informationCombinatorics: The Fine Art of Counting
Combinatorics: The Fine Art of Counting The Final Challenge Part One You have 30 minutes to solve as many of these problems as you can. You will likely not have time to answer all the questions, so pick
More informationContents. The Counting Stick 2. Squashy Boxes 5. Piles of Dominoes 6. Nelly Elephants 7. Sneaky Snakes 9. Data in Games 11. Day and Night Game 12
Contents Title Page The Counting Stick 2 Squashy Boxes 5 Piles of Dominoes 6 Nelly Elephants 7 Sneaky Snakes 9 Data in Games 11 Day and Night Game 12 Favourite Instrument 14 2 The Counting Stick A counting
More informationAdversarial Search 1
Adversarial Search 1 Adversarial Search The ghosts trying to make pacman loose Can not come up with a giant program that plans to the end, because of the ghosts and their actions Goal: Eat lots of dots
More informationGame Variations: Ultimate Tic Tac Toe
Game Variations: Ultimate Tic Tac Toe Middle School In this lesson, students will experience the engineering process when creating modifications to a familiar game. Next Generation Science Standards MS-ETS1-1
More informationA GRAPH THEORETICAL APPROACH TO SOLVING SCRAMBLE SQUARES PUZZLES. 1. Introduction
GRPH THEORETICL PPROCH TO SOLVING SCRMLE SQURES PUZZLES SRH MSON ND MLI ZHNG bstract. Scramble Squares puzzle is made up of nine square pieces such that each edge of each piece contains half of an image.
More informationIntroduction to Auction Theory: Or How it Sometimes
Introduction to Auction Theory: Or How it Sometimes Pays to Lose Yichuan Wang March 7, 20 Motivation: Get students to think about counter intuitive results in auctions Supplies: Dice (ideally per student)
More informationState Math Contest Junior Exam SOLUTIONS
State Math Contest Junior Exam SOLUTIONS 1. The following pictures show two views of a non standard die (however the numbers 1-6 are represented on the die). How many dots are on the bottom face of figure?
More informationSTAJSIC, DAVORIN, M.A. Combinatorial Game Theory (2010) Directed by Dr. Clifford Smyth. pp.40
STAJSIC, DAVORIN, M.A. Combinatorial Game Theory (2010) Directed by Dr. Clifford Smyth. pp.40 Given a combinatorial game, can we determine if there exists a strategy for a player to win the game, and can
More information7. Suppose that at each turn a player may select one pile and remove c chips if c =1
Math 5750-1: Game Theory Midterm Exam with solutions Mar 6 2015 You have a choice of any four of the five problems (If you do all 5 each will count 1/5 meaning there is no advantage) This is a closed-book
More informationConversion Masters in IT (MIT) AI as Representation and Search. (Representation and Search Strategies) Lecture 002. Sandro Spina
Conversion Masters in IT (MIT) AI as Representation and Search (Representation and Search Strategies) Lecture 002 Sandro Spina Physical Symbol System Hypothesis Intelligent Activity is achieved through
More informationGames of Skill Lesson 1 of 9, work in pairs
Lesson 1 of 9, work in pairs 21 (basic version) The goal of the game is to get the other player to say the number 21. The person who says 21 loses. The first person starts by saying 1. At each turn, the
More information2. The Extensive Form of a Game
2. The Extensive Form of a Game In the extensive form, games are sequential, interactive processes which moves from one position to another in response to the wills of the players or the whims of chance.
More informationThe first player, Fred, turns on the calculator, presses a digit key and then presses the
1. The number pad of your calculator or your cellphone can be used to play a game between two players. Number pads for telephones are usually opposite way up from those of calculators, but that does not
More information7 = Part-Part-Whole. Games = 6 + 1
Part-Part-Whole Games 7 = 6 + 1 5 + 2 = 6 + 1 Capture 4 Materials: Regular dice, Capture 4 board game, and cubes or whiteboard markers Play Capture 4 with 2 dice or 1 die. Kids can capture as many spaces
More informationOn Variations of Nim and Chomp
arxiv:1705.06774v1 [math.co] 18 May 2017 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
More informationGrade 7/8 Math Circles November 24/25, Review What have you learned in the past seven weeks?
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles November 24/25, 2015 Review What have you learned in the past seven weeks? First
More informationFigure 1: A Checker-Stacks Position
1 1 CHECKER-STACKS This game is played with several stacks of black and red checkers. You can choose any initial configuration you like. See Figure 1 for example (red checkers are drawn as white). Figure
More informationDELUXE 3 IN 1 GAME SET
Chess, Checkers and Backgammon August 2012 UPC Code 7-19265-51276-9 HOW TO PLAY CHESS Chess Includes: 16 Dark Chess Pieces 16 Light Chess Pieces Board Start Up Chess is a game played by two players. One
More informationDependence. Math Circle. October 15, 2016
Dependence Math Circle October 15, 2016 1 Warm up games 1. Flip a coin and take it if the side of coin facing the table is a head. Otherwise, you will need to pay one. Will you play the game? Why? 2. If
More informationOperation Target. Round Number Sentence Target How Close? Building Fluency: creating equations and the use of parentheses.
Operations and Algebraic Thinking 5. OA.1 2 Operation Target Building Fluency: creating equations and the use of parentheses. Materials: digit cards (0-9) and a recording sheet per player Number of Players:
More informationINF September 25, The deadline is postponed to Tuesday, October 3
INF 4130 September 25, 2017 New deadline for mandatory assignment 1: The deadline is postponed to Tuesday, October 3 Today: In the hope that as many as possibble will turn up to the important lecture on
More informationTILINGS at Berkeley Math Circle! Inspired by Activities of Julia Robinson Math Festival and Nina Cerutti and Leo B. of SFMC.
TILINGS at Berkeley Math Circle! Inspired by Activities of Julia Robinson Math Festival and Nina Cerutti and Leo B. of SFMC. Tiling Torment The problem There are many problems that involve tiling (covering)
More informationV. Adamchik Data Structures. Game Trees. Lecture 1. Apr. 05, Plan: 1. Introduction. 2. Game of NIM. 3. Minimax
Game Trees Lecture 1 Apr. 05, 2005 Plan: 1. Introduction 2. Game of NIM 3. Minimax V. Adamchik 2 ü Introduction The search problems we have studied so far assume that the situation is not going to change.
More informationarxiv: v1 [math.co] 12 Jan 2017
RULES FOR FOLDING POLYMINOES FROM ONE LEVEL TO TWO LEVELS JULIA MARTIN AND ELIZABETH WILCOX arxiv:1701.03461v1 [math.co] 12 Jan 2017 Dedicated to Lunch Clubbers Mark Elmer, Scott Preston, Amy Hannahan,
More informationCombinatorics: The Fine Art of Counting
Combinatorics: The Fine Art of Counting The Final Challenge Part One Solutions Whenever the question asks for a probability, enter your answer as either 0, 1, or the sum of the numerator and denominator
More informationObliged Sums of Games
Obliged Sums of Games Thomas S. Ferguson Mathematics Department, UCLA 1. Introduction. Let g be an impartial combinatorial game. In such a game, there are two players, I and II, there is an initial position,
More informationMohammad Hossein Manshaei 1394
Mohammad Hossein Manshaei manshaei@gmail.com 394 Some Formal Definitions . First Mover or Second Mover?. Zermelo Theorem 3. Perfect Information/Pure Strategy 4. Imperfect Information/Information Set 5.
More informationGame, Set, and Match A Personal Journey
A Personal Journey Carl Lee University of Kentucky Centre College October 2015 Centre College October 2015 1 / Introduction As I reflect, I acknowledge that I was fortunate in several ways: I have had
More informationBouncy Dice Explosion
The Big Idea Bouncy Dice Explosion This week you re going to toss bouncy rubber dice to see what numbers you roll. You ll also play War to see who s the high roller. Finally, you ll move onto a giant human
More informationTable of Contents. Table of Contents 1
Table of Contents 1) The Factor Game a) Investigation b) Rules c) Game Boards d) Game Table- Possible First Moves 2) Toying with Tiles a) Introduction b) Tiles 1-10 c) Tiles 11-16 d) Tiles 17-20 e) Tiles
More informationInstant Insanity (Supplemental Material for Intro to Graph Theory)
Instant Insanity (Supplemental Material for Intro to raph Theory) obert A. eeler May, 07 Introduction InstantInsanity(seeFigure)isapuzzleintroducedaround900whenitwas called The reat Tantalizer (or simply
More informationGames on graphs. Keywords: positional game, Maker-Breaker, Avoider-Enforcer, probabilistic
Games on graphs Miloš Stojaković Department of Mathematics and Informatics, University of Novi Sad, Serbia milos.stojakovic@dmi.uns.ac.rs http://www.inf.ethz.ch/personal/smilos/ Abstract. Positional Games
More informationEXPLORING TIC-TAC-TOE VARIANTS
EXPLORING TIC-TAC-TOE VARIANTS By Alec Levine A SENIOR RESEARCH PAPER PRESENTED TO THE DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE OF STETSON UNIVERSITY IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR
More informationCS 440 / ECE 448 Introduction to Artificial Intelligence Spring 2010 Lecture #5
CS 440 / ECE 448 Introduction to Artificial Intelligence Spring 2010 Lecture #5 Instructor: Eyal Amir Grad TAs: Wen Pu, Yonatan Bisk Undergrad TAs: Sam Johnson, Nikhil Johri Topics Game playing Game trees
More informationMathematics. Programming
Mathematics for the Digital Age and Programming in Python >>> Second Edition: with Python 3 Maria Litvin Phillips Academy, Andover, Massachusetts Gary Litvin Skylight Software, Inc. Skylight Publishing
More informationAdversarial Search Aka Games
Adversarial Search Aka Games Chapter 5 Some material adopted from notes by Charles R. Dyer, U of Wisconsin-Madison Overview Game playing State of the art and resources Framework Game trees Minimax Alpha-beta
More informationImpartial Combinatorial Games Berkeley Math Circle Intermediate II Ted Alper Evans Hall, room 740 Sept 1, 2015
Impartial Combinatorial Games Berkeley Math Circle Intermediate II Ted Alper Evans Hall, room 740 Sept 1, 2015 tmalper@stanford.edu 1 Warmups 1.1 (Kozepiskolai Matematikai Lapok, 1980) Contestants B and
More information2 person perfect information
Why Study Games? Games offer: Intellectual Engagement Abstraction Representability Performance Measure Not all games are suitable for AI research. We will restrict ourselves to 2 person perfect information
More informationTake one! Rules: Two players take turns taking away 1 chip at a time from a pile of chips. The player who takes the last chip wins.
Take-Away Games Introduction Today we will play and study games. Every game will be played by two players: Player I and Player II. A game starts with a certain position and follows some rules. Players
More informationGeneralized Amazons is PSPACE Complete
Generalized Amazons is PSPACE Complete Timothy Furtak 1, Masashi Kiyomi 2, Takeaki Uno 3, Michael Buro 4 1,4 Department of Computing Science, University of Alberta, Edmonton, Canada. email: { 1 furtak,
More informationGame components. Common components: 1 dice tower. 24 progress tokens. 40 commodity tokens 8 of each type
Follow the lead of the famous navigator and discoverer Amerigo Vespucci. New lands are waiting to be discovered and to provide a new homeland rich with valuable resources ffor its settlers. Good planning
More informationARTIFICIAL INTELLIGENCE (CS 370D)
Princess Nora University Faculty of Computer & Information Systems ARTIFICIAL INTELLIGENCE (CS 370D) (CHAPTER-5) ADVERSARIAL SEARCH ADVERSARIAL SEARCH Optimal decisions Min algorithm α-β pruning Imperfect,
More informationChapter 4 Number Theory
Chapter 4 Number Theory Throughout the study of numbers, students Á should identify classes of numbers and examine their properties. For example, integers that are divisible by 2 are called even numbers
More informationThe Game of SET R, and its Mathematics.
The Game of SET R, and its Mathematics. Bobby Hanson April 2, 2008 But, as for everything else, so for a mathematical theory beauty can be perceived but not explained. A. Cayley Introduction The game of
More informationMATH GAMES THAT SUPPORT SINGAPORE MATH GRADES
Box Cars and One-Eyed Jacks MATH GAMES THAT SUPPORT SINGAPORE MATH GRADES 3-5 JOHN FELLING SMART TRAINING SCOTTSDALE, AZ July 9, 2015 john@boxcarsandoneeyedjacks.com phone 1-866-342-3386 / 1-780-440-6284
More informationCHECKMATE! A Brief Introduction to Game Theory. Dan Garcia UC Berkeley. The World. Kasparov
CHECKMATE! The World A Brief Introduction to Game Theory Dan Garcia UC Berkeley Kasparov Welcome! Introduction Topic motivation, goals Talk overview Combinatorial game theory basics w/examples Computational
More information3. Bishops b. The main objective of this lesson is to teach the rules of movement for the bishops.
page 3-1 3. Bishops b Objectives: 1. State and apply rules of movement for bishops 2. Use movement rules to count moves and captures 3. Solve problems using bishops The main objective of this lesson is
More informationDice Activities for Algebraic Thinking
Foreword Dice Activities for Algebraic Thinking Successful math students use the concepts of algebra patterns, relationships, functions, and symbolic representations in constructing solutions to mathematical
More information