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

DOI10.1007/s12065-009-0030-3zbMath1217.68203OpenAlexW2077333370MaRDI QIDQ632246

L. Carro-Calvo, Sancho Salcedo-Sanz, Antonio Portilla-Figueras, Emilio G. Ortiz-García, Ángel M. Pérez-Bellido

Publication date: 15 March 2011

Published in: Evolutionary Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12065-009-0030-3

zbMATH Keywords

evolutionary algorithmsa-priori probabilities of bitsgrid-based puzzlesJapanese puzzleslight-up puzzles

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Recreational mathematics (00A08)

Related Items

Nonograms: combinatorial questions and algorithms

Cites Work

• Solving nonograms by combining relaxations
• A combinatorial problem associated with nonograms
• Neural networks and physical systems with emergent collective computational abilities.