Academia.eduAcademia.edu

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)

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)