Algorithms in a Nutshell

(^182) | Chapter 7: Path Finding in AI
Output
Return a sequence of moves that represents a path from the initial state to the goal
state (or declare that no such solution was found given existing resources).
Assumption
For the purposes of analysis, we assume thatdis the maximum depth bound for
the DEPTH-FIRSTSEARCH. We definebto be the branching factor for the under-
lying search tree.
Context
DEPTH-FIRSTSEARCHis a blind search that is practical only if the predicted
search space is within the memory space of the computer. One can restrict the
search to stop after a fixed depth bound is reached, which enables some control
over the resources used.
Figure 7-5. Depth-First Search fact sheet
Algorithms in a Nutshell
Algorithms in a Nutshell By Gary Pollice, George T. Heineman, Stanley Selkow ISBN:
9780596516246 Publisher: O'Reilly Media, Inc.
Prepared for Ming Yi, Safari ID: [email protected]
Licensed by Ming Yi
Print Publication Date: 2008/10/21 User number: 594243
© 2009 Safari Books Online, LLC. This PDF is made available for personal use only during the relevant subscription term, subject to the Safari Terms of Service. Any other use