Skip to main content

Solving Very Difficult Japanese Puzzles with a Hybrid Evolutionary-Logic Algorithm

  • Conference paper
Simulated Evolution and Learning (SEAL 2008)

Abstract

In this paper we present a hybrid evolutionary algorithm to solve a popular logic-type puzzle, the so called Japanese puzzle. We propose to use the evolutionary algorithm in order to initialize a logic ad-hoc algorithm, which works as a local search and implicitly defines the fitness function of the problem. Two novel operators, one for initializing the evolutionary algorithm and a second one providing a novel type of mutation adapted to Japanese puzzles are described in the paper.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Conceptis Puzzles Inc., http://www.conceptispuzzles.com

  2. Benchmark Puzzles, http://homepages.cwi.nl/~aeb/games/jpuzzlegraded/index.html

  3. Dorant, M.: A begginer’s guide to solving picture forming logic puzzles, http://www.conceptispuzzles.com/index.aspx?uri=info/article/79

  4. Ueda, N., Nagao, T.: NP-completeness results for nonograms via parsimonious reductions. Internal Report, University of Tokyo, Computer Science Department (1996)

    Google Scholar 

  5. Benton, J., Snow, R., Wallach, N.: A combinatorial problem associated with nonograms. Linear Algebra and its Applications 412(1), 30–38 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Salcedo-Sanz, S., Ortiz-García, E., PérezBellido, A., Portilla-Figueras, J., Yao, X.: Solving Japanese Puzzles with Heuristics. In: IEEE Symposium on Computational Intelligence and Games, Honolulu, USA (April 2007)

    Google Scholar 

  7. Ortiz-García, E., Salcedo-Sanz, S., Leiva-Murillo, J.M., PérezBellido, A., Portilla-Figueras, J.: Automated generation and visualization of picture-logic puzzles. Computers & Graphics 31, 750–760 (2007)

    Article  Google Scholar 

  8. Batenburg, B., Kosters, W.: A discrete tomography approach to Japanese puzzles. In: Proceedings of the Belgian-Dutch Conference on Artificial Intelligence, pp. 243–250 (2004)

    Google Scholar 

  9. Wiggers, W.: A comparison of a genetic algorithm and a depth first search algorithm applied to Japanese nonograms. In: Proceedings of the 1st Twente Student Conference on IT, pp. 1–6 (2004)

    Google Scholar 

  10. Salcedo-Sanz, S., Portilla-Figueras, J., PérezBellido, A., Ortiz-García, E., Yao, X.: Teaching advanced features of evolutionary algorithms using Japanese puzzles. IEEE Transactions on Education 50(2), 151–155 (2007)

    Article  Google Scholar 

  11. Duncan, G.: Puzzle Soving. B.Sc. Degree Final Project Report, University of York, Computer Science Department (1999)

    Google Scholar 

  12. Simpson, S.: http://www.comp.lancs.ac.uk\computing\users\ss\nonogram\index.html

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ortiz-García, E.G., Salcedo-Sanz, S., Pérez-Bellido, Á.M., Portilla-Figueras, A., Yao, X. (2008). Solving Very Difficult Japanese Puzzles with a Hybrid Evolutionary-Logic Algorithm. In: Li, X., et al. Simulated Evolution and Learning. SEAL 2008. Lecture Notes in Computer Science, vol 5361. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89694-4_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89694-4_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89693-7

  • Online ISBN: 978-3-540-89694-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics