Irregular Sudoku Solver

A Sudoku solver that solves Sudoku of any shapes

Sudoku nowadays not only come in the shape of typical 9*9 grids, lots of variants have emerged over the years. And normal Sudoku solvers are not designed for these problems. Irregular Sudoku solver is a solver that aims to solve Sudoku's with the grids in any arbitrary shapes!

Exmples of such Sudokus can be found here:

Get Started with Examples

Compile the program using command

g++ -std=c++14 -o solver IrregularSudoku.cc example.cpp

Run the compiled program with provided test files

./solver --silent < tests/test7.txt

Program in Action

Solve 6 * 6

Solve 7 * 7

Solve 9 * 9

Performance

Benchmarked on MacBook Air 2014 with 1.4 GHz Intel i5 processor, 8 GB RAM

Below is an average over 20 runs of each puzzle

 __________________________
| 6 * 6  |  0.0001865 sec  |
|________|_________________|
| 7 * 7  |  0.0001777 sec  |
|________|_________________|
| 9 * 9  |  0.0489505 sec  |
|________|_________________|

Note: The shorter runtime of the 7*7 puzzle in this case is not representative. As the puzzle itself can have varying level of diffuclties.

Board Construction Manual

By default, the program provides hints on what to be entered next. The hints can be silenced with "--silent" flag Example inputs can be found in the /tests folder

Enter the size of the Sudoku, n. n can be any integer greater than 0. Numbers greater than 15 can lead to relatively long runtime.
Divide your board into n regions. And denote them as region 0to region n - 1. For each region, denote each cell within the region from cell 0 to cell n - 1. So, now each cell on the board can be expressed as a binary tuple (region, cell)
Enter already filled in numbers into the board, in the format of region cell number for each number. number should be restricted to 1 to n. For example, the 2 in the left up corner should be entered as 0 1 2, since it is within region 1, cell 2 and has a number 2 inside.
When all the filled numbers are entered. Enter -1.
Finally, enter the layout of the board row by row, so our program knows which cells belong to this row. For each row, we expect n pairs of tuple in the format of region cell.

0 0  0 1  1 0  1 1  1 2  2 0  2 1
0 2  0 3  1 3  1 4  1 5  2 2  2 3
0 4  0 5  0 6  3 0  1 6  2 4  2 5
4 0  3 1  3 2  3 3  3 4  3 5  2 6
4 1  4 2  5 0  3 6  6 0  6 1  6 2
4 3  4 4  5 1  5 2  5 3  6 3  6 4
4 5  4 6  5 4  5 5  5 6  6 5  6 6

Note: The order of how regions or cells are numbered do not matter, as long as it makes sense to you. This structure is complex but ensures that sudoku in any shapes can be supported. The regions don't even need to be connected.

Test Files

5 test files are provided and include sudoku of size 1, 2, 6, 7, 9 The irregular sudoku of size 6, 7, 9 are credit to Lamonica.info

Major TODOs

Decouple board and solver into separate classes
Optimize solver strategy
Provide better user interface

tangsaidi/irregular-sudoku-solver