Timeline for In two-player games with perfect information, if both players play optimally, will the game always end in a draw?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 21, 2020 at 6:15 | comment | added | Cohensius | @IlmariKaronen, right, this non-constructive proof of the winning player is called Ultra-weak solution. It makes very elegant solutions. | |
| Apr 21, 2020 at 6:08 | history | edited | Cohensius | CC BY-SA 4.0 |
edited body
|
| Sep 24, 2019 at 17:58 | comment | added | Ilmari Karonen | On a bit of a tangent, for some games it's possible to prove which of these possibilities is true without knowing the optimal strategy needed to achieve it. For example, if the first player can (effectively) skip their first turn (and if the rules of the game are symmetric for both players) then the second player cannot possibly have a guaranteed winning strategy — if they did, the first player could skip and then use the same strategy to win instead. This is an example of a strategy-stealing argument. | |
| Sep 23, 2019 at 17:06 | vote | accept | Someone | ||
| Sep 23, 2019 at 10:05 | history | edited | Cohensius | CC BY-SA 4.0 |
added 93 characters in body
|
| Sep 21, 2019 at 20:21 | history | edited | Cohensius | CC BY-SA 4.0 |
added 216 characters in body
|
| Sep 21, 2019 at 20:06 | history | answered | Cohensius | CC BY-SA 4.0 |