Transitive avoidance games

zbMATH Open1409.91060arXiv1607.02945MaRDI QIDQ521391FDOQ521391

Authors: J. Robert Johnson, Imre Leader, Mark Walters 

Publication date: 10 April 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: Positional games are a well-studied class of combinatorial game. In their usual form, two players take turns to play moves in a set (`the board'), and certain subsets are designated as `winning': the first person to occupy such a set wins the game. For these games, it is well known that (with correct play) the game cannot be a second-player win. In the avoidance (or mis`{e}re) form, the first person to occupy such a set emph{loses} the game. Here it would be natural to expect that the game cannot be a first-player win, at least if the game is transitive, meaning that all points of the board look the same. Our main result is that, contrary to this expectation, there are transitive games that are first-player wins, for all board sizes which are not prime or a power of 2. Further, we show that such games can have additional properties such as stronger transitivity conditions, fast winning times, and `small' winning sets.

Full work available at URL: https://arxiv.org/abs/1607.02945

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Transitive avoidance games on boards of odd size
• scientific article; zbMATH DE number 1735736
• Fast winning strategies in positional games
• Fast winning strategies in avoider-enforcer games
• Avoidance game on Steiner triple systems

zbMATH Keywords

combinatorial gamesavoidance games

Mathematics Subject Classification ID

Positional games (pursuit and evasion, etc.) (91A24) Combinatorial games (91A46)

Cites Work

• Winning ways for your mathematical plays. Vol. 1.
• Avoider-Enforcer games
• Combinatorial Games
• Avoider-enforcer: the rules of the game
• Intersecting families of finite sets and fixed-point-free 2-elements
• A density version of the Hales-Jewett theorem
• A matching game
• Ramsey games
• Title not available (Why is that?)
• Homogeneous Games. II
• Games of no chance 3. Papers from the workshop on combinatorial game theory, Banff, Canada, June 2005
• Achievement and avoidance games designed from theorems
• Graph Ramsey games

Cited In (3)

• On strong avoiding games
• Transitive avoidance games on boards of odd size
• Avoidance game on Steiner triple systems

This page was built for publication: Transitive avoidance games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q521391)