This document discusses three key issues in designing search programs: 1) whether the search proceeds forward from the start state or backward from the goal state, 2) how to efficiently select applicable rules or productions to apply at each step, and 3) how to represent the state of the search at each node to guide the exploration of the problem space.
This document discusses three key issues in designing search programs: 1) whether the search proceeds forward from the start state or backward from the goal state, 2) how to efficiently select applicable rules or productions to apply at each step, and 3) how to represent the state of the search at each node to guide the exploration of the problem space.
This document discusses three key issues in designing search programs: 1) whether the search proceeds forward from the start state or backward from the goal state, 2) how to efficiently select applicable rules or productions to apply at each step, and 3) how to represent the state of the search at each node to guide the exploration of the problem space.