AI bot implementation for 4x4x4x4 ultimate tic-tac-toe game
-
Updated
Mar 3, 2017 - Python
AI bot implementation for 4x4x4x4 ultimate tic-tac-toe game
A simple 4 Connect Game made using pygame module in PYTHON 3.x!
Abalone board game implementation with AI player based on Mini-Max Algorithm
JetBrains Academy - Python Developer - Tic-Tac-Toe with AI (+ bonus Reversi game)
A basic Othello (Reversi) implementation that is playable by both humans and general minimax alpha-beta pruning agents
Very simple checkers bot made using minimax algorithm with alpha-beta pruning to calculate the ideal move.
This project uses pygame and the minimax algorithm to make a tic-tac-toe board where you can play against an AI.
AI for utimate tic tac toe game use minimax
This project adopts Minimax algorithm (with α-β pruning) to implement an AI player that can play Reversi game.
Includes an AI agent for playing checkers
AI driven Tic-Tac-Toe game that runs on the Minimax algorithm with Alpha-Beta Pruning
Tic-Tac-Toe game coded in Python using Minimax Algorithm
Building a chess engine in python using the pygame module
AI for four in a row game using Minimax with alpha beta pruning and Monte Carlo Tree Search
An unbeatable Tic Tac Toe AI
Tic Tac Toe game, implemented in python, pygame.
A simple game of tic tac toe
A chess engine in Python
An adversarial agent for playing Tic Tac Toe, offering users the option to choose board size and difficulty level. Utilizes various search algorithms including, but not limited to; Alpha-Beta Pruning, Expectimax, and Minimax. The project provides an interactive interface where users can play against the adversarial agent.
Add a description, image, and links to the minimax-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the minimax-algorithm topic, visit your repo's landing page and select "manage topics."