The AI Challenge is all about creating artificial intelligence bot that controls a colony of ants which fight against other colonies for domination in a competitive tournament.
-
Updated
Nov 11, 2020 - Python
The AI Challenge is all about creating artificial intelligence bot that controls a colony of ants which fight against other colonies for domination in a competitive tournament.
Python based Tic Tac Toe game using MinMax Algorithm
Minimax Search Method is used to implement an Artificial Intelligence to play Tic-Tac-Toe optimally.
scalable TicTacToe game that allows the player to take on a friend, a bot making random moves or a bot making deliberate moves by means of the minimax algorithm on a board with custom size.
Tic tac toe game in Pygame with minimax algorithm.
Artificial Intelligence, Fall 2019, University of Tehran
A simple console-based Connect Four game done as a winter holiday project
Connect 4 game against AI agent using MinMax algrorithm and pyqt5 GUI framework
This project is an implementation of a simple AI playing TicTacToe using the MinMax algorithm and a simple heuristic. This project has been made only for educational purpose
NightFox is an AI capable of playing state based games without using neural networks and purely on primitive AI algorithms.
Tic Tac Toe implemented with MINIMAX algorithm.
Implements an agent to play Othello with adversarial search
Pacman AI that utilizes minimax, alpha beta pruning, expectimax.
PvP and vs AI
Tic tac toe AI with MinMax and aplha-beta prunning.
PyGame TicTacToe to learn MinMax algorithm
Add a description, image, and links to the minmax-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the minmax-algorithm topic, visit your repo's landing page and select "manage topics."