Not to take away your fun on what looks like an interesting programming problem, you might also look at Bookworm by PopCap software. I've enjoyed it immensely -- good value for $20.
Update: And of course, there is always Big Boggle, which uses a 5 x 5 grid -- makes the problem a little more interesting.
In reply to Re: find all paths of length n in a graph
by ptum
in thread find all paths of length n in a graph
by davidj
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |