Main article here. This page only explains how to use.
You must be on a modern brower for this page to function. Anything after 2018 should be fine.
For each puzzle, the program generates a random integer between Minimum removes and Maximum Removes and attempts to remove that amount of cells until there is no unique solution given the randomly generated puzzle.
The program is not optimized for speed but for maxium information entropy (randomness). Each puzzle takes an average 0.1 seconds to generate and up to 1 second for difficult puzzles and 5 second for outliers. Most puzzles takes less than 0.01 seconds (median).
The randomness comes from an internal PRNG on the WASM side, but is seeded with Math.random
The generated puzzles are designed to be printed. One puzzle or solution per page. "removed" means attempted removes. "checker calls" means the number of checks needed for the computer program to solve the puzzle, it is a rough gauge of difficulty.
Written my Hsing. Enjoy.
Number of puzzles
Minimum removes
Maximum removes
INITIAL CONDITION. IF THIS MESSAGE DISPLAYS FOR MORE THAN A FEW SECONDS, YOUR BROWSER MAY NOT SUPPORT WEBASSEMBLY.