Java chess AI using Principal Variation Splitting, Piece Square Tables, Opening Book and Tapered Evaluation.
This homework is about Implementing a smart agent to play Quoridor, using Min-max, a heuristic function, Transposition Table and forward pruning. This homework is a part of many projects in a Fundamentals to AI course @ FUM.
A Negamaxing Chess program in Java
Connect Four game for Android with optional AI opponent
Fully functional chess engine built from the ground-up with LibGDX
Project for the University of Bologna Algorithms and Data Structures course (a.y. 2020-21).
Chess engine to play against.
CS 175 Checkers AI Project
Software for the Tablut Students Competition for the Fundamentals of AI course in the masters degree in AI of the University of Bologna. The algorithm uses a heuristic-based search of the state space using the minimax algorithm with alpha-beta cuts and a transposition table.
MNK-game engine (generalized tic-tac-toe board game) and Player AI based on an improved Alpha-Beta pruning search algorithm with threat detection heuristic which runs in O(√(n!)*log(N+M)) time on average case
Add a description, image, and links to the transposition-table topic page so that developers can more easily learn about it.
To associate your repository with the transposition-table topic, visit your repo's landing page and select "manage topics."