[Google] Boggle Solver (Search Words From Matrix) - Woodstock Blog
The best solution is to use Trie, then do DFS search. However it might not be as intuitive as it seems.
The idea is from this answer (However this guy admits that his solution does not handle 'visited' nodes properly, means the same char might be visited again to produce a word).
Read full article from [Google] Boggle Solver (Search Words From Matrix) - Woodstock Blog
No comments:
Post a Comment