Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Modified and introduced new algorithms for 8Puzzle problem #3

Open
wants to merge 3 commits into
base: master
Choose a base branch
from

Conversation

Priya-sopho
Copy link

  1. Modified bfs and dfs algorithm using open and close list to increase understand-ability of code.
  2. Implemented hill climbing (steepest) algorithm and best first search algorithm.
  3. Implemented correct algorithm for A* algorithm.
  4. Also utilized display_board() function to render the solution path.

implemented bfs,dfs,best_first,hill climbing and A* algorithm.
Also introduced display_board for solution path.
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.

1 participant