Browse Code
A high-performance C++ Sudoku solver implementing Knuth's Dancing Links (DLX) algorithm — one of the fastest exact cover algorithms in the world.
Features
- Dancing Links (DLX) Algorithm: Implements Donald Knuth's Algorithm X with Dancing Links, renowned as one of the most efficient algorithms for solving exact cover problems
- Blazing Fast: Solves even the hardest Sudoku puzzles in microseconds
- Multiple Solutions: Can find all possible solutions or limit the search to a specified number
- Optimized Search: Uses column selection heuristic (minimum size) for improved performance
- Any Grid Size: Supports puzzles of any size — 4×4, 9×9, 16×16, 25×25, and beyond (size must be a perfect square)
- Runtime Configuration: Grid size is configurable at runtime, not compile-time
- Any Difficulty: Solves puzzles of any complexity, from simple to world's hardest
- C++11 Standard: Written in modern C++ with smart pointers and RAII principles
- Exception Safe: Proper input validation with descriptive error messages
- Input Validation: Validates puzzle dimensions and grid size constraints
License
MIT LicenseFollow Sudoku DLX Solver
Other Useful Business Software
Build on Google Cloud with $300 in Free Credit
Start your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query exabytes in BigQuery, or build AI apps with Vertex AI and Gemini. Once your credits are used, keep building with 20+ products with free monthly usage, including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. Sign up to start building right away.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Sudoku DLX Solver!
