Did you know that @powerpoint is Turing Complete? ๐ง
@standupmaths & @MouldS made a very nice video about this. And for a more formal, comprehensive discussion, check out Tom Wildenhain's videos on YouTube. โจ
Many of you are familiar with FINITE STATE MACHINES: the most popular pattern for character controllers.
While FSMs are graphs, BTs are (unsurprisingly!) trees. ๐ฒTheir leaves are the ACTIONS ๐ฆพ and PERCEPTIONS ๐๏ธ your agents can perform and sense.
Each node in a BT can be in any of the three following states:
โข โ๏ธ SUCCESS: the node was executed successfully
โข โ FAILURE: the node could not be completed
โข โณ RUNNING: the node is still being executed