Winning strong games through fast strategies for weak games (Q553998)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Winning strong games through fast strategies for weak games |
scientific article |
Statements
Winning strong games through fast strategies for weak games (English)
0 references
29 July 2011
0 references
Summary: We prove that, for sufficiently large n, the first player can win the strong perfect matching and Hamilton cycle games. For both games, explicit winning strategies of the first player are given. In devising these strategies we make use of the fact that explicit fast winning strategies are known for the corresponding weak games.
0 references
