Connect 4 with AI powered by Monte Carlo Tree Search.

An ISMCTS AI for the card game Schnapsen

Ultimate Tic Tac Toe for Android

Unbeatable AI for the tic tac toe.

An implementation of MinMax and Monte Carlo Tree Search solvers for Connect 4.

A generalized multithreaded artificial intelligence capable of playing: Connect Four, Hex (7 x 7), Reversi (Othello), and Tic-Tac-Toe.

Gobang game and AI implemented with monte carlo tree search in javascript

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

Efficient algorithm for making informed decisions in games and other decision-making scenarios. It combines elements of simulation, random sampling, and decision tree analysis to make accurate predictions in real-time. The algorithm is written in Kotlin, a modern and expressive programming language, making it easy to understand and modify.

A Connect4 AI.

explorations of Scheme synthesis in Scheme

🌲 Teaching an AI to solve Sokoban using AlphaGo-Zero style RL & Single-Player MCTS.

GenesisZERO : potential applications for MCTS agents with LLMs for Sequential decision-making

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.

Monte Carlo Tree Search applied to Combinatorial Search Problems

We implemented a Monte Carlo Tree Search (MCTS) from scratch and we successfully applied it to Tic-Tac-Toe game.

2048 game with integrated AI.

Monte Carlo Tree Search engine for 8x8 American/English draughts.

Code for the paper "Learning Programs with arguments and sampling"