final_2009

# In the event of a tie use the alphabetical order of

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: order of the final node on the contending partial paths. Draw your search tree: Also, show your extended list at the time your search terminates: B2: What is the route found using beam search? 7 Part C: Branch and Bound (20 Points) C1: Lastly, you try to plan your route using Branch and Bound using the path lengths indicated on the graph and also using an extended list. Draw your search tree and extended list below: Also, show your extended list at the time your search terminates: C2: What is the route found using branch and bound? C3: If you repeat the search using the A* algorithm with the heuristic values indicated on the graph, will you find the same route? Include a brief explanation of why or why not. 8 Quiz 2 Problem 1: Games (50 points) A MAX B MIN MAX MIN F [1 ] C H [5 ] G N [1 0 ] O [4 ] D J [3 ] I P [3 ] Q [1 5 ] E L [2 4 ] K R [6 ] S [2 ] A: Using minimax only, no alpha-beta,, indicate the values of the following nodes. (10 pts) A= G= B= I= C= K= D= M= E= B: Using minimax only, what is the best next...
View Full Document

## This document was uploaded on 03/17/2014 for the course EECS 6.034 at MIT.

Ask a homework question - tutors are online