About this document
Comparison of Heuristic Search Algorithms in Solving 11-Puzzle Problems by pirzahoor is a document available to read on EtoBox.
This research article compares the A* and Iterative Deepening A* (IDA*) search algorithms in solving the 11-puzzle problem using the Manhattan distance heuristic. The findings indicate that A* outperforms IDA* in terms of computational efficiency, generating 62.86% fewer nodes and reducing CPU time by 51.46%, while IDA* remains more memory efficient. This study highlights the applicability of heuristic search strategies and the effectiveness of the Manhattan distance heuristic in mid-complexity puzzle probl
- Author
- pirzahoor
- Language
- EN