When inputting an ambiguous Sudoku (simplest example: empty 9x9 grid with default constraint), the StrategicBacktrackingSolver (and perhaps the BacktrackingSolver, still untested) requires a large amount of time to terminate (no upper bound found yet).
When inputting an ambiguous Sudoku (simplest example: empty 9x9 grid with default constraint), the StrategicBacktrackingSolver (and perhaps the BacktrackingSolver, still untested) requires a large amount of time to terminate (no upper bound found yet).