Quoridor game implementation integrated with a versatile and reusable AI agent for solving two-player board games
-
Updated
Jul 14, 2023 - C#
Quoridor game implementation integrated with a versatile and reusable AI agent for solving two-player board games
♟️ An algorithmic chess engine, written in Python.
A full MTD(f) implementation. 2x faster than AlphaBeta.
Java graph traversal and path finding algorithms library. Implements Iterative deepening A* (IDA*)
A Java chess engine and swing GUI with full rule enforcement, powered by iterative deepening alpha beta search, quiescence evaluation, zobrist hashed transposition tables, and a simple opening book.
DepthFirst, BreadthFirst, IterativeDeepening, A*(Tilles out of place, manhattanDistance, chebyshev)
Search Algorithms Library
A core library to help implement two players games
A self-play game showing how smart cat(s) captures the mice!
Player for generalised Connect Four able to pick each move within a time limit
A hybrid Python/C++ chess engine project focused on building a stronger engine from scratch while progressively moving performance-critical components into native code. The project includes legal move generation, search and evaluation logic, opening-book support, perft-style correctness testing, and a playable Pygame interface.
An MNK-game player that can generally look 2 moves ahead of the current state of the game.
Add a description, image, and links to the iterative-deepening topic page so that developers can more easily learn about it.
To associate your repository with the iterative-deepening topic, visit your repo's landing page and select "manage topics."