Gale's subset take-away conjecture
Let be a finite set. In subset take-away, two players alternately choose proper, non-empty subsets of , with no chosen set containing a set chosen earlier; a player unable to move loses. Gale's subset take-away conjecture. Subset take-away is always a second player win. This conjecture, attributed to David Gale, asserts that the second player has a winning strategy for every finite starting set. The paper verifies the claim for starting sets with fewer than six elements and presents it as open in general.
References
- J. Daniel Christensen and Mark Tilford, “David Gale's subset take-away game”, arXiv:math/0207185 (2016).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.