Udacity - Artificial Intelligence - Project 3 (Adversarial Search) - Minimax, Alpha-Beta-Pruning, MCTS, Opening Book - All Files - Passed Mon 20 Aug 2018
-
Updated
Aug 20, 2018 - Python
Udacity - Artificial Intelligence - Project 3 (Adversarial Search) - Minimax, Alpha-Beta-Pruning, MCTS, Opening Book - All Files - Passed Mon 20 Aug 2018
Chess tournament manager, standard C++ 11
Chess Application w/ an AI implemented with a min-max algorithm with alpha-beta pruning and quiescence searching
MCTS/UCT search for chess variants
Java chess AI using Principal Variation Splitting, Piece Square Tables, Opening Book and Tapered Evaluation.
opening books for chess variants in EPD format for engine testing and tuning, generated with https://github.com/ianfab/bookgen. Used for https://github.com/ianfab/fishtest.
A chess engine enhanced with transposition tables, move ordering, null move pruning, aspiration window, alpha-beta pruning, quiescence search, and opening books.
chess variant EPD opening book generation in the browser
A python based chess engine
A chess opening book, done in a Tree data structure
EPD opening book generation and filtering for chess and chess variants
This repository inclues the Samurai framework and all the implemented base engines.
Add a description, image, and links to the opening-book topic page so that developers can more easily learn about it.
To associate your repository with the opening-book topic, visit your repo's landing page and select "manage topics."