Minimax is a AI algorithm.
-
Updated
Dec 27, 2023 - Python
Minimax is a AI algorithm.
CSE 571 Artificial Intelligence
A game of checkers written using minmax algorithm and alpha-beta pruning.
A simple chess game for comparing your moves with other chess engines
AI bots playing Tic Tac Toe
a basic adversarial game
2048 puzzle using minimax algorithm
A-List of all the Assignment done in Artificial Intelligence Course @IIIT-D
Python compiled with Numba (from 7300 to 1500000 nodes/second)
Tic-Tac-Toe Game with an unbeatable AI using Minimax Algorithm
Bots for the board game quoridor implemented using four algorithms: minimax, minimax with alpha beta pruning, expectimax and monte carlo tree search.
A collection of game AI
🎃 Unbeatable Tic Tac Toe Game using Minimax Algorithm.
A Connect 4 GUI with an AI opponent - using the Minimax algorithm with Alpha-Beta pruning
AI based tic tac toe game that is impossible to win. Think you can beat a computer? Well, you can't.
Ai agent for pacman
Contains step-by-step creation of an Artificial Bot that plays Tic-Tac-Toe intelligently.
♘ Deep learning Chess Engine ♞
Unbeatable Tic-tac-toe A.I. can calculate the best moves using Minimax algorithm. Built in Python using Pygame library.
Chess AI using the minimax algorithm in python.
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."