Project Work for AI
-
Updated
Nov 27, 2016 - Python
Project Work for AI
AI bot implementation for 4x4x4x4 ultimate tic-tac-toe game
TicTacToe Judge And AI bot that uses Minimax algorithm with alpha-beta pruning
A single player tic-tac-toe game.
A solver for 2048 game using Minimax
2048 puzzle using minimax algorithm
An Artificial Intelligence that beats human opponents in the game of Isolation in Python
A simple Python AI program with GUI that plays 4-in-a-row (or Connect 4).
Game-Playing Agent
2048 player implementation
Automatic Pacman Game using AI algorithms, major code in multiAgents.py
Minimax algorithm with alpha-beta pruning and iterative deepening
Isolation Game Playing Agent, submission for the Udacity Artificial Intelligence Nanodegree program
In this project, agents are designed for the classic version of Pacman, including ghosts. Mini-max, Alpha-Beta pruning, Expectimax techniques were used to implement multi-agent pacman adversarial search.
Mini-max, Alpha-Beta pruning, Expectimax techniques are used to implement multi-agent pacman adversarial search.
Simplified version of Chess to recommend next move for the input board using Minimax Game Search Algorithm with Alpha-Beta Pruning
The objective of this AI game is to collect as many as fruits
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."