Word search solvers
A dictionary arranged as a trie, or prefix tree, can be traversed using the rules of word search games as the basis for efficient solvers. The solution search can be naturally pruned by intersecting the game's adjacency rules with traversal of the trie.