Hello,
How do I modify a depth-first search algorithm written in prolog, so that it counts the number of nodes in the search tree it has visited? I'm doing this with the aim to modify the algorithm to prune search paths of certain lengths (also known as depth-limited search).
Thanks.
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.