Remarks on strategies in combinatorial games (Q1081541)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Remarks on strategies in combinatorial games
scientific article

    Statements

    Remarks on strategies in combinatorial games (English)
    0 references
    0 references
    0 references
    1985
    0 references
    Viewing strategies in combinatorial games as a relation \(S\subset X\times X\) where X is the set of states (instead of a mapping \(S: X\to X)\) the authors give: 1) a very short proof of the existence of a loss-preventing strategy, 2) a proof of the existence of a winning strategy without the axiom of choice, and 3) a proof of the theorem on the value of a game with a preference function in a minimax form.
    0 references
    persistent strategy
    0 references
    weakly winning
    0 references
    existence proofs
    0 references
    combinatorial games as a relation
    0 references
    loss-preventing strategy
    0 references
    winning strategy
    0 references
    axiom of choice
    0 references
    preference function in a minimax form
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references