A* Search Optimization for the 8-Puzzle: Heuristic Function Analysis and Implementation
The 8-puzzle problem involves navigating a 3×3 grid containing eight numbered tiles and one empty cell from an initial configuration to a target arrangement. Valid transitions slide orthogonally adjacent tiles into the empty position. The A* algorithm efficiently solves this by combining uniform-cos...