There are 0 repository under minimax-search topic.
Implemented with a simple min-max tree of two depth
Artificial Intelligence for the game Go-Moku using the Minimax Algorithm with Alpha-Beta Pruning
:video_game: 使用α-β剪枝(Alpha-beta-pruning)的极小极大算法(Minimax-algorithm)实现的井字棋(一字棋、tic-tac-toe)游戏。
Minmax (minimax) algorithm with Alpha-Beta (𝛼−𝛽, ab) Pruning optimization for the Checkers (Draughts) game in Python 3. Same minimax algorithm works for chess, tic tac toe or similar games.
A board game framework, focused not on graphics or user interfaces, but on artificial players design, implementation and testing.
Halma game with an AI player, move validation, and dynamic board sizing
Othello/Reversi AI - minimax search with alpha beta pruning
Zero + is a Gomoku AI that implements threat space search, minimax with alpha beta pruning optimized with Zobrist and linear sequence cache, Principal Variation Search, and Monte Carlo Tree Search.
A c++ program to play tic-tac-toe with minimax tree. Try to beat and it ;-)
An advanced AI to play the 2-player board game Othello
🥇 Unbeatable Tic Tac Toe game with a README contains very thing about MiniMax algorithms with explanation of it with c++ and js Implementation code
minimax algorithm for chess with alpha-beta pruning
Tic-Tac-Toe game written in Python and using pyGame; you can play versus another player or the computer on 2 difficulties: normal (random choices) and hard (minimax algorithm)
An AI for a modified Reversi version. The AI works with a game server that manages the game (https://github.com/marcluque/Reversi-Server)
Chess AI using neural networks to predict move value
Lichess BOT engine
Game of isolation done as part of the Nanodegree program from Udacity
AI bot for the 2-player board game "Game of the Amazons"
A simple AI for TicTacToe with Alpha-Beta pruning and binary encoding for the board
Collection of AI algorithms to solve/optimize 2048 games.
Implementations of artificial intelligence agents that plays Pac-Man
Othello game framework made with JavaFX which can be use for testing Othello AI Agents.
minimax algorithm implementation for tic tac toe
Isolation, AI game implemented in Javascript and React, using MiniMax with Alpha Beta Pruning.
Developed a chess game agent using Minimax Algorithm in Python Language
Implementation of reinforcement learning algorithms to solve pacman game. Part of CS188 AI course from UC Berkeley.
Generalization of Tic-Tac-Toe game and a solver based on the Minimax Algorithm and Alpha-Beta pruning.
Unbeatable Noughts And Crosses AI
A chess game implemented using Django and the minimax algorithm
TicTacToe is a mini project developed to implement MiniMax and MiniMax with alpha-beta pruning to decide wich action the computer has to perform.
This is an assignment I completed as an undergraduate student in a team of 2 members.
A game of knight's Isolation between two AIs, to test minimax alpha-beta search and Monte Carlo tree search
:ghost: :video_game: This is my implementation in the famous Berkeley pacman artificial intelligence project: http://ai.berkeley.edu/project_overview.html.