Solving E-Squaro through SAT-Coding
Éric Grégoire, Atef Hasni, Bertrand Mazure, Cédric Piette · 2013
In this paper, we show that the E-SquarO puzzle, which is an extension of the popular SquarO game, is NP-complete. We propose a SAT encoding of E-SquarO and investigate its practical computational properties.