Building a Boggle solver: DFS meets trie, naive recursion pitfalls

The fact

Naive recursion causes exponential explosion of function calls and drastically slows the program on standard grids.

The optimized approach significantly reduces complexity and makes the solver practical for real games.