Assingment 1_Artificial intelligence
Budget: $10 – $30 USD
Consider the state space graph shown above. A is the start state and G is the goal state. The
costs for each edge are shown on the graph. Each edge can be traversed in both directions.
Note that the heuristic h1 is consistent but the heuristic h2 is not consistent.
(a) Possible paths returned
For each of the following graph search strategies (If you're testing a node that is
already in the Expanded nodes list, ignore it to avoid repeated states.), For each of
the following search strategies, indicate the expanded nodes, the path solution and its
cost. When placing expanded child nodes on the fringe with same cost, assume that the
child nodes are placed in alphabetical order.
Search Algorithm Expanded nodes Path solution Cost
Depth first search
Breadth first search
Uniform cost search
A* search with heuristic h1
A* search with heuristic h2
costs for each edge are shown on the graph. Each edge can be traversed in both directions.
Note that the heuristic h1 is consistent but the heuristic h2 is not consistent.
(a) Possible paths returned
For each of the following graph search strategies (If you're testing a node that is
already in the Expanded nodes list, ignore it to avoid repeated states.), For each of
the following search strategies, indicate the expanded nodes, the path solution and its
cost. When placing expanded child nodes on the fringe with same cost, assume that the
child nodes are placed in alphabetical order.
Search Algorithm Expanded nodes Path solution Cost
Depth first search
Breadth first search
Uniform cost search
A* search with heuristic h1
A* search with heuristic h2