Popular GitHub Repositories for Game Tree

A game theoretic approach to explain the output of any machine learning model.

A fast, distributed, high performance gradient boosting (GBT, GBDT, GBRT, GBM or MART) framework based on decision tree algorithms, used for ranking, classification and many other machine learning tasks.

A curated list of practical guide resources of LLMs (LLMs Tree, Examples, Papers)

? An exciting game of programming and Artificial Intelligence

Game Agent Framework. Helping you create AIs / Bots that learn to play any game you own!

Flappy Bird hack using Deep Reinforcement Learning (Deep Q-learning).

A CLI tool to convert your codebase into a single LLM prompt with source tree, prompt templating, and token counting.

[NeurIPS 2023] Tree of Thoughts: Deliberate Problem Solving with Large Language Models

Official PyTorch implementation of PTS/PSRN: Fast and efficient symbolic expression discovery through parallelized tree search. Evaluates millions of expressions simultaneously on GPU with automated subtree reuse.

The Enterprise-Grade Production-Ready Multi-Agent Orchestration Framework. Website: https://swarms.ai

A distributed approximate nearest neighborhood search (ANN) library which provides a high quality vector index build, search and distributed online serving toolkits for large scale vector search scenario.

Plug in and Play Implementation of Tree of Thoughts: Deliberate Problem Solving with Large Language Models that Elevates Model Reasoning by atleast 70%

[ICML 2021] DouZero: Mastering DouDizhu with Self-Play Deep Reinforcement Learning | 斗地主AI

A clean implementation based on AlphaZero for any game in any framework + tutorial + Othello/Gobang/TicTacToe/Connect4 and more

C++ Action Roguelike in Unreal Engine 5.

An implementation of the AlphaZero algorithm for Gomoku (also called Gobang or Five in a Row)

Reinforcement Learning / AI Bots in Card (Poker) Games - Blackjack, Leduc, Texas, DouDizhu, Mahjong, UNO.

Python package for AutoML on Tabular Data with Feature Engineering, Hyper-Parameters Tuning, Explanations and Automatic Documentation

MiniMax-01 is a simple implementation of the MiniMax algorithm, a widely used strategy for decision-making in two-player turn-based games like Tic-Tac-Toe. The algorithm aims to minimize the maximum possible loss for the player, making it a popular choice for developing AI opponents in various game scenarios.

A python library for decision tree visualization and model interpretation.