Tag
This paper presents a Geometry-Aware Monte Carlo Tree Search framework for solving extremal combinatorial geometry problems on n×n grids, achieving new best-known results on five out of six tested problems, including improvements for the No-Three-in-Line problem.