Home› Projects› BehaviorTree.CPP
BehaviorTree.CPP
C++

BehaviorTree.CPP

Behavior Trees Library in C++. Batteries included.

by BehaviorTree · GitHub
Stars
Forks
License
Created
Last commit
Category
Language
aibehaviortreecoordinationMITC++
View on GitHub
In plain words

Create AI behaviors for games or robots using a flexible tree structure.

You maintain this project?

Claim its page: indexed whatever its rank, translated into six languages, and enriched with what you write yourself.

Claim this page →
BehaviorTree.CPP — GitHub preview card
📈 Star history
4.11k4.10k
2026-07-072026-08-31
📈 Track BehaviorTree.CPP

Get an email alert on its next release or when it starts trending — never miss the moment.

Free · no card · unsubscribe anytime
Get email alerts →
📄 About

Behavior Trees Library in C++. Batteries included.

BehaviorTree.CPP has 4.1k stars on GitHub. It has been forked 846 times. BehaviorTree.CPP is written mainly in C++. It has been in active development since 2018. BehaviorTree.CPP is available under the MIT license. Its main topics are ai, behaviortree, coordination, games.

❓ Frequently asked questions

What is BehaviorTree.CPP?

Behavior Trees Library in C++. Batteries included.

Is BehaviorTree.CPP open source?

BehaviorTree.CPP is an open-source project. It is released under the MIT license.

Is BehaviorTree.CPP free?

Yes. BehaviorTree.CPP is free and open source — you can use, modify and self-host it.

What license does BehaviorTree.CPP use?

BehaviorTree.CPP is available under the MIT license.

What language is BehaviorTree.CPP written in?

BehaviorTree.CPP is written mainly in C++.

🏅 Maintainer of this project?
olud.ai badge — BehaviorTree.CPP

Add this live badge to your README — your GitHub stars and directory rank, refreshed daily.

[![olud.ai](https://olud.ai/badge.php?tool=behaviortree-behaviortree-cpp)](https://olud.ai/project/behaviortree-behaviortree-cpp.html)
More badge options →
🧬 Shares DNA with🧬 View the DNA map →

Measured from GitHub topics shared by both projects, weighted by how rare each topic is.