580 California St., Suite 400
San Francisco, CA, 94104
Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
Table 4 Evaluation of search algorithms. b is the branching factor'; d is the depth of solution, m is the maximum depth of the search tree; | is the depth limit (Russel and Norvig, 1995)
Discover breakthrough research and expand your academic network
Join for free