Skip to main content
Mathematica

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

3
  • $\begingroup$ I expressed my general opinion on the applicability of Mathematica Graph - related functionality to this prolem at the bottom of my post - please see the edit. $\endgroup$ Commented May 10, 2012 at 11:02
  • $\begingroup$ I fully agree with leonid's assessment of using built-in graph functions for this problem. In fact, those were very much the same reasons for which I chose the method I did — you need a custom graph traversing function which doesn't fit exactly into breadth/depth first traversing logic or the shortest path/tour. $\endgroup$ Commented May 10, 2012 at 17:32
  • 1
    $\begingroup$ Of course, once you have this, you can run interesting experiments like generating a few thousand random boggle boards and figuring out the probability of various word lengths, or what the most productive starting letter is. $\endgroup$ Commented Jun 1, 2012 at 14:33