8 Puzzle Problem Solver with A* Algorithm in Python

[Prathamesh-1011]

This issue is to extend the existing Python program for solving the 8 Puzzle Problem by implementing the A* algorithm. A* is a heuristic search algorithm that combines the actual cost to reach a node with an estimated cost to the goal, providing an efficient way to find the shortest path to the goal state. This addition will showcase the power of heuristic-based algorithms in solving complex AI problems more optimally compared to BFS and DFS.

Hello @Saloni6111, I am a Hactoberfest - 2024 contributer, I want to contribute the solution of the problem statement to this repository. Kindly assign this issue to me. Thank you! :)