The Chooser-Picker 7-in-a-row game András Csernenszky July 3 2008 Szeged.

Slides:



Advertisements
Similar presentations
P ROBLEM S OLVING WITH 6C Probability and strategy.
Advertisements

Backtrack Algorithm for Listing Spanning Trees R. C. Read and R. E. Tarjan (1975) Presented by Levit Vadim.
Some Graph Problems. LINIAL’S CONJECTURE Backgound: In a partially ordered set we have Dilworth’s Theorem; The largest size of an independent set (completely.
Tic Tac Toe Game playing strategies
CHAPTER 10 FUN AND GAMES Group 1: Xiangling Liu.
TIC-TAC-TOE FELIX CHEN CLUSTER 5: Computers in Biophysics and Robotics.
Microsoft® Small Basic Advanced Games Estimated time to complete this lesson: 1 hour.
Tutorial 6 of CSCI2110 Bipartite Matching Tutor: Zhou Hong ( 周宏 )
Presented by : Ashin Ara Bithi Roll : 09 Iffat Ara Roll : 22 12th Batch Department of Computer Science & Engineering University of Dhaka.
The Angel Wins!! SASMS, Nov 13, 2006 David Rhee. 1. Conway’s Angel Problem An angel of power p and a devil plays a game on a infinitely big chessboard.
Positional Games Michael Krivelevich Tel Aviv University.
Mechanism Design without Money Lecture 4 1. Price of Anarchy simplest example G is given Route 1 unit from A to B, through AB,AXB OPT– route ½ on AB and.
Last time: terminology reminder w Simple graph Vertex = node Edge Degree Weight Neighbours Complete Dual Bipartite Planar Cycle Tree Path Circuit Components.
The Clique Game Vít Jelínek, Jan Kára, Robert Šámal Mentor: Dr. József Beck.
CSE115/ENGR160 Discrete Mathematics 02/07/12
The Game of Nim on Graphs: NimG By Gwendolyn Stockman With: Alan Frieze, and Juan Vera.
Hex A game of connections. The Beginning Invented independently by Piet Hein in 1942 and John Nash in Invented independently by Piet Hein in 1942.
Graph Colouring Lecture 20: Nov 25.
Backtracking. Introduction Systematic way to do an exhaustive search Take advantage of pruning when possible.
Graphs, relations and matrices
Great Theoretical Ideas in Computer Science.
Great Theoretical Ideas in Computer Science.
Bell Work. Have you ever watched someone win a game again and again? Do you think that person just has good luck? In many cases, winners have strategies.
Indian Institute of Technology Hyderabad SOS - The Game A Project by Paritosh J Chandran Prakhar Bharadwaj Ganesh Mahidhar Nagarjun Srinivasan.
Game Playing. Introduction Why is game playing so interesting from an AI point of view? –Game Playing is harder then common searching The search space.
Game Playing.
Investigating Relationships between Variables: Interpreting Scatterplots.
Brute Force Average of 88 checks Worst possible algorithm if there is a ship in the bottom right cell Best search: 25.
On-line list colouring of graphs Xuding Zhu Zhejiang Normal University.
Investigation #1 (cont.)
Part II - Sums of Games Consider a game called Boxing Match which was defined in a programming contest m.short.html.
Agents that can play multi-player games. Recall: Single-player, fully-observable, deterministic game agents An agent that plays Peg Solitaire involves.
Section 1.8. Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Nonexistence Proofs Uniqueness Proofs.
Discrete Structures Lecture 12: Trees Ji Yanyan United International College Thanks to Professor Michael Hvidsten.
A Classic Game of Strategy for the 21 st Century.
Investigation #1 (cont.) Products and Multiples. 1.3 The Product Game.
The length of vertex pursuit games Anthony Bonato Ryerson University CCC 2013.
Graph Colouring Lecture 20: Nov 25. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including.
CSE 321 Discrete Structures Winter 2008 Lecture 5 Rules of Inference.
12/23/ : Slopes of Lines 1 Expectation: You will calculate slopes of lines parallel and perpendicular to given lines.
Game tree search Thanks to Andrew Moore and Faheim Bacchus for slides!
Year 9 Proof Dr J Frost Last modified: 19 th February 2015 Objectives: Understand what is meant by a proof, and examples.
Introduction to State Space Search
CompSci Backtracking, Search, Heuristics l Many problems require an approach similar to solving a maze ä Certain mazes can be solved using the.
CS Lecture 26 Monochrome Despite Himself. Pigeonhole Principle: If we put n+1 pigeons into n holes, some hole must receive at least 2 pigeons.
CPS Backtracking, Search, Heuristics l Many problems require an approach similar to solving a maze ä Certain mazes can be solved using the “right-hand”
Distance magic and group distance magic graphs Report on work in progress (and a few dead ends) Dalibor Froncek University of Minnesota Duluth.
2-dimensional Arrays A 2-dimensional array has rows and columns It is actually an “array of arrays” A Tic-Tac-Toe board is an example of a 3 by 3 2-d array.
An AI Game Project. Background Fivel is a unique hybrid of a NxM game and a sliding puzzle. The goals in making this project were: Create an original.
Eternal Domination Chip Klostermeyer.
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.
CHESS “The Ultimate GAME of Challenge and Strategy”
On-line list colouring of graphs
CSE15 Discrete Mathematics 02/08/17
Lecture 22 Complexity and Reductions
Algorithms and Networks
6-2B Proving Quadrilaterals Are Parallelograms
Positional Games and Randomness
C nnect 4 Group 9-18 See Zhuo Rui Jorelle 3S3 (Leader)
Lecture 13 CSE 331 Oct 1, 2012.
Memoryless Determinacy of Parity Games
Graph Theory What is a graph?.
Lecture 12 CSE 331 Sep 26, 2011.
Roy Oursler and Jason Williford
Graph lines given their equation. Write equations of lines.
CSE 321 Discrete Structures
Jeopardy.
Unit II Game Playing.
Presentation transcript:

The Chooser-Picker 7-in-a-row game András Csernenszky July Szeged

Hypergraph games (an example) The vertices of the graphs are the fields of an infinite graph paper. The winning sets are the horizontal, vertical or diagonal consecutive cells of length 5. If one of the player (because of the strategy stealing argument [J.Nash], this is the first player) gets a length 5 line, then he wins otherwise the game is draw. Given an F = (V, F) hypergraph and two players: the first player and the second player. The players alternate each other choosing one of the hypergraph’s edge. We call these games as hypergraph games.

Hypergraph games  If both player plays well then who wins that game?  Is it possible that no one wins?  What happens if we change the length of the winning sets?

Changing the rules: the „Weak” Games (Maker–Breaker games)  Maker (~first player) wins: if he/she occupies a winning set  Breaker (~second player) wins: if he/she prevents Maker’s win.  -There are only two possible outcomes of the game. Original game„Weak” game The first player (x) need to block the 2nd player offence. Twofold threat! -Maker (x) wins Theorem: If Breaker wins the „weak” game, then the original game is draw. ~Breaker has weaker chance to win than the second player in the original game.

Changing the rules: the Chooser-Picker games   Picker picks two vertices, and Chooser chooses one of them, the other one remains to Picker.   Chooser wins by getting a full winning set, and Picker wins if he prevents this (as the in Maker-Braker games).   If there is odd number of vertexes, then the last one goes to Chooser by definition. „Weak” game:Chooser-Picker game Maker wins!Chooser wins! Beck’s conjecture: If Breaker wins the Maker-Breaker game, then also Picker (as a second player) wins the Chooser- Picker game. ~These games are close to each other. If we believe that Breaker wins the game, then the Chooser-Picker version can be analyzed (and also Picker win expected)

Using Chooser-Picker games (an example: 4x4 Tic-Tac-Toe) We think that this game is draw. If we could prove that Breaker wins the weak version of this game then we are ready. We can check quickly whether the Chooser-Picker version of this game is a Picker win? And now we should start the more time-consuming proof; that Breaker also wins that game… The size of the game tree is the same, but if we know a winning strategy for Picker we can prove is somewhat easier.

About the k-in-a-row games   The first player wins for k = 5 on the 19×19 or even in the 15 × 15 board [Allis]   The first player wins if k =9 [Shannon and Pollak]   k=8 is also a draw [T. G. L. Zetters] OPEN questions: k=5 on infinite board? k=6, 7?

k=7  The original game is believed to be a draw.  It would be stronger to prove that the weak version is a Breaker win.  At first we examine the Chooser-Picker version of this game.

The Chooser-Picker 7-in-a-row-game: An auxiliary game   We consider a tiling of the plane, and play an auxiliary-game on each tile (sub-hypergraph).   It is easy to see, if Picker wins all of these sub- games, then Picker wins the game played on any K board which is the union of disjoint tiles.

The Chooser-Picker 7-in-a-row-game: Tricks-1   If Picker wins the Chooser-Picker game on (V,F), then Picker also wins it on (V \ X,F(X))

The Chooser-Picker 7-in-a-row-game: Tricks-2   If in the course of the game (or just already at the beginning) there is a two element winning set {x, y} then Picker has an optimal strategy starting with {x, y}

The Chooser-Picker 7-in-a-row-game: Tricks-3   It helps Chooser’s game if we change one of Picker’s square to a free square, and it is also advantageous for Chooser if he/she gets one of the free squares (P « FREE«C).

Playing on the 4x8 board…

Results:  Picker wins the Chooser-Picker 7-in-a-row (case study on the 4x8 auxiliary board, few pages).  It is an additional information for the original 7-in-a-row game.  We checked M-B game on the same auxiliary board, but it is a Maker win! (brute force computer search)  We should find other auxiliary games (and check the C-P version at first).

Thank you for your attention!