A tool for retrosynthetic planning

A programming language for implementing turn-based games with complex rule sets. (with built in Monte Carlo Tree Search AI!)

LLM verified with Monte Carlo Tree Search

#include-only, single header, custom written ai that can play ANY turn based game, including Boardgames, Card-games, hidden-info games, multiplayer games, and games with randomness.

[NeurIPS 2023 Spotlight] LightZero: A Unified Benchmark for Monte Carlo Tree Search in General Sequential Decision Scenarios

Quoridor AI based on Monte Carlo tree search

Monte Carlo tree search in JAX

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

Simple Implementation of the Monte Carlo Tree Search Algorithm

React Native Game with AI

An implementation of Minimax, Alpha-Beta and Monte-Carlo Tree Search to play Connect 4

This repository contains a Python implementation of the classic game Tic Tac Toe with AI opponent. The game is played on a 3x3 grid by two players, one using 'X' and the other using 'O'. The player who first gets 3 of their marks in a row (up, down, across, or diagonally) is the winner.

Jarlo is a UCI compatiable chess engine written from scratch in C to test Monte Carlo search.

A simple curses connect 4 game to be enjoyed in the terminal.

A General Automated Machine Learning framework to simplify the development of End-to-end AutoML toolkits in specific domains.

Turn-based game for two players

Deep Learning 4 Games. Code for a bot that plays Jass for a course at applied university of lucerne

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

Implementation of AlphaZero, a deep reinforcement learning algorithm, on games like TicTacToe and Connect Four

(Explainable) Algorithmic Recourse with Reinforcement Learning and MCTS (FARE and E-FARE)