Preprint
Sep 2026
Three-Color Free-Flood-It on Fixed-Height Grids Is Polynomial-Time Solvable
A family of three-row boards shows that the unbounded ancestor chains handled by the algorithm are necessary even for optimal paintings, and a deterministic EPTAS and a randomized sampling variant with an explicit failure-probability bound are given.
Yuxuan Zhou
· 0 citations