Theoremadvanced
Strategy-stealing argument
Also called strategy stealing.
Non-constructive proof that the second player cannot have a winning strategy in games like Hex or tic-tac-toe with extra moves allowed.
Non-constructive proof that the second player cannot have a winning strategy in games like Hex or tic-tac-toe with extra moves allowed.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag G3BS01 Edit this page History Report an error