To implement Breadth-First Search (BFS), Uniform-Cost Search (UCS), Best-First Search (BFS), and A* Algorithm to solve the following 8-puzzle problem (i.e. find the goal): 8-puzzle Problem: The 8-puzzle consists of eight numbered, movable tiles set in a 3x3 frame. One cell of the frame is always empty thus making it possible to move an adjacent numbered tile into the empty cell. Start with a random state (cannot be fixed). The goal state is listed below. 1 2 3 8 4 7 6 5 The program is to change the initial configuration into the goal configuration. A solution to the problem is an appropriate sequence of moves.
To implement Breadth-First Search (BFS), Uniform-Cost Search (UCS), Best-First Search (BFS), and A*
You must write your own codes for the algorithms. Make sure your submission meets all of the requirements and free of plagiarism. Your program should be able to address any initial configuration and provide a table of statistics below in your PDF file.
Algorithm Average number of nodes visited (you need repeat each algorithm several times with different initial configuration) Average run time in your program Your comment on these algorithms DFS UCS BFS A*
You may write your code in a contemporary language of your choice; typical languages would include C/C++, Python, Java, Ada, Pascal, Smalltalk, Lisp, and Prolog. A GUI interface is preferred.
Submit a PDF file of your well-commented source program, your design and your printed outputs (screen shots).
Please include your codes in your PDF file.
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
