They state that Behavior Trees provide the same functionality as Finite State Machines, however since there appear to be no loops (remember they are a tree) how would you handle iteration or recursion ?<p>Finite State Machines don&#x27;t have memory per se, but duplication of states can create the illusion of memory.
if you have five states in a row that expect a particular situation&#x2F;sequence, then this could emulate a counter up to five. I think this could be done with multiple states in a behavior tree. But a FSM could have a physical loop back to a previous state which would emulate an unknown number of states. I don&#x27;t see how to do this with Behaviour trees.<p>I&#x27;d like to see more details, and of course, if anyone actually has used these, I&#x27;d like to hear how repetition is supported, or even time varying values.