Quote:
Originally Posted by Tigairius
Cool use of trees. Admittedly, I didn't really follow your post very well, but I am wondering if the efficiency could be improved by using other algorithms similar to Adelson-Velskii Landis trees (which automatically balance themselves to make sure one side of the tree is not longer than the opposite side of it), which would make searching for behaviors much faster. Do you know if that would be applicable in this situation? I'm sure there is some way it could be worked over to behave correctly. |
Behavior Trees by nature will most likely have unbalanced sides, and are not binary trees. Overall, searching down the tree is actually very simple, so it isn't slow at all.
I know my explanation isn't very good, I'm trying to make revisions to simplify it.
I encourage people to look at some of the pages I linked to, especially the first four, as they are the simplest.