Remarks on strategies in combinatorial games
type: Item
instance of: scholarly article
title: Remarks on strategies in combinatorial games
zbMATH Open document ID: 0601.90150
DOI: 10.1016/0166-218X(85)90070-8
author: J. Úlehla
author: A. Pultr
published in: Discrete Applied Mathematics
publication date: 1985-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 91A99
Mathematics Subject Classification ID: 03E20
Mathematics Subject Classification ID: 03E25
Mathematics Subject Classification ID: 91A05
zbMATH DE Number: 3970567
zbMATH Keywords: persistent strategy
zbMATH Keywords: weakly winning
zbMATH Keywords: existence proofs
zbMATH Keywords: combinatorial games as a relation
zbMATH Keywords: loss-preventing strategy
zbMATH Keywords: winning strategy
zbMATH Keywords: axiom of choice
zbMATH Keywords: preference function in a minimax form
MaRDI profile type: Publication
cites work: Sur une théorie ensembliste des jeux alternatifs
cites work: Q3944542
cites work: Q4099541
cites work: From Nim to Go
cites work: Graphs and composite games
full work available at URL: 0166-218x(85)90070-8
OpenAlex ID: W1974154300
description: scientific article; zbMATH DE number 3970567