[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Improving the performance of evolutionary algorithms in grid-based puzzles resolution

  • Special Issue
  • Published:
Evolutionary Intelligence Aims and scope Submit manuscript

Abstract

This paper proposes several modifications to existing hybrid evolutionary algorithms in grid-based puzzles, using a-priori probabilities of 0/1 occurrence in binary encodings. This calculation of a-priori probabilities of bits is possible in grid-based problems (puzzles in this case) due to their special structure, with the solution confined into a grid. The work is focused in two different grid-based puzzles, the Japanese puzzles and the Light-up puzzle, each one having special characteristics in terms of constraints, which must be taken into account for the probabilities of bit calculation. For these puzzles, we show the process of a-priori probabilities calculation, and we modify the initialization of the EAs to improve their performance. We also include novel mutation operators based on a-priori probabilities, which makes more effective the evolutionary search of the algorithms in the tackled puzzles. The performance of the algorithms with these new initialization and novel mutation operators is compared with the performance without them. We show that the new initialization and operators based on a-priori probabilities of bits make the evolutionary search more effective and also improve the scalability of the algorithms.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Khoo A, Zubek R (2002) Applying inexpensive AI techniques to computer games. IEEE Intell Syst 17(4):48–53

    Article  Google Scholar 

  2. Lucas SS, Kendall G (2006) Evolutionary computation and games. IEEE Comput Intell Mag 1(1):10–18

    Article  Google Scholar 

  3. Kendall G, Parkes A, Spoerer K (2008) A Survey of NP-Complete Puzzles. Int Comput Games Assoc J 31(1):13–34

    Google Scholar 

  4. Ortiz-García E, Salcedo-Sanz S, Pérez-Bellido AM, Portilla-Figueras A, Yao X (2008) Solving very difficult Japanese puzzles with a hybrid evolutionary-logic algorithm. Lect Notes Comput Sci 5361:360–369

    Article  Google Scholar 

  5. Batenburg B, Kosters W (2004) A discrete tomography approach to Japanese puzzles. In: Proceedings of the Belgian-Dutch conference on artificial intelligence, pp 243–250

  6. Wiggers W (2004) 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

  7. Salcedo-Sanz S, Portilla-Figueras J, Pérez.Bellido A, Ortiz-García E, Yao X (2007) Teaching advanced features of evolutionary algorithms using Japanese puzzles. IEEE Trans Edu 50(2):151–155

    Article  Google Scholar 

  8. Conceptis Puzzles Inc (2009) http://www.conceptispuzzles.com

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

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

    Article  MATH  MathSciNet  Google Scholar 

  11. Nikoli puzzles (2009) http://www.nikoli.co.jp/en/puzzles/light_up/

  12. Ortiz-García EG, Salcedo-Sanz S, Pérez-Bellido ÁM, Portilla-Figueras A (2007) A Hybrid Hopfield Network-Genetic Algorithm Approach for the Light-up Puzzle. In: Proceedings of the IEEE conference on evolutionary computation, pp 1403–1407

  13. Benchmark puzzles (2009) http://www.homepages.cwi.nl/∼aeb/games/jpuzzlegraded/index.html

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

  15. Duncan G (1999) Puzzle solving. B.Sc. degree final project Report, University of York, Computer Science Department

  16. Simpson S (2006) http://www.comp.lancs.ac.uk/computing/users/ss/nonogram/index.html

  17. Batenburg KJ, Kosters WA (2009) Solving nonograms by combining relaxations. Pattern Recognition (in press)

  18. Salcedo-Sanz S, Ortiz-García E, Pérez.Bellido A, Portilla-Figueras J, Yao X (2007) Solving Japanese puzzles with heuristics. In: IEEE symposium on computational intelligence and games, Honolulu (USA), April

  19. Ortiz-García E, Salcedo-Sanz S, Leiva-Murillo JM, Pérez.Bellido A, Portilla-Figueras J (2007) Automated generation and visualization of picture-logic puzzles. Comput Graph 31:750–760

    Article  Google Scholar 

  20. Salcedo-Sanz S, Ortiz-García EG, Prez-Bellido AM, Portilla-Figueras JA (2008) Using a bank of binary Hopfield networks as constraints solver in hybrid algorithms. Neurocomputing 71:1061–1068

    Google Scholar 

  21. Hopfield JJ (1982) Neurons and physical systems with emergent collective computational abilities. Proc Natl Acad Sci USA 79:2554–2558

    Article  MathSciNet  Google Scholar 

  22. Shrivastava Y, Dasgupta S, Reddy SM (1992) Guaranteed convergence in a class of Hopfield networks. IEEE Trans Neural Netw 3:951–961

    Article  Google Scholar 

  23. Light-up puzzle page (2009) http://www.puzzle-Light-up.com/

Download references

Acknowledgments

This work has been partially supported by Universidad de Alcalá, Comunidad de Madrid and Ministerio de Educación of Spain under grants number CCG08-UAH/AMB-3993 and TEC2006-07010. E. G. Ortiz-García is supported by Universidad de Alcalá, under the University F.P.I. grants program. Á. M. Pérez-Bellido is supported with a doctoral fellowship by the European Social Fund and Junta de Comunidades de Castilla la Mancha, in the frame of the Operating Programme ESF 2007-2013.

Author information

Authors and Affiliations

  1. Department of Signal Theory and Communications, Universidad de Alcalá, Escuela Politécnica Superior, Alcalá de Henares, 28871, Madrid, Spain

    E. G. Ortiz-García, S. Salcedo-Sanz, Á. M. Pérez-Bellido, L. Carro-Calvo & A. Portilla-Figueras

  2. The Centre for Research in Computational Intelligence and Applications (CERCIA), School of Computer Science, The University of Birmingham, Birmingham, UK

    X. Yao

  3. Nature Inspired Computation and Applications Laboratory (NICAL), University of Science and Technology of China, Hefei, People’s Republic of China

    X. Yao

Authors
  1. E. G. Ortiz-García
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Salcedo-Sanz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Á. M. Pérez-Bellido
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. L. Carro-Calvo
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. A. Portilla-Figueras
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. X. Yao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. Salcedo-Sanz.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ortiz-García, E.G., Salcedo-Sanz, S., Pérez-Bellido, Á.M. et al. Improving the performance of evolutionary algorithms in grid-based puzzles resolution. Evol. Intel. 2, 169–181 (2009). https://doi.org/10.1007/s12065-009-0030-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12065-009-0030-3

Keywords

Search

Navigation