UninformedSearch-UMBC.pptVIP

CMSC 471Spring 2014Class #4Thu 2/6/14Uninformed Search Professor Marie desJardins, mariedj@cs.umbc.edu Today’s Class Specific algorithms Breadth-first search Depth-first search Uniform cost search Depth-first iterative deepening Example problems revisited Lisp lab! Uninformed Search Chapter 3.4 Some material adopted from notes by Charles R. Dyer, University of Wisconsin-Madison Key procedures to be defined EXPAND Generate all successor nodes of a given node GOAL-TEST Test if state satisfies all goal conditions QUEUEING-FUNCTION Used to maintain a ranked list of nodes that are candidates for expansion Pre-Reading Quiz How does breadth-first search instantiate the EXPAND, GOAL-TEST, and QUEUING-FUNCTION components of state space search? What does breadth-first search remind you of? [hint: I’m thinking of a simple abstract data type that you learned about in CMSC 201...] How does uniform-cost search instantiate these search components? Uniform-cost search may be less familiar. Do you know another name for this type of search? Can you give a real-world equivalent/example? How does depth-first search instantiate these search components? What does depth-first search remind you of? VERY IMPORTANT, ABSOLUTELY CRITICAL QUESTION: Why is it important that the goal test is applied at expansion time rather than generation time? Uninformed vs. Informed Search Uninformed search strategies Also known as “blind search,” uninformed search strategies use no information about the likely “direction” of the goal node(s) Uninformed search methods: Breadth-first, depth-first, depth-limited, uniform-cost, depth-first iterative deepening, bidirectional Informed search strategies (next class...) Also known as “heuristic search,” informed search strategies use information about the domain to (try to) (usually) head in the general direction of the goal node(s) Informed search methods: Hill climbing, best-first, greedy search, beam search, A, A* Example for Illustrating Search Strat