Three-move outcome segmentation conjecture
Let be a finite two-dimensional vector subtraction ruleset, and let denote its size. An outcome segmentation is a finite union of outcome segments, where each outcome segment is a geometric region with a distinct regular pattern of outcomes.
Three-move segmentation conjecture. If , there is an outcome segmentation.
The conjecture is motivated by computational experiments showing segmentation for many three-move rulesets. The source presents it among open problems and gives no proof or resolution status.
References
- Urban Larsson, Indrajit Saha and Makoto Yokoo, “Subtraction games in more than one dimension”, arXiv:2307.12458 (2024).
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.