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

Sanmill is an open-source, UCI-like Mill/Morris/Merrills/Mühle/Malom (and its variants) program with CUI, Flutter GUI and Qt GUI, sharing and freely distributing the code, tools and data needed to deliver this mill game. We do this because we are convinced that open software and open data are key ingredients to make rapid progress.

♟️ A chess engine with alpha-beta pruning, piece-square tables, move ordering, and command-line UI.

Complete TypeScript chess engine with zero dependencies for Node.js >=24 and browsers. Features configurable AI (5 predefined difficulty levels), stateful/stateless APIs, and supports JSON and FEN formats.

Strong neural-network chess engine written in C++

Animal Fight Chess Game（斗兽棋） written in rust.

中国象棋程序学习笔记（JavaScript版）

C++ Gomoku with a strong AI based on minimax search and alpha-beta pruning with Qt5 GUI. *Dozens of C++ tricks & hacks are used to improve efficiency.* Come and try to see if you can beat the powerful AI!

An unbeatable game of Tic Tac Toe.

一个由 Minimax 算法和 Alpha-Beta 剪枝驱动的五子棋 AI，最高支持 14 层深度搜索，包含段位系统和双人对战模式。

A tic tac toe game with an AI opponent using minimax algorithm and alpha-beta pruning

A checkers reinforcement learning AI, and all the tools needed to train it.

A top superhuman chess engine made in c++

A UCI chess engine written in Rust.

CSE 571 Artificial Intelligence

A game of checkers written using minmax algorithm and alpha-beta pruning.

Chess engine

Artificial Intelligence for the game Go-Moku using the Minimax Algorithm with Alpha-Beta Pruning

Solutions for the Projects of the Artificial Intelligence (CS 188) course of UC Berkeley

🎮 使用α-β剪枝（Alpha-beta-pruning）的极小极大算法（Minimax-algorithm）实现的井字棋（一字棋、tic-tac-toe）游戏。