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 written in Rust
A strong chess engine made in c++
Strong UCI Chess Engine written in C++17 (Not C, GitHub!!!)
AI for Playing Russian Checkers (aka "Shashki")
A web chess game with a negamax AI
Python Othello Board Game to be played in Human vs. Computer mode, using alpha-beta pruning (minmax algorithm) algorithm.🎮👾🤖🏆
Project Showcase: Unbeatable Tic-Tac-Toe AI Game I utilized the Minimax algorithm with Alpha-Beta Pruning to create an unbeatable AI opponent. This ensures that the AI always makes the optimal move, providing a challenging and fair game for human players. The project helped me deepen my understanding of game theory and basic search algorithms.
Implementation of popular AI algorithms
Minimax solver with alpha-beta pruning for Connect Three 3D
Search, Knowledge, Uncertainty, Optimization, Learning, Neural Networks and Language.
The AI player is developed using the Alpha Beta Pruning search algorithm, an optimization technique for the minimax algorithm.
[NeurIPS 2023 Spotlight] LightZero: A Unified Benchmark for Monte Carlo Tree Search in General Sequential Decision Scenarios
Chess engine
Unity2D_대전 전략 오목 게임
Tic-Tac-Toe using Minimax/Alpha-Beta
♟️ An algorithmic chess engine, written in Python.
Add a description, image, and links to the alpha-beta-pruning topic page so that developers can more easily learn about it.
To associate your repository with the alpha-beta-pruning topic, visit your repo's landing page and select "manage topics."