Smallest size for storing a puzzle

gsf · Posted: Wed Nov 18, 2009 6:24 pm Post subject:

construct a deterministic pseudo-random generator that is seeded by N bits
small 1000 puz/sec generators are available
assume a sudoku explainer rating

offline precompute the 2^N puzzles corresponding to seeds 0 through 2^N-1
compute the sudoku explainer rating
then generate a table of bytes with 2^N entries
where table[i] is the sudoku explainer rating for the puzzle with seed i

so a table of size 2^N bytes and the small generator is all you need to have a collection of 2^N sudoku-explainer rated puzzles

lkSudoku · Posted: Wed Nov 18, 2009 6:48 pm Post subject:

This approach is possible and will lead to correct puzzles

My current approach for generating puzzles is to use the grading algorithm while constructing the puzzles, thus increasing the chance for finding less common difficulty levels

But I suppose that if storage size is of high importance, I can change the algorithm to first generate the entire puzzle and only then grade it; this will decrease the chance of finding rare difficulties but once found, the generation time will be quick