Abstract A Constraint-based Approach to Enigma 1225

This paper presents a constraint programming approach to the Enigma 1225, a mathematical puzzle published in the New Scientist magazine in February 2003. An approach based on Prolog was published recently. In this paper we give a constraint programming perspective on the problem, highlighting the differences between the two methodologies. We show how problem-specific knowledge can be easily incorporated into a constraint-based approach, giving an efficient constraint model for the generalized version of the puzzle. From the constraint programming point of view, the Enigma 1225 puzzle exhibits interesting symmetries, that can be eliminated using only a small number of constraints added to the model. Furthermore, we show how properties of the puzzle can be used to derive a strong constraint propagation scheme that limits the search once an optimal solution has been found