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 superhuman chess engine written in Java.
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 UCI-compatible chess engine, capable of beating (most) human players.
Quoridor game implementation integrated with a versatile and reusable AI agent for solving two-player board games
A python based chess engine
A gomoku player via Min-Max Search and Alpha-Beta Pruning, running on https://botzone.org.cn/
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
A full MTD(f) implementation. 2x faster than AlphaBeta.
My first chess bot - Bitboard, Alpha-Beta Prunning, Zobrist hashing - ELO 900-1000
AI team project — Domineering board game AI engine — Python • Game state evaluation heuristic • Alpha-beta pruning • Move ordering • Transpositon table • Zobrist hashing
Chess AI game in python using alpha beta pruning
重力四子棋AI(Minimax+α-β剪枝+Bitboard+Zobrist Hash实现/Alphazero自对弈深度学习实现)
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
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."