Evolutionary Intelligence

, 2:169

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

  • E. G. Ortiz-García
  • S. Salcedo-Sanz
  • Á. M. Pérez-Bellido
  • L. Carro-Calvo
  • A. Portilla-Figueras
  • X. Yao
Special Issue

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.

Keywords

Grid-based puzzles Evolutionary algorithms A-priori probabilities of bits Japanese puzzles Light-up puzzles 

References

  1. 1.
    Khoo A, Zubek R (2002) Applying inexpensive AI techniques to computer games. IEEE Intell Syst 17(4):48–53CrossRefGoogle Scholar
  2. 2.
    Lucas SS, Kendall G (2006) Evolutionary computation and games. IEEE Comput Intell Mag 1(1):10–18CrossRefGoogle Scholar
  3. 3.
    Kendall G, Parkes A, Spoerer K (2008) A Survey of NP-Complete Puzzles. Int Comput Games Assoc J 31(1):13–34Google Scholar
  4. 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–369CrossRefGoogle Scholar
  5. 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–250Google Scholar
  6. 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–6Google Scholar
  7. 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–155CrossRefGoogle Scholar
  8. 8.
    Conceptis Puzzles Inc (2009) http://www.conceptispuzzles.com
  9. 9.
    Ueda N, Nagao T (1996) NP-completeness results for nonograms via parsimonious reductions. Internal Report, University of Tokyo, Computer Science DepartmentGoogle Scholar
  10. 10.
    Benton J, Snow R, Wallach N (2006) A combinatorial problem associated with nonograms. Linear Algebra Appl 412(1):30–38MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
  12. 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–1407Google Scholar
  13. 13.
  14. 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. 15.
    Duncan G (1999) Puzzle solving. B.Sc. degree final project Report, University of York, Computer Science DepartmentGoogle Scholar
  16. 16.
  17. 17.
    Batenburg KJ, Kosters WA (2009) Solving nonograms by combining relaxations. Pattern Recognition (in press)Google Scholar
  18. 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), AprilGoogle Scholar
  19. 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–760CrossRefGoogle Scholar
  20. 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–1068Google Scholar
  21. 21.
    Hopfield JJ (1982) Neurons and physical systems with emergent collective computational abilities. Proc Natl Acad Sci USA 79:2554–2558CrossRefMathSciNetGoogle Scholar
  22. 22.
    Shrivastava Y, Dasgupta S, Reddy SM (1992) Guaranteed convergence in a class of Hopfield networks. IEEE Trans Neural Netw 3:951–961CrossRefGoogle Scholar
  23. 23.
    Light-up puzzle page (2009) http://www.puzzle-Light-up.com/

Copyright information

© Springer-Verlag 2009

Authors and Affiliations

  • E. G. Ortiz-García
    • 1
  • S. Salcedo-Sanz
    • 1
  • Á. M. Pérez-Bellido
    • 1
  • L. Carro-Calvo
    • 1
  • A. Portilla-Figueras
    • 1
  • X. Yao
    • 2
    • 3
  1. 1.Department of Signal Theory and CommunicationsUniversidad de Alcalá, Escuela Politécnica SuperiorMadridSpain
  2. 2.The Centre for Research in Computational Intelligence and Applications (CERCIA), School of Computer ScienceThe University of BirminghamBirminghamUK
  3. 3.Nature Inspired Computation and Applications Laboratory (NICAL)University of Science and Technology of ChinaHefeiPeople’s Republic of China

Personalised recommendations