Objective
Implement a deterministic perft-style validation tool for the existing
WinDama reference engine.
Perft recursively counts legal move sequences to a selected depth. It is
primarily a correctness tool, not a speed benchmark.
The stored results will later be used to validate the bitboard move generator
and detect move-generation regressions.
Why this is needed
A move generator can appear correct at depth one while producing incorrect
positions at deeper levels.
Perft validates the complete move tree.
Example:
Depth 0: current position only
Depth 1: number of legal moves
Depth 2: number of legal move/reply sequences
Depth 3: number of legal three-ply sequences
Objective
Implement a deterministic perft-style validation tool for the existing
WinDama reference engine.
Perft recursively counts legal move sequences to a selected depth. It is
primarily a correctness tool, not a speed benchmark.
The stored results will later be used to validate the bitboard move generator
and detect move-generation regressions.
Why this is needed
A move generator can appear correct at depth one while producing incorrect
positions at deeper levels.
Perft validates the complete move tree.
Example: