TL;DR
This paper computationally analyzes all P-positions in 4xn Chomp for n ≤ 3000, revealing structural properties, bimodal decomposition, and asymptotic ratios, supported by an efficient O(n^4) algorithm.
Contribution
It introduces a new O(n^4) shadow-array sieve for complete tabulation and proves the Unique Extension property, along with detailed structural insights into P-positions.
Findings
Proved the Unique Extension property for all k-row Chomp.
Discovered a bimodal decomposition into HIGH and LOW families with stable densities.
Identified asymptotic ratios for the families, suggesting limits near 1/4 and 20/109.
Abstract
We present a complete computational tabulation of all 961,619,972 P-positions in 4xn Chomp for n <= 3000, obtained via a new O(n^4) shadow-array sieve that replaces the O(n^5) hash-set approach of prior work. Three structural results are reported. First, we prove the Unique Extension property: for any triple (a,b,c), there is at most one value of d such that (a,b,c,d) is a P-position. The proof is a short contradiction using the move structure of Chomp and generalizes immediately to all k-row Chomp. Second, the P-positions exhibit a persistent bimodal decomposition into two subfamilies, HIGH and LOW, separated by a clean gap in the per-a median of d/a that grows monotonically from 0.040 at n=500 to 0.062 at n=3000, with the HIGH subfamily maintaining a stable density of 56.2% throughout. The previously conjectured global limit d/a -> 2/9 is shown to be a mixture artifact. Third, within…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
