Deterministic and metaheuristic approaches to solving Kakuro puzzles

Panov, Stojanche and Koceski, Saso (2013) Deterministic and metaheuristic approaches to solving Kakuro puzzles. In: 2nd Mediterranean Conference on Embedded Computing (MECO), 15-20 June 2013, Budva, Monte Negro.

Full text not available from this repository.
Official URL: http://dx.doi.org/10.1109/MECO.2013.6601364

Abstract

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.

Item Type: Conference or Workshop Item (Paper)
Subjects: Natural sciences > Computer and information sciences
Divisions: Faculty of Computer Science
Depositing User: Saso Koceski
Date Deposited: 22 Jan 2014 12:53
Last Modified: 22 Jan 2014 12:53
URI: http://eprints.ugd.edu.mk/id/eprint/8760

Actions (login required)

View Item View Item