Solving Japanese puzzles with heuristics

Sancho SALCEDO-SANZ, Emilio G. ORTÍZ-GARCÍA, Angel M. PÉREZ-BELLIDO, Antonio PORTILLA-FIGUERAS, Xin YAO

Research output: Book Chapters | Papers in Conference ProceedingsConference paper (refereed)Researchpeer-review

10 Citations (Scopus)

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 languageEnglish
Title of host publicationProceedings of the 2007 IEEE Symposium on Computational Intelligence and Games, CIG 2007
Pages224-231
Number of pages8
DOIs
Publication statusPublished - Apr 2007
Externally publishedYes

Keywords

  • Heuristics
  • Japanese puzzles
  • Nonograms
  • Puzzles solver

Fingerprint

Dive into the research topics of 'Solving Japanese puzzles with heuristics'. Together they form a unique fingerprint.

Cite this