人工智能与经网络笔记3.ppt

(b) Effective Branching factor, B, of A Search B is defined by the equation: B + B + … + B = T (total number of nodes) Hence T = 2 L (B - 1) B L B - 1 P = = L T L (B - 1) B(B - 1) L Where the assumptions are made: (1) The depth of the search tree = the length of path L (2) T = the number of nodes generated during search (3) B is a constant for all nodes in the tree 帝让义像兄纂涡睹蒲呻虾稻鲜连蹦讲傀衬组即破碍慰惠统辛菜狂媒迫晦腥人工智能与经网络笔记3人工智能与经网络笔记3 Home-Works 1. Propose two h functions for the traveling salesman problem. Is either these h functions a lower bound