A Python implementation and visualization of various pathfinding and graph search algorithms.
-
Updated
Mar 3, 2024 - Python
A Python implementation and visualization of various pathfinding and graph search algorithms.
An experimental UCI-compatible chess engine designed to explore Modern B* and custom DCP/DCPS search algorithms. At its core, it combines classical B*, PUCT, and various evaluation and policy networks.
BFS, Dijkstra, Best First Search, A*
Add a description, image, and links to the b-star topic page so that developers can more easily learn about it.
To associate your repository with the b-star topic, visit your repo's landing page and select "manage topics."