The Structure of Pairing Strategies for k-in-a-row Type Games
| Autor: | Géza Makay, Lajos Győrffy, András London |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Structure (mathematical logic)
Discrete mathematics Class (set theory) Information Systems and Management Computer science 0102 computer and information sciences Management Science and Operations Research Characterization (mathematics) Type (model theory) 01 natural sciences Theoretical Computer Science Set (abstract data type) 010201 computation theory & mathematics Pairing Computer Science (miscellaneous) Graph (abstract data type) Order (group theory) Computer Vision and Pattern Recognition Electrical and Electronic Engineering Software |
| Zdroj: | Acta Cybernetica. 23:561-572 |
| ISSN: | 0324-721X |
| DOI: | 10.14232/actacyb.23.2.2017.8 |
| Popis: | In Maker-Breaker positional games two players, Maker and Breaker, play on a finite or infinite board with the goal of claiming or preventing the opponent from getting a finite winning set, respectively. For different games there are several winning strategies for Maker or Breaker. One class of winning strategies is the so-called pairing (paving) strategies. Here, we describe all possible pairing strategies for the 9-in-a-row game. Furthermore, we define a graph of the pairings, containing 194,543 vertices and 532,107 edges, in order to give them a structure. A complete characterization of the graph is also given. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|