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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3136272 (Why is no real title available?)
- A density version of the Hales-Jewett theorem
- A matching game
- Achievement and avoidance games designed from theorems
- Avoider-Enforcer games
- Avoider-enforcer: the rules of the game
- Combinatorial Games
- Games of no chance 3. Papers from the workshop on combinatorial game theory, Banff, Canada, June 2005
- Graph Ramsey games
- Homogeneous Games. II
- Intersecting families of finite sets and fixed-point-free 2-elements
- Ramsey games
- Winning ways for your mathematical plays. Vol. 1.
Cited in
(3)
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)
