Solving the Sliding Puzzle problem using the A* algorithm and comparing the effectiveness of different heuristic functions

Abstract

This paper aims to solve the Sliding Puzzle problem using the A* algorithm and compare the effectiveness of different heuristic evaluation functions. Multiple heuristic functions including Manhattan Distance and Linear Conflict will be investigated. This helps to determine the best heuristic function of the A* algorithm by considering efficiency and accuracy.