negascout
Here are 15 public repositories matching this topic...
A graphical simulation written in Python that visualizes the fundamental algorithms of sequential game theory
-
Updated
Sep 25, 2025 - Python
Ai Game Engine, used in a competition against other AIs by playing the Tafl Games
-
Updated
Apr 14, 2025 - C++
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.
-
Updated
Jan 26, 2025 - C#
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.
-
Updated
Oct 18, 2024 - C#
Experiments with variations of minimax algorithm, MTD(f), MCTS in Gomoku
-
Updated
Feb 28, 2023 - JavaScript
An AI playing Gomoku 15x15 using Negamax algorithm, NegaScout algorithm, Zobrist Hashing, Null Window written in C++
-
Updated
Jan 4, 2023 - C++
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.
-
Updated
Nov 15, 2021 - Python
Minimalistic chess engine and game with CLI interface written in C++
-
Updated
May 29, 2021 - C++
Boo's Chess Engine
-
Updated
Aug 27, 2019 - C
AI agent to play Yinsh
-
Updated
Nov 8, 2018 - C++
Improve this page
Add a description, image, and links to the negascout topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the negascout topic, visit your repo's landing page and select "manage topics."