- 1
- In the search class library it is assumed that sub-problems
must be solved in the order in which they are generated.
- 2
- See Knuth(1979), p.305ff. for the concept
of trees in computer science.
- 3
- See Nilsson(1971), p.22, Barr(1981), p.25/26, Ritch(1983), p.63
- 4
- Knuth(1979), p.371.
- 5
- This step is not done in the bidirectional and
AND/OR search algorithms. They have a different way of determining whether
the problem is solved or not.
- 6
- we will take this class as an example, what we tell here
applies also to class BISEARCH_ and class AOSEARCH_; important differences
will be discussed later.
- 7
- A problem that is to be solved using the problem reduction
representation, i.e., using an AND/OR search algorithm, does not have a goal
state, because to solve the problem we do not look for a goal state, but need to
divide the problem into sub-problems that may or may not be solvable.
- 8
- a terminal node is a node that
represents a primivite problem in a problem reduction presentation, see
section