Transitive avoidance games (Q521391): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Games of No Chance 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2703803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersecting families of finite sets and fixed-point-free 2-elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: A density version of the Hales-Jewett theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achievement and avoidance games designed from theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoider-enforcer: the rules of the game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoider-Enforcer games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3255779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homogeneous Games. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matching game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Ramsey games / rank
 
Normal rank

Latest revision as of 16:34, 13 July 2024

scientific article
Language Label Description Also known as
English
Transitive avoidance games
scientific article

    Statements

    Transitive avoidance games (English)
    0 references
    0 references
    0 references
    0 references
    10 April 2017
    0 references
    Summary: Positional games are a well-studied class of combinatorial games. 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ère) form, the first person to occupy such a set \textit{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.
    0 references
    combinatorial games
    0 references
    avoidance games
    0 references

    Identifiers