Erdős problem 872
Each move claims exactly one pool element, so the minimax value never exceeds the number of already claimed elements plus the number of still unclaimed elements.
- Formal statements
- 3 open · 2 api · 1 textbook
- Erdős Problems says
- open
- Decision here
- No current contribution
- Checks
- 0 checks · 6 formal
Current Result
Current Result
No result has been accepted here yet.
- Type
- —
- Evidence
- 0 artifacts
- Decision
- None
- Reviewed
- No date retained