Abstract
This paper presents two heuristics algorithms to solve Japanese puzzles, both black and white puzzles and color puzzles. First, we present ad-hoc heuristics which use the information In rows, columns, and puzzle's constraints to obtain the solution of the puzzle. The best heuristic developed for black and white puzzles is then extended to solving color Japanese puzzles. We show the performance of the proposed heuristics In several examples from a well known web page devoted to this kind of puzzles. Comparison with an existing solver based on constraint programming and with a genetic algorithm is carried out. © 2007 IEEE.
Original language | English |
---|---|
Title of host publication | Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Games, CIG 2007 |
Pages | 224-231 |
Number of pages | 8 |
DOIs | |
Publication status | Published - Apr 2007 |
Externally published | Yes |
Keywords
- Heuristics
- Japanese puzzles
- Nonograms
- Puzzles solver