Sudoku Solver & Engine in Rust

Overview

A high-speed Sudoku engine and solving utility developed in Rust. Designed to demonstrate deterministic constraint satisfaction algorithms, zero-cost abstractions, and memory-safe systems programming.

Algorithmic Architecture

• Bitmask Grid Representation: Represents candidate numbers using 16-bit integer bitmasks, enabling simultaneous elimination operations in single CPU clock cycles.
• Constraint Propagation: Applies naked singles and hidden pairs logic before falling back to search trees, solving 95%+ of puzzles without recursive branching.
• Zero Allocation Solver: Eliminates heap allocations during search operations for predictable microsecond execution latency.

Source Code & Verification