CMU Artificial Intelligence Repository
Home INFO Search FAQs Repository Root

AI Search: AI C++ Search Class Library

The search class library is meant to be used as a tool for developing problem solving software. The library 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.
   as the files and aisearch.tar.Z

Version: 6-JAN-94 Requires: C++ CD-ROM: Prime Time Freeware for AI, Issue 1-1 Author(s): Peter Bouthoorn or ICCE, University of Groningen, The Netherlands. Keywords: AND/OR Tree Search, Authors!Bouthoorn, Best-First Search, Bidirectional Search, Breadth-First Search, C++!Code, Depth-First Search, Search References: ?
Last Web update on Mon Feb 13 10:28:11 1995