NAGSNeuro-Adaptive Graph Search
A chess engine that changes how it searches as the position changes.
Classical search meets graph neural networks. An adaptive controller chooses where to spend its next move.
perft depth 6Read report ↗
One move. Checkmate. Can you see it?
Inspect the machinery
C++17 bitboards and transposition tables handle the search. A Python service supplies graph-network evaluations, while a bandit controller chooses between alpha-beta and MCTS. The reported 3.82M figure measures move generation, not playing strength. Next question: how much does the hybrid controller improve play at a fixed time budget?
Public research implementation. The position above is a small handcrafted puzzle, not a live instance of the engine.