A simple chess game for comparing your moves with other chess engines
-
Updated
Sep 3, 2020 - Python
A simple chess game for comparing your moves with other chess engines
A generic JAVA implementation of the Minimax algorithm (and derivated...)
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.
AI for Playing Russian Checkers (aka "Shashki")
This repository contains Tic-Tac-Toe game that offers two options: 1) Human Vs Human 2) Human Vs Computer. The computer player uses the Minimax and Negamax algorithms to make its moves.
gomoku @ 42 - gomoku AI using negamax written in Rust / 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).
Artificial Intelligence final project. implementing negamax.
A chess AI (currently in development) made in Python and GUI provided by Pygame.
Gravy - A C# Chess Engine
AI | MI | mesterséges inteligencia
This Game is made up from scratch . This is 1 Player and 2 Player Game . The AI for this Game is made by NegMax algo.
Bengal - A traditional chess engine written in python, play me on Lichess!
Implementation of connect four game using Javascript, Python and basic of AI
This is a mini chess game developed using the Next.js framework, where you can play against an AI opponent. It is a simple but fun game that can be enjoyed by players of all ages.
Porjects for Algorithmic Techniques for Artificial Intelligence
Artificial Intelligence final project. implementing negamax.
Python compiled with Numba (from 7300 to 1500000 nodes/second)
Add a description, image, and links to the negamax-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the negamax-algorithm topic, visit your repo's landing page and select "manage topics."