AI team project — Domineering board game AI engine — Python • Game state evaluation heuristic • Alpha-beta pruning • Move ordering • Transpositon table • Zobrist hashing
-
Updated
Jan 24, 2023 - Python
AI team project — Domineering board game AI engine — Python • Game state evaluation heuristic • Alpha-beta pruning • Move ordering • Transpositon table • Zobrist hashing
Efficient Algortihm for Tic Tac Toe game ai with alpha beta pruning
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
My first chess bot - Bitboard, Alpha-Beta Prunning, Zobrist hashing - ELO 900-1000
An AI playing Gomoku 15x15 using Negamax algorithm, NegaScout algorithm, Zobrist Hashing, Null Window written in C++
A python implementation of chess game Gothello
A full MTD(f) implementation. 2x faster than AlphaBeta.
A C# implementation of an AI for the Cannon boardgame, with a working GUI and with various game search algorithms.
"Gomoku AI Web App" - A project to create a JavaScript - based Gomoku web application with an advanced AI opponent and a user-friendly interface.
Work in progress chess engine
Quoridor game implementation packed with a generalized and fully reusable 2-player board game solver AI agent
A UCI-compatible chess engine, capable of beating (most) human players.
A python based chess engine
A chess engine written in Java.
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.
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."