C# chess library containing a complete data structure and move generation.
-
Updated
Jun 29, 2024 - C#
C# chess library containing a complete data structure and move generation.
A terminal implementation of the game Quoridor with an engine
Zero + is a Gomoku AI that implements threat space search, minimax with alpha beta pruning optimized with Zobrist and linear sequence cache, Principal Variation Search, and Monte Carlo Tree Search.
A chess engine written in Java.
A UCI-compatible chess engine, capable of beating (most) human players.
Quoridor game implementation packed with a generalized and fully reusable 2-player board game solver AI agent
A python based chess engine
Efficient Algortihm for Tic Tac Toe game ai with alpha beta pruning
A chess AI built using minimax, alpha-beta-pruning, and Zobrist hashing algorithms
My first chess bot - Bitboard, Alpha-Beta Prunning, Zobrist hashing - ELO 900-1000
A full MTD(f) implementation. 2x faster than AlphaBeta.
AI team project — Domineering board game AI engine — Python • Game state evaluation heuristic • Alpha-beta pruning • Move ordering • Transpositon table • Zobrist hashing
An intelligent agent that plays the board game Go.
ZZT slider puzzle generator
CS 175 Checkers AI Project
An AI bot that can play the game of Extreme Tic Tac Toe, a harder version of the classic game of Tic Tac Toe
Uses bitboards for speed and alpha beta to search for best move
An AI playing Gomoku 15x15 using Negamax algorithm, NegaScout algorithm, Zobrist Hashing, Null Window written in C++
A python implementation of chess game Gothello
Add a description, image, and links to the zobrist-hashing topic page so that developers can more easily learn about it.
To associate your repository with the zobrist-hashing topic, visit your repo's landing page and select "manage topics."