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
Go from Data Warehouse to Data and AI platform with BigQuery
BigQuery is more than a data warehouse—it's an autonomous data-to-AI platform. Use familiar SQL to train ML models, run time-series forecasts, and generate AI-powered insights with native Gemini integration. Built-in agents handle data engineering and data science workflows automatically. Get $300 in free credit, query 1 TB, and store 10 GB free monthly.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Sudoku DLX Solver!
