in reply to find all paths of length n in a graph

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.


No good deed goes unpunished. -- (attributed to) Oscar Wilde
  • Comment on Re: find all paths of length n in a graph

Replies are listed 'Best First'.
Re^2: find all paths of length n in a graph
by ambrus (Abbot) on Jan 10, 2006 at 20:55 UTC

    Big Boggle? I thought it was called Boggle Master.

    Update: wow, so there's even a Boggle Deluxe too.

    Btw, I have a Boggle Master but we don't play it much as it doesn't work very well in Hungarian.

[reply]

      Hmmm. Maybe I show my age. :) That's what it was called back when I was a kid ... Big Boggle

[reply]

In Section Seekers of Perl Wisdom