Recent results and questions in combinatorial game complexities (Q1583532): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q126323969, #quickstatements; #temporary_batch_1717956618549 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q126323969 / rank | |||
Normal rank |
Latest revision as of 19:12, 9 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Recent results and questions in combinatorial game complexities |
scientific article |
Statements
Recent results and questions in combinatorial game complexities (English)
0 references
26 October 2000
0 references
This paper is a survey article. First, a polynomial strategy for impartial acyclic games is presented. Here, the Beat Dong game, the game involving stars and buttoms, the octal games, the poset games and the Wythoff game are discussed. In the subsequent sections, the author treats cyclic games, annihilation games and partizan games. In the discussion upon partizan games the use of the simplicity theorem is mentioned.
0 references
combinatorial games
0 references
complexity
0 references
efficiency
0 references
tractability
0 references