sudoku-exchange-puzzle-bank VS tdoku

Not quite infinite :) The puzzles are selected at random from the puzzle bank which currently contains 894,001 puzzles of different difficulty levels.

You can find thousands more puzzle strings in the Sudoku Exchange puzzle bank.

All credit for the 4,000 seed puzzles I use in my app goes to u/grantm who generously open-sourced hundreds of thousands of puzzles grouped by difficulty here.

And lastly, the puzzle is originally from u/grantm, who generated tons of puzzles for his website/app and published them for anyone to use here. I'm still grateful for his contribution to the community. I got this one randomly by starting a "Diabolical" game. They usually take me anywhere from 15 minutes to 1.5 hours, so I find a big variety of difficulty within "diabolical". This one was especially long at 2 hours.

u/grantm published millions of puzzles here. They are in the "puzzle string" format, e.g. 050703060007000800000816000000030000005000100730040086906000204840572093000409000, so you'll need to run a simple conversion to replace 0 with . and insert / between every 9 characters. But if you can write a solver, I bet you can manager that too :)

There's a collection of ranked, machine-generated puzzles in the Sudoku Exchange Puzzle Bank. They are in the public domain.

How about a repo of several hundred thousand? https://github.com/grantm/sudoku-exchange-puzzle-bank

a) the curated list of 893,916 puzzles, which makes up the Sudoku Exchange "Puzzle Bank" and can be downloaded from: https://github.com/grantm/sudoku-exchange-puzzle-bank; or

For a casual effort this solver is quite fast. On most datasets it's significantly faster than a C++ port of the Norvig solver and it's often in the same league as well-tuned DLX solvers (though still not in the major league).

Relative to DLX it's faster on the easiest puzzles and slower on hard ones, though its performance degrades significantly in two specific still-easy cases: (1) 17-clue puzzles since these punish solvers that don't propagate hidden singles, (2) 0-solution puzzles since the solver doesn't check for consistency during initialization (something the author acknowledges in a comment).

For context see these benchmarks from a modern laptop (https://github.com/t-dillon/tdoku/blob/master/benchmarks/res...) and compare lhl_sudoku to the other simple solvers tdev_basic_heuristic, zerodoku, fast_solv_9r2, kudoku, and norvig.

For details on the solvers and datasets used in these benchmarks see here (https://github.com/t-dillon/tdoku/tree/master/other) and here (https://github.com/t-dillon/tdoku/tree/master/benchmarks)

https://github.com/t-dillon/tdoku (click VIEW CODE and download data zip for sudoku puzzles)