dfs

[gregdavenport2000]

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.

 

[iza]

basically, every time you encounter a node, you increment a counter !!!!! give us the code so that we tell you where to put the counter ;] ------
please review FAQ183-874 - this will help you to get the best out of tt
[ "you" is not someone in particular - don't take it too personnal ]