This is a nice follow-up to your previous post, especially because DepthFirstSearch doesn't lead to a timely solution. However, it's well-known that Sudoku is a good use case for Donald Knuth's DancingLinksX algorithm, so it's also possible to compare times with FindExactCover. Using the MRV-heuristic, we can achieve a $2\times$ speed-up solving the puzzle as an exact cover problem. There is a deb
![Solving Sudoku puzzles with Graph Theory - Online Technical Discussion Groups—Wolfram Community](https://cdn-ak-scissors.b.st-hatena.com/image/square/45b192abdadf3140a82828dc7b3aa8405eb2fead/height=288;version=1;width=512/http%3A%2F%2Fcommunity.wolfram.com%2Fshare.png)