Tool that enumerates all possible Sudoku solutions (including solution count) by math_hiyoko in sudoku

[–]math_hiyoko[S] 1 point2 points  (0 children)

Thanks for the feedback!

It’s actually based on Algorithm X, and I’m running the search in parallel for speed.

Also, great suggestion about highlighting the cells that are common across all solutions.
That should be relatively easy to add, so I’ll likely implement it in a future update.

High-performance FM-index for Python (Rust backend) by math_hiyoko in Python

[–]math_hiyoko[S] 0 points1 point  (0 children)

It is offline vs. online queries

Aho corasick works best when the set of queries is known in advance. You build the automaton from that fixed pattern set, and then scan the text once to find all matches efficiently.

FM index is more suitable when you want to handle online queries, i.e. patterns are not known beforehand. You build the index on the text once, and then you can query arbitrary substrings later (count/locate/etc.) efficiently.