The Fifteen Puzzle- A New Approach through Hybridizing Three Heuristics Methods
Not on the map. Why?
Abstract (arXiv)
Fifteen Puzzle problem is one of the most classical problems that have captivated mathematical enthusiasts for centuries. This is mainly because of the huge size of the state space with approximately 1013 states that have to be explored and several algorithms have been applied to solve the Fifteen Puzzle instances. In this paper, to deal with this large state space, Bidirectional A* (BA*) search algorithm with three heuristics, such as Manhattan distance (MD), linear conflict (LC), and walking distance (WD) has been used to solve the Fifteen Puzzle problems. The three mentioned heuristics will be hybridized in a way that can dramatically reduce the number of generated states by the algorithm. Moreover, all those heuristics require only 25KB of storage but help the algorithm effectively reduce the number of generated states and expand fewer nodes. Our implementation of BA* search can significantly reduce the space complexity, and guarantee either optimal or near-optimal solutions.1
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 6 of its 52 references that are in the map. First posted on arXiv 6 Jan 2023.
Builds on
6 of 52 references.
References · 6
- 2019Fitness Dependent Optimizer: Inspired by the Bee Swarming Reproductive Processcited by 6
- 2017A simple proof that the (n2-1)-puzzle is hardcited by 3
- 2021Exploiting Learned Policies in Focal Searchcited by 3
- 2019Effective problem solving using SAT solverscited by 2
- 2020A new evolutionary algorithm: Learner performance based behavior algorithmcited by 2
- 2021ANA: Ant Nesting Algorithm for Optimizing Real-World Problemscited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.