人工智能及神经网络笔记3.pptVIP

(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 Home-Works 1. Propose two h functions for the traveling salesman problem. Is either these h functions a lower bound on h*? Which of them would result in more efficient search ? Apply algorithm A with these h functions to the TSP problem. 2. Use the evaluation function f(n)=d(n)+w(n) with algorithm A to search backward from the goal to the start node in the 8-puzzle problem. 3. Discuss ways in which an h function might be improved during a search. § 5-2 Game-Playing: AND/OR Graph Search I. Game-Playing and AO Graph Two-Person-Zero-Sum-Perfect Information Games Example: Grundy’s Game Two Players, Max and Min, have a pile of pennies. The first player, Min, divides the original pile into two piles that must be unequal. Each player alternatively thereafter does the same to some single pile when it is his turn to play. The game proceeds until every pile has either just one penny or two. The player who first can not play is the loser. 7; Min 5,2;Max 6,1;Max 4,3;Max 5,1,1;Min 4,2,1;Min 3,2,2;Min 3,3,1;Min 3,2,1,1;Max 4,1,1,1;Max 2,2,2,1;Max 2,2,1,1,1;Min 3,1,1,1,1;Min 2,1,1,1,1,1;Max Wining path for Max AND/OR Graph From Max’s point of view, a win must be obtainable from all of Min’s successors and from at least one of Max’s successors. It is an AND/OR graph. In AND/OR graphs, there are hyper-arcs connecting a parent node with a set of its successors. The hyper-arcs are called connectors. Each k-connector is directed from a parent node to a set of k successor nodes. II. Features of AND/OR Graph Search