Consider a 2D 25room vacuumcleaner world as follows:
Over a lifetime of 10 time steps. Higher performance points are better.
(1,1) 
(1,2) 
(1,3) 
(1,4) 
(1,5) 
(2,1) 
(2,2) 
… 


(3,1) 
… 



(4,1) 




(5,1) 



(5,5) 
In this programming assignment, you should implement the following 4 algorithms to solve the 2D 25room vacuumcleaner world problem:
Follow the TreeSearch and GraphSearch pseudocode in the lecture slides (copied below), but removing the GoalTest. You need to search the whole tree and return the best solution found. Breaking ties of search nodes randomly.
function TreeSearch(problem, fringe) returns a solution, or failure fringe = Insert(MakeNode(InitialState[problem]), fringe) loop do
if fringe is empty then return failure
node = RemoveFront(fringe)
if GoalTest(problem,State(node)) then return node fringe = InsertAll(Expand(node, problem), fringe)
end
function GraphSearch(problem, fringe) returns a solution, or failure closed = an empty set
fringe = Insert(MakeNode(InitialState[problem]), fringe) loop do
if fringe is empty then return failure node = RemoveFront(fringe)
if GoalTest(problem,State[node]) then return node if State[node] is not in closed then
add State[node] to closed
fringe = InsertAll(Expand(node, problem), fringe)
end
DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma
Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t
Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th
1 Project 1 Introduction  the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of
1 Project 2 Introduction  the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of