Question: Question1 (Global Search): Consider the graph below. The start node is Z and the goal node is A. 1- Show the steps for expanding


Question1 (Global Search): Consider the graph below. The start node is Z and the goal node is A. 1- Show the steps for expanding the nodes using iterative deepening search to the solution. Start with depth 2 and use increment 2. 2- The heuristic h used is the one near each node. h(B)=2, h(G)=4.2,... Is this heuristic admissible? Show why and why not. 3- Show the A* work from Z to A using this heuristic. Is the first goal path optimal? 2 2 -25.7 F 4 4.5 D 4 2.8 H 2 E 2.8 B 2.0 1.4 1.4 G 4.2 1 2.2 2.2 2.0 CA.1 Question2 (Adversarial Search): 1. Perform Min Max search by filling in the internal node values in the following game tree,: MAX MIN h MAX Z V 543645943789987922382424414 AIX ZVV ZX 2-Perform MiniMax algorithm with Alpha-Beta pruning and indicate the leaf nodes not visited at all in the above graph. Question3 (Local Search): Briefly state why local search is in some cases preferred to global search? What are the advantages and disadvantages of both (no more than 10 lines).
Step by Step Solution
3.35 Rating (142 Votes )
There are 3 Steps involved in it
Question1 Global Search By starting at depth 2 our frontier will be F G E and C Since our increment is 2 our next goal should be got by adding 2 to the frontier Therefore we will get the following F A ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
627b9402d612a_101640.docx
120 KBs Word File
