Contents Up << >>

Aisearch - a package to make writing problem solving programs easier.

Offers the programmer a set of search algorithms that may be used to solve all kind of different problems. The following search algorithms have been implemented:

- depth-first tree and graph search.

- breadth-first tree and graph search.

- uniform-cost tree and graph search.

- best-first search.

- bidirectional depth-first tree and graph search.

- bidirectional breadth-first tree and graph search.

- AND/OR depth tree search.

- AND/OR breadth tree search.

Although this package is meant as a tool for developing problem solving software it is not meant exclusively for programmers that are familiar with the concept of problem representation and search techniques. The document accompanying this package first describes (though condensed) the theory of problem solving in AI and next explains how the search class library must be used. Furthermore, as the source code is richly commented and as also some demo programs are included the package should also prove useful to people that want to get acquainted with the subject.

ftp from obelix.icce.rug.nl in /pub/peter/aisearch.zip or /pub/peter/aisearch.tar.Z