Minmax (minimax) algorithm with Alpha-Beta (𝛼−𝛽, ab) Pruning optimization for the Checkers (Draughts) game in Python 3. Same minimax algorithm works for chess, tic tac toe or similar games.
-
Updated
Dec 19, 2020 - Python
Minmax (minimax) algorithm with Alpha-Beta (𝛼−𝛽, ab) Pruning optimization for the Checkers (Draughts) game in Python 3. Same minimax algorithm works for chess, tic tac toe or similar games.
This is a game AI project for the course "Artificial Intelligence" at the University of Calabria, Italy.
Othello Game (Also known as Reversi). It was created with the Minimax algorithm (Alpha-Beta pruning). Allows Human-AI, AI-AI, RandomPlayer-AI, RandomPlayer-Human interplay
A project for chillin wars competition(year 2020) written in Python, which agents make desicions using lapha-betha search and evolutionary algorithm.
An implementation of Alpha-Zero algorithm for 8 x 8 Connect 4, comparing it to a naive alpha-beta search.
Game-playing agents for playing the abstract board game Breakthrough (https://en.wikipedia.org/wiki/Breakthrough_(board_game))
Add a description, image, and links to the alpha-beta-search topic page so that developers can more easily learn about it.
To associate your repository with the alpha-beta-search topic, visit your repo's landing page and select "manage topics."