Search. A Section of the Handbook of Artificial Intelligence (1979)
Defense Technical Information Center · leaf 33
hich Is one move longer than the minimum, calls for the pawn to enter at (1,3), move one square right, and then go straight down to (4.4). Had no depth bound been used, the tree would have been one level deeper since node S12 has a successor, (4,1). Since the algorithm treats the state space as a… … (4,4) (3,1) (4,1) Figure 4. The search tree for Figure 3. Bidirectional Search Each of the algorithms giver, above uses forward reasoning, working from the start node of a state-space tree towards a goal node and using operators that each map a node I to a successor node j. In some cases, the…
Gardner, Anne · Stanford univ ca dept of computer science · Artificial intelligence · Algorithms · Automatic programming · Information retrieval · Natural language · Online systems · Programming languages · Searching
Internet Archive · Defense Technical Information Center · Public domain (US government work). Free to use for anything.
