Here are
24 public repositories
matching this topic...
A JIT compiled chess engine which traverses the search tree in batches in a best-first manner, allowing for neural network batching, asynchronous GPU use, and vectorized CPU computations.
Updated
Mar 12, 2022
Python
A generic JAVA implementation of the Minimax algorithm (and derivated...)
Updated
Jan 12, 2018
Java
A simple chess game for comparing your moves with other chess engines
Updated
Sep 3, 2020
Python
negamax AI algorithm for turn-based games
Python compiled with Numba (from 7300 to 1500000 nodes/second)
Updated
Oct 10, 2021
Python
AI for Playing Russian Checkers (aka "Shashki")
3D chess game playable in a PvP or PvE mode. Implemented decent AI player for amateur gameplay. Developed a bug free chess engine. Implemented in C#, Unity Engine.
A chess engine developed using pygame for GUI and using negamax algorithm for AI
Updated
Oct 28, 2021
Python
gomoku @ 42 - gomoku AI using negamax written in Rust / JavaScript
Updated
Apr 21, 2019
Rust
Jeu d'infection et implémentation d'algorithmes d'intelligence artificielle
Updated
May 15, 2020
Python
Implementation of connect four game using Javascript, Python and basic of AI
Updated
Jul 6, 2019
JavaScript
Creating a game (Othello) and its AI based on heuristic search algorithms (Alpha-Beta-prunning and NegaMax) using Processing (Java library and a free development environment).
Updated
Nov 22, 2018
Processing
Artificial Intelligence final project. implementing negamax.
Updated
Jan 29, 2022
Python
gomoku AI via negamax search, implementing in C language
This game is inspired by Eddie Sharwick's chess series. Added in UI features and made it Star Wars themed :)
Updated
May 12, 2022
Python
AI | MI | mesterséges inteligencia
Othello is a strategy board game created in 1971 based on Reversi game. This game is an ai-ai battle only (alphabeta or negamax algorithm)
Updated
Jul 22, 2021
Java
Tic-tac-toe / Naughts and crosses in c++ with negamax + alpha beta pruning
AI playing the Unstable (Chain Reaction) game.
Basic AI engine written in C# that implements the alpha–beta pruning algorithm to create two-player, zero-sum games like Tic Tac Toe or Connect 4.
Implementation of the Negamax algorithm with Alpha-Beta Pruning and Iterative Deepening.
Updated
Jun 24, 2021
Jupyter Notebook
A simple artificial intelligence board game demonstrating negamax and various heuristics for the game isolation
Updated
Jun 20, 2018
Python
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
Improve this page
Add a description, image, and links to the
negamax-algorithm
topic page so that developers can more easily learn about it.
Curate this topic
Add this topic to your repo
To associate your repository with the
negamax-algorithm
topic, visit your repo's landing page and select "manage topics."
Learn more
You can’t perform that action at this time.
You signed in with another tab or window. Reload to refresh your session.
You signed out in another tab or window. Reload to refresh your session.