Many problems can be represented as an initial state, a goal state and a set of operators <164> that define operations to go to new states from a given state. The states that can be reached from the initial state by applying the rules in all possible ways define the state space. The problem is then to reach the goal state from the initial state. By this formulation almost any problem can be reduced to a search problem.
- (Barr and Feigenbaum 81).Barr, A. and Feigenbaum, E.A. (editors). The Handbook of Artificial Intelligence Vol. 1 Kaufmann. 1981.Google Scholar