Harmony Search Algorithm with Two Problem-Specific Operators for Solving Nonogram Puzzle DOI Creative Commons
G.G. Lee, Zong Woo Geem

Mathematics, Journal Year: 2025, Volume and Issue: 13(9), P. 1470 - 1470

Published: April 29, 2025

The nonogram is a logic puzzle where each cell should be colored or left blank according to row and column clues reveal hidden picture. This known as an NP-complete combinatorial problem characterized by exponential increase in the number of candidate solutions with increasing size. So far, some methods have been investigated address these challenges, including conventional line-solving techniques, integer programming, neural networks. study introduces novel Harmony Search (HS)-based approach for solving puzzles, incorporating problem-specific operators designed effectively reduce solution search space accelerate convergence. Experimental results obtained from benchmark puzzles demonstrate that proposed HS model utilizing clue-constrained random-generation operator significantly reduces average iterations enhances solution-finding success rate. Additionally, integrating initially confirmed cell-scanning exhibited promising performance on specific problems. authors think can good quantum computing-based optimization future, algorithm also combined computing mechanisms.

Language: Английский

Long baseline underwater source localization based on deep K-Means++ clustering in complex underwater environments DOI
Yawen Dai, Lei Yang,

Yifei Cao

et al.

Digital Signal Processing, Journal Year: 2025, Volume and Issue: unknown, P. 105281 - 105281

Published: April 1, 2025

Language: Английский

Citations

0

Harmony Search Algorithm with Two Problem-Specific Operators for Solving Nonogram Puzzle DOI Creative Commons
G.G. Lee, Zong Woo Geem

Mathematics, Journal Year: 2025, Volume and Issue: 13(9), P. 1470 - 1470

Published: April 29, 2025

The nonogram is a logic puzzle where each cell should be colored or left blank according to row and column clues reveal hidden picture. This known as an NP-complete combinatorial problem characterized by exponential increase in the number of candidate solutions with increasing size. So far, some methods have been investigated address these challenges, including conventional line-solving techniques, integer programming, neural networks. study introduces novel Harmony Search (HS)-based approach for solving puzzles, incorporating problem-specific operators designed effectively reduce solution search space accelerate convergence. Experimental results obtained from benchmark puzzles demonstrate that proposed HS model utilizing clue-constrained random-generation operator significantly reduces average iterations enhances solution-finding success rate. Additionally, integrating initially confirmed cell-scanning exhibited promising performance on specific problems. authors think can good quantum computing-based optimization future, algorithm also combined computing mechanisms.

Language: Английский

Citations

0