A pure Lua library for A* path-finding with flexible map integration and optional caching.
Easy A* path finding for Lua
Fast, lightweight and easy-to-use pathfinding library for grid-based games
Fast & easy-to-use A* module written in Lua
A behavior tree implementation in lua.
LOVEly Trees is a comprehensive behavior tree library designed for game development, providing a modular system for creating complex AI behaviors. It offers a rich set of compositors, decorators, and actions, along with a visual tree renderer for debugging and understanding behavior flow. ## Key Features - **Comprehensive Node Library** — Includes Sequence, Selector, Parallel nodes, Random selectors, and various decorators like Invert, Repeat, Retry, and execution/time limits. - **Blackboard System** — Shared storage accessible by all nodes for state management and decoupling behavior logic. - **Custom Actions** — Flexible API for defining custom action nodes with optional performance optimizations via reset functions. - **Tree Visualization** — Built-in rendering module for visualizing behavior tree structure and execution flow. - **LÖVE Integration** — Optional rendering components specifically for the LÖVE game framework, while the core behavior tree system remains framework-agnostic. ## Philosophy LOVEly Trees emphasizes simplicity and modularity, allowing developers to build complex AI behaviors from small, reusable components while maintaining clear separation between behavior logic and game framework dependencies.
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.