A simple and intuitive Chess AI in Python.
-
Updated
Jan 13, 2021 - HTML
A simple and intuitive Chess AI in Python.
Exploration of minimax algorithm and heuristics for games such as Tic-Tac-Toe, Checkers, and eventually Chess.
alpha beta search for Ataxx game
A C# implementation of an AI for the Cannon boardgame, with a working GUI and with various game search algorithms.
TicTacToe with AI player on 3x3 and 5x5 boards
This project is a Java implementation of the classic Connect 4 game. It supports two game modes: Player vs Player and Player vs AI.
Gomoku/TicTacToe game implemented with Unity3D
Artificial Intelligence Course - Computer Assignment 2 - University of Tehran - Spring 1401
Group project for the Curricular Unit of "Elements of Artificial Intelligence and Data Science" @ FCUP, Porto with @tomazcomz
play tic tac toe, 2d, 3d, n by n; against yourself, minimax, random
Implemented the Minimax algorithm with Alpha-Beta pruning for an AI player in Connect4
Single Player game of Obstruction playing against AI that either uses Minimax Algorithm with or without Alpha-Beta Pruning to beat you.
Tic-tac-toe game using minimax algorithm with alpha-beta pruning
A game-playing AI agent is developed for a Competitive Sudoku game using minimax algorithm with alpha-beta pruning and iterative deepening. It is further advanced using heuristics and Monte Carlo Tree Search algorithm.
An interactive gomoku (5 in-a-row) AI
A simple Connect 4 game implemented using Python and Tkinter
TicTacToe engine. Computer plays TicTacToe as X, player plays as O
AI-driven board game composed of nine tic-tac-toe boards arranged in a 3 × 3 grid.
TicTacToe AI that utilizes the Minimax Algorithm and the Alpha Beta Pruning Algorithm to reduce Game-Tree searches.
Add a description, image, and links to the minimax-alpha-beta-pruning topic page so that developers can more easily learn about it.
To associate your repository with the minimax-alpha-beta-pruning topic, visit your repo's landing page and select "manage topics."