Skip to content

Conversation

ayushh0406
Copy link
Contributor

This code defines a PuzzleState class to represent each state of the puzzle. It uses the A* search algorithm to find the shortest path from the initial state to the goal state. The Manhattan distance heuristic is used to guide the search. The solve_puzzle function returns the solution state, and the print_solution function prints the sequence of moves to solve the puzzle.

This code defines a PuzzleState class to represent each state of the puzzle. It uses the A* search algorithm to find the shortest path from the initial state to the goal state. The Manhattan distance heuristic is used to guide the search. The solve_puzzle function returns the solution state, and the print_solution function prints the sequence of moves to solve the puzzle.
@ayushh0406
Copy link
Contributor Author

Implement Eight Puzzle Solver using A Algorithm with Manhattan Heuristic

@geekcomputers geekcomputers merged commit 62df638 into geekcomputers:master Feb 16, 2025
1 check failed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants