I'm looking for an algorithm that will let me plug in a heuristic for scoring a subtree, and as the algorithm does a depth-first search, it stops when the score has:

  • Already hit a threshold (minimum score)
  • only changed a very small amount from child to parent

So this algorithm would be doing a fuzzy search for a "payload."

Is there an algorithm like this?

  • 3
    $\begingroup$ You have already described it. $\endgroup$ – Raphael Jul 24 '17 at 17:39
  • $\begingroup$ Possibly related: Infinite trees. There are alternative and adaptive methods of traversing infinite trees with some sort of diminishing return, because we clearly could not traverse all of the tree. $\endgroup$ – ryan Jul 24 '17 at 19:05
  • $\begingroup$ Maybe related: en.wikipedia.org/wiki/Monte_Carlo_tree_search $\endgroup$ – adrianN Jul 25 '17 at 7:03

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.