Panov, Stojanche and Koceski, Saso (2013) Solving Kakuro puzzle – comparison of deterministic approaches. In: XLVIII International scientific conference on information, communication and energy systems and technologies - ICEST, 26-29 June 2013, Ohrid, Macedonia.
Preview |
Text
icest_2013_Koceski_01.pdf Download (713kB) | Preview |
Abstract
This paper presents comparison of existing deterministic approaches to solving Kakuro puzzles and provides
a novel deterministic approach to obtaining an optimal solution for such puzzles, i.e. the Reducing Domain Values algorithm. This algorithm has been compared to other published deterministic approaches and proved to obtain better results in terms of time execution for obtaining an optimal solution. This provides a great foundation for development of effectual deterministic algorithms which would have great impact on solving coding theory problems.
| 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: | 23 Jan 2014 08:54 |
| Last Modified: | 23 Jan 2014 08:54 |
| URI: | https://eprints.ugd.edu.mk/id/eprint/8766 |
Actions (login required)
 |
View Item |