COMPARISON OF HEURISTIC SEARCH ALGORITHMS IN SOLVING 11-PUZZLE PROBLEMS
International Journal of Advanced Research · 28.02.2026 · 14 (02) · 741-750
DOI: 10.21474/ijar01/22785 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Advanced Research, online erschienen am 28.02.2026. Verfasst von W. M.A.C. Linara und 1 weiteren Autor:innen.
Abstract (Originalsprache)
This paper presents a comparative analysis of the A and Iterative Deepening A (IDA) search algorithms to solve the 11-puzzle problems using the Manhattan distance heuristic.Both algorithms were implemented and evaluated based on performance metrics including nodes generated, nodesexpanded, solution depth, effective branching factor, and CPU time. The results indicate that A consistently outperforms IDAin computational efficiency and scalability with A reducing the node generation by 62.86%, node expansion by 61.60%, and CPU time by 51.46%, though IDA* remains more memory efficient. These findings validate the broader applicability of heuristic search strategies and reinforce the role of the Manhattan distance heuristic in optimal path finding.
Zitieren
APA
Linara, W. M., & Gamini, D. D. (2026). COMPARISON OF HEURISTIC SEARCH ALGORITHMS IN SOLVING 11-PUZZLE PROBLEMS. International Journal of Advanced Research, 14(02), 741-750. https://doi.org/10.21474/ijar01/22785
Vancouver
Linara WM, Gamini DD. COMPARISON OF HEURISTIC SEARCH ALGORITHMS IN SOLVING 11-PUZZLE PROBLEMS. International Journal of Advanced Research. 2026;14(02):741-750. doi:10.21474/ijar01/22785
BibTeX
@article{Linara2026,
author = {Linara, W. M.A.C. and Gamini, D. D.A.},
title = {COMPARISON OF HEURISTIC SEARCH ALGORITHMS IN SOLVING 11-PUZZLE PROBLEMS},
journal = {International Journal of Advanced Research},
year = {2026},
volume = {14},
number = {02},
pages = {741--750},
doi = {10.21474/ijar01/22785}
}
EUVIMED