timvisee/aivd-kerstpuzzel-2021-18-solver — explained in plain English
Analysis updated 2026-07-17 · repo last pushed 2022-01-21
Solve the AIVD 2021 Christmas puzzle number 18 automatically.
See how a chess engine verifies mate-in-two sequences for a board.
Learn how to combine constraint search with Stockfish for chess puzzles.
Explore all valid piece placements satisfying row and column sum rules.
| timvisee/aivd-kerstpuzzel-2021-18-solver | codeitlikemiley/antigravity-sdk-rust | dedsec-xu/needle | |
|---|---|---|---|
| Stars | 3 | 3 | 3 |
| Language | Rust | Rust | Rust |
| Last pushed | 2022-01-21 | — | — |
| Maintenance | Dormant | — | — |
| Setup difficulty | moderate | hard | moderate |
| Complexity | 2/5 | 4/5 | 3/5 |
| Audience | developer | developer | developer |
Figures from each repo's GitHub metadata at analysis time.
Requires Rust and Stockfish installed locally, run takes about a minute.
A Rust program using the Stockfish chess engine to solve a 2021 Dutch intelligence agency Christmas puzzle involving missing chess pieces and mate-in-two.
Mainly Rust. The stack also includes Rust, Stockfish.
Dormant — no commits in 2+ years (last push 2022-01-21).
Setup difficulty is rated moderate, with roughly 30min to a first successful run.
Mainly developer.
This repo across BitVibe Labs
Verify against the repo before relying on details.