The Fifteen Puzzle—A New Approach through Hybridizing Three Heuristics Methods

The Fifteen Puzzle problem is one of the most classical problems that has captivated mathematics enthusiasts for centuries. This mainly because huge size state space with approximately 1013 states have to be explored, and several algorithms been applied solve instances. In this paper, manage large space, bidirectional A* (BA*) search algorithm three heuristics, such as Manhattan distance (MD), linear conflict (LC), walking (WD), used problem. mentioned heuristics will hybridized in a way can dramatically reduce number generated by algorithm. Moreover, all these require only 25 KB storage, but help effectively expand fewer nodes. Our implementation BA* significantly complexity, guarantee either optimal or near-optimal solutions.