Solving Flood-It Puzzles: A Comparison of Tailored A* Search with Declarative Solver Approaches.

arXiv:2610.31100v1 Announce Type: new Abstract: We present an optimized approach for finding minimal move sequences to solve Flood-It puzzles using A* search and compare it with approaches using SAT, Integer Programming, and Constraint Programming solvers. The