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.
AI project done in Unity. Typical game of 4 inline that has an AI that can be switched to different algorithms such as: Minimax, Negamax AB, NegaScout or Aspirational.
An AI playing Gomoku 15x15 using Negamax algorithm, NegaScout algorithm, Zobrist Hashing, Null Window written in C++
Ai Game Engine, used in a competition against other AIs by playing the Tafl Games
Minimalistic chess engine and game with CLI interface written in C++
AI agent to play Yinsh
A graphical simulation written in Python that visualizes the fundamental algorithms of sequential game theory
A multi-algorithm chess game that aims to teach AI concepts through experimentation. Users can select from four algorithms to compete against, as well set the search depth.
Boo's Chess Engine
Experiments with variations of minimax algorithm, MTD(f), MCTS in Gomoku
Add a description, image, and links to the negascout topic page so that developers can more easily learn about it.
To associate your repository with the negascout topic, visit your repo's landing page and select "manage topics."