Status: Complete, No longer maintained.
This is a collection of prolog programs that implement classic graph search algorithms.
They should work on any prolog environment. They are written in a semi modular form and the headers of each file give an example of how to use them.
Implement the algorithms: breadth first, depth first and iterative search. Apply them to graphs and to the 8 number puzzle.
I did the all the code and algorithm translation.
What is broken
Dunno, but never tested beyond the samples.