This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CS141 Introduction to AI Professor Meinolf Sellmann Homework 1 Blind Search and Informed Search Due: 6:00pm on 09/23/09 Problem 1.1 Consider a state space where the start state is number 1 and the successor function for state n returns two states, numbers 2 n and 2 n + 1. a. Draw the portion of the state space for states 1 to 15. b. Suppose the goal state is 11. List the order in which nodes will be visited for breadth first search, depthlimited search with limit 3, and iterative deepening search. For Depth Limited search, take the root node to have depth 1, such that a DepthLimit 1 search explores the root and nothing else. When considering iterated deepening, please report those states visited multiple times as such (i.e., don’t report only the first time the node is visited.) c. Describe how one could apply bidirectional search to this problem. Why is it appropriate? d. What is the branching factor in each direction of the bidirectional search? e. Given the answers above, suggest an even more efficient way to solve this problem than bidirectional search. Solution: a. see figure. CS141 Homework 1 6:00pm on 09/23/09 b. BFS: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 DFS: 1, 2, 4, 8, 9, 5, 10, 11 DepthLimit 3: 1, 2, 4, 5, 3, 6, 7 (Cutoff; Goal node not reached) ID: 1; 1, 2, 3; 1, 2, 4, 5, 3, 6, 7; 1, 2, 4, 8, 9, 5, 10, 11 c. Yes, bidirectional search would work well, because there is one explicitly defined goal statec....
View
Full Document
 Spring '10
 asda
 Search algorithms, Admissible heuristic, Iterative deepening depthfirst search

Click to edit the document details