Reference no: EM133916659
Problem
Consider the unbounded version of the regular 2D grid shown above. The start state is at the origin, (0,0), and the goal state is at (x,y). The agent must take an action in any state, including North, South, East, or West. Consider the tree search below (unless noted otherwise):
1. What is the branching factor b (i.e., maximum possible transitions from each state)?
2. How many distinct states are there at depth k (for k > 0) in the search tree?
3. What is the maximum number of nodes expanded by breadth-first tree search?
4. What is the maximum number of nodes expanded by breadth-first graph search?
5. Is h = |u - x| + |v - y| an admissible heuristic for a state at (u, v)? Explain.
6. How many nodes are expanded by A* graph search using h in part (5)?
7. Does h remain admissible if some links are removed? Explain. Get the instant assignment help.
8. Does h remain admissible if some links are added between nonadjacent states? Explain.