Deterministic and metaheuristic approaches to solving Kakuro puzzles

This research study introduces two new approaches to solving Kakuro puzzles. One of them is metaheuristic and is based on Harmony Search methodology, and the other one is a novel deterministic method named Reducing Domain Values. Both of them have been examined and tested with different puzzles having various grid sizes. They were also compared with two known techniques Forward Checking and Iterative Sampling. As results have shown, the newly introduced approaches gave better performances in terms of time and provided great foundation for developing game theory algorithms.