A UCI-compatible chess engine, capable of beating (most) human players.
Efficient Algortihm for Tic Tac Toe game ai with alpha beta pruning
A gomoku player via Min-Max Search and Alpha-Beta Pruning, running on https://botzone.org.cn/
Uses bitboards for speed and alpha beta to search for best move
a C++ chess engine with support for full chess rules and an AI opponent. It implements move generation, position evaluation, and a minimax search with alpha-beta pruning to choose the best moves. This project is designed to be modular and extensible.
重力四子棋AI（Minimax+α-β剪枝+Bitboard+Zobrist Hash实现/Alphazero自对弈深度学习实现）
ZZT slider puzzle generator
An AI playing Gomoku 15x15 using Negamax algorithm, NegaScout algorithm, Zobrist Hashing, Null Window written in C++
Work in progress chess engine
Chess engine written in C++
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."