Any help with these questions would be greatly appreciated Imagine that you cont

Question

Any help with these questions would be greatly appreciated

Imagine that you control a pac-man in a known maze that is 1 point inside a m by n rectangle. In each step, the pac-man can either 1) move to an adjacent (up,right,left,down) square if the move is not blocked by a wall; or 2) stay still. The pac- man wants to get to a designated target square. Which of the following is minimal state space representation?* O An integer z giving the Manhattan distance to the target O An integer z giving the Euclidean distance to the target O A tuple (xy) giving the x and y coordinate of the pac-man O This is not a search problem What is the size of the state space?* O log (mn) O o(m) O o(mn) O o(m+n) O max(m,n) 1 point What is the space requirement if you use depth first search 1point to solve this search problem?" O log(mn) O o(m+n) O max(m,n) O o(m) O o(mn) Which of the following heuristics are admissible (if any)?" 1 point Manhattan distance from the pac-man to target Euclidean distance from pac-man to target Euclidean distance from pac-man to target plus number of times that a line from pac-man to target crosses a wall Number of steps taken by the pac-man from the start state Always guess that the distance to target is 0

Explanation / Answer

Answers

1)

Option: 3

2)

Option: 3

3)

Option : 1

4)

Option : 1 & 2

5)

Option : 2

6)

Option : 2 & 3

7)

Option: 3

Thank you

If any queries i am always available to solve

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.