Various C# implementations of game AI
-
Updated
Aug 21, 2020 - C#
Various C# implementations of game AI
Minimax algorithm used as the AI for a tic tac toe game built with unity using c# as scripting language
Fully functional checkers game VS AI (MiniMax, Alpha Beta pruning)
Artificial Intelligence with Minimax algorithm in Santorini board game in Unity (C#)
Basic AI engine written in C# that implements the alpha–beta pruning algorithm to create two-player, zero-sum games like Tic Tac Toe, Connect 4, or Chess.
Quoridor game implementation integrated with a versatile and reusable AI agent for solving two-player board games
Russian checkers on C# with mini-max and alpha-beta pruning
Prototype for a new board game
Tic Tac Toe in C# with minimax and alpha-beta-pruning -- compact storage of the board as ints and vectorized where possible
AI competition for IEEE CoG 2021
Play classic Connect4 against a CPU in three different difficulties (Easy, Medium, Hard). (MacOS only)
🕹️ 🎮 TicTacToe with Minimax AI algorithm (C#). The game has the option of 'Multiplayer' in 'Singleplayer' against the computer.
Collection of projects done as a part of my studies at University of Moratuwa
Showcases various game decision-making algorithms (Minimax, Negascout, Negamax, Monte Carlo, Aspiration Window) allowing observation of how different AIs compete against each other, with the option to play against the AIs as well.
A Tic-Tac-Toe game against AI.
Add a description, image, and links to the minimax topic page so that developers can more easily learn about it.
To associate your repository with the minimax topic, visit your repo's landing page and select "manage topics."