To implement Depth-First Search (DFS), Uniform-Cost Search (UCS), Best-First Search (BFS), and A* Algorithm to solve the following problems (i.e. find the goal): 1) 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 765 The program is to change the initial configuration into the goal configuration. A solution to the problem is an appropriate sequence of moves. 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 DFS BFS UCS A* Heuristics used in UCS Average number of nodes Average Run time Your comment on these visited (you need repeat each (Actual run time in algorithms algorithm several times with your program) different initial configuration)

Np Ms Office 365/Excel 2016 I Ntermed
1st Edition
ISBN:9781337508841
Author:Carey
Publisher:Carey
Chapter6: Managing Multiple Worksheets And Workbooks
Section: Chapter Questions
Problem 2.10CP
icon
Related questions
Question

Code this in python. This is a Artificial Intelligence Project. Project Instructions are in the attached file. 

After your finished coding and following  the project instructions, include the following information in text (or you can just type it in "Step 3" :

For Each algorithm (DFS ,  BFS,  UCS,  A*,  HEURISTICS USED IN UCS,  HEURISTICS USED IN A*) :

  • Find the average number of nodes visited (you need repeat each algorithm several times with different initial configuration)
  • Find the average Run time (actual run-time in your program)
  • Include a comment on the algorithms

 

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
DFS
BFS
UCS
A*
Heuristics used
in UCS
Heuristics used
in A*
Average number of nodes
visited (you need repeat each
algorithm several times with your program)
different initial configuration)
Average Run time Your comment on these
(Actual run time in algorithms
Transcribed Image Text: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 DFS BFS UCS A* Heuristics used in UCS Heuristics used in A* Average number of nodes visited (you need repeat each algorithm several times with your program) different initial configuration) Average Run time Your comment on these (Actual run time in algorithms
To implement Depth-First Search (DFS), Uniform-Cost Search (UCS), Best-First Search
(BFS), and A* Algorithm to solve the following problems (i.e. find the goal):
1) 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. 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
DFS
BFS
UCS
A*
Heuristics used
in UCS
Honviction cod
Average number of nodes
visited (you need repeat each
algorithm several times with your program)
different initial configuration)
Average Run time Your comment on these
(Actual run time in algorithms
Transcribed Image Text:To implement Depth-First Search (DFS), Uniform-Cost Search (UCS), Best-First Search (BFS), and A* Algorithm to solve the following problems (i.e. find the goal): 1) 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. 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 DFS BFS UCS A* Heuristics used in UCS Honviction cod Average number of nodes visited (you need repeat each algorithm several times with your program) different initial configuration) Average Run time Your comment on these (Actual run time in algorithms
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps

Blurred answer
Knowledge Booster
Mergesort
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Np Ms Office 365/Excel 2016 I Ntermed
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:
9781337508841
Author:
Carey
Publisher:
Cengage
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
Computer Science
ISBN:
9780357392676
Author:
FREUND, Steven
Publisher:
CENGAGE L
CMPTR
CMPTR
Computer Science
ISBN:
9781337681872
Author:
PINARD
Publisher:
Cengage