Algorithms in a Nutshell

(^206) | Chapter 7: Path Finding in AI
with up to 30 random moves, the growth rate of the search tree was O(n1.5147);
although not linear, this size is significantly smaller than for the blind searches.
The actual exponent in each of these growth rate functions is dependent upon the
branching factor for the problem being solved. The results of Table 7-4 are shown
graphically in Figure 7-14.
Figure 7-14. Comparing search tree size for random positions
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