A .NET Othello game.
-
Updated
Jan 10, 2022 - C#
A .NET Othello game.
Project using minmax and alpha beta pruning to make ai for tictactoe and connect4 with gui using pygame
An implementation of AI player for Gomoku.
This is a project that plays a professor's version of SuperTicTacToe against you (or other robots) and should win every time (it does not). It uses a minmax algorithm with alpha beta pruning.
AI player of the game 2048 (expectiminimax + alpha-beta pruning + iterative deepening search)
AI project bagh-chal game implemented using min-max algorithm
Alpha Beta algorithm implementation for ConnectFour game.
The game "Three in a row" with a GUI and an unbeatable engine.
Minimax, Alpha-beta Pruning, Expectimax를 활용한 Multi-Agent 구현
Connect Four game for Android with optional AI opponent
Connect 4 game against AI agent using MinMax algrorithm and pyqt5 GUI framework
Final project for the course Computational Intelligence of Politecnico of Turin (2022/23)
A simple Chess game powered by MinMax Algorithm
Android Tic Tac Toe sample App with simple user interactions.
Add a description, image, and links to the minmax-alpha-beta-pruning topic page so that developers can more easily learn about it.
To associate your repository with the minmax-alpha-beta-pruning topic, visit your repo's landing page and select "manage topics."