How it works
A UCI chess engine in portable C11. The full technical description of Vizier — what it does, what it is made of, and what state it is in.
The premise
Vizier is the engine that ships with ChessViz, but it speaks standard UCI over stdin and stdout, so any UCI interface can drive it.
The core is bitboard-based with magic-bitboard sliding attacks and Zobrist hashing. Move generation is fully legal and verified against known perft node counts. Search is iterative-deepening principal variation search with a transposition table, quiescence, null-move pruning, late-move reductions and killer/history ordering.
What is included
Magic-bitboard move generation verified against published perft counts
Iterative deepening PVS with transposition table and quiescence search
Null-move pruning, late-move reductions, killer and history heuristics
Portable C11 — builds and runs anywhere, driven by any UCI GUI
How it is built
Vizier is built on C11, Bitboards and UCI.
It is maintained in a private repository; its history is not published.
The method behind it
Every project here starts as a written specification, and the specification stays authoritative once code exists. The repository keeps a build plan with live status, an append-only decision log recording where the implementation departed from the plan, and a handoff document describing the true current state — including the parts that are not finished.
That is why a portfolio this wide is not a shallow one, and it is why this page can describe the product without overstating it.
Current state
In development. Under active work right now.
The source is private. What this page claims is checkable against the product itself, not the repository.
Next
Get Vizier
Ask about availability, a build for your platform, or a licence.