wchargin

5 ms·

1. 1.▲
   by wchargin 2y ago

   Hmm… consider the following. Your FSM is acyclic iff you can assign each state an integer depth such that a state at depth d only ever transitions to states at depths strictly greater than d . So consider the following tables: CR
2. 2.▲
   by wchargin 3y ago

   Nice work! I had a similar idea and also wrote a little solver in Rust [1]. I chose the same benchmark puzzle as is in your code, and it solves in ~25 microseconds on my laptop (i7-1165G7). I haven't optimized my approach at all or eve
3. 3.▲
   by wchargin 7y ago

   Hey, I wrote one of these, too! Mine generates and solves all possible puzzles (with my dictionary, there are 54733) in about 1.8 seconds on my six-year-old laptop, and can also typeset them to LaTeX+TikZ to make printable puzzle sheets. Th