Add Python Program to Solve 8 Puzzle Problem Using BFS and DFS

[Prathamesh-1011]

This issue is to develop a Python program that solves the 8 Puzzle Problem using both Breadth-First Search (BFS) and Depth-First Search (DFS) algorithms. The program will demonstrate the application of classic search algorithms in AI by solving this well-known problem, which is crucial for understanding computational problem-solving techniques. The solution should involve searching for the correct sequence of moves to reach the goal state from a given initial configuration.

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! :)