Geometry-aware MCTS with incremental constraint updates and symmetry pruning yields new best-known configurations for five of six tested combinatorial geometry problems, including ~1.8n points for Max-N3IL on grids 82-119.
Progress in the No-Three-in-Line Problem, II
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Derives exact values and asymptotic bounds on the maximum and minimum densities of k-in-a-row avoiding configurations on Z^2 and [k]^d.
citing papers explorer
-
Geometry-Aware MCTS for Extremal Problems in Combinatorial Geometry
Geometry-aware MCTS with incremental constraint updates and symmetry pruning yields new best-known configurations for five of six tested combinatorial geometry problems, including ~1.8n points for Max-N3IL on grids 82-119.