A closure-based behavior tree (BT) implementation

[allsey87]

Hi everyone,

I have created a minimalistic behavior tree library using Lua closures that some of you may be interested in. The repository is located on Github: https://github.com/allsey87/luabt

Unlike other implementations, this has been written from scratch in Lua (it is not a port from another library) and is designed for expressing complex behavior in a modular way. Please use the issue tracker on Github if you find any bugs or would like me to add any features.

Have fun!

[D0NM]

It looks brilliant and produces well self explaining code.
Thank you.

[allsey87]

It looks brilliant and produces well self explaining code.
Thank you.

No problem! Let me know if you would like support for other node types. I have only implemented the absolute basics for the moment.

[allsey87]

This library has been updated to include a selector* and a sequence* composite node. I also fixed a bug with the negate decorator node which became apparent during the testing of selector* and sequence*. The new composite nodes remember the state of their children while there is a child that is returning running. I have also added an advanced example which demonstrates how closures can be used to create local memory that can be used by a node.