If you are interested, here (http://cs.calstatela.edu/~wiki/index.php/Courses/CS_460/Fall_2005/SolveAll) is a version of SolveAll, revised from the version in Chapter 12 of CTM, which takes as a parameter either depth or breadth and does the requested sort of traversal. The depth-first or breadth-first aspect of the search can be factored out almost entirely.
-- Russ
_________________________________________________________________________________ mozart-users mailing list [email protected] http://www.mozart-oz.org/mailman/listinfo/mozart-users
