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 ofplagiarism.Your program should be able to address any initial configuration and provide a table of statisticsbelow in your PDF file.AlgorithmDFSBFSUCSA*Heuristics usedin UCSHeuristics usedin A*Average number of nodesvisited (you need repeat eachalgorithm 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 isalways empty thus making it possible to move an adjacent numbered tile into the empty cell. Startwith a random state (cannot be fixed). The goal state is listed below.1 2 3847 6 5The program is to change the initial configuration into the goal configuration. A solution to theproblem is an appropriate sequence of moves. You must write your own codes for thealgorithms. Make sure your submission meets all of the requirements and free ofplagiarism.Your program should be able to address any initial configuration and provide a table of statisticsbelow in your PDF file.AlgorithmDFSBFSUCSA*Heuristics usedin UCSHonviction codAverage number of nodesvisited (you need repeat eachalgorithm several times with your program)different initial configuration)Average Run time Your comment on these(Actual run time in algorithms

The 8-puzzle problem can be solved using various techniques such as breadth-first search,…

Answered: To implement Depth-First Search (DFS),…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

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

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

This is a popular solution!

Step by step

Solved in 4 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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