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
PRTG Catches Network Issues Before They Cause Downtime
Reactive troubleshooting usually means hearing about a problem from frustrated users, not your monitoring tool. PRTG sets threshold-based alerts across devices, servers and applications, notifying your team by email, SMS or push the moment a metric crosses a set limit. That means catching a failing disk or overloaded server before it becomes an outage and getting time back from firefighting. Start a free trial and set your first alerts today.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Sudoku DLX Solver!
