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.
Result history
No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.
Correction history
No correction history
Technical details
Exact provenance
- Problem row
- sha256:4eb1f90d53626ab642aab46a8663560add7f0b21f72648964d7420a81f288ec8
- Metadata
- sha256:ef6bbaa137d12871fc5868945cf200bea564c0e52c4fdca6aa17a87176fe3c9b
- Observation
- sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
- Content
- sha256:eda4fef83e93891f304d1f684c46273456a163fa4b6586a3feafa40f13f6fe2a
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
- Source commit
- 2415f78e850aeee50afdca525c6f2e0ea606f207