News for hackers. Stuff that matters.
Re:A (deceptively tricky?) Python question by what on Wednesday May 05, 2010 @02:02PM (#1321947)
Do you want to just find dictionary words based on board configuration and a bench? Typically they build a Directed Acyclic Word Graph from the dictionary and then you can just traverse the graph.

So for your example, you start at the H node and follow all paths. Then follow the L path if it exists. Then follow the next L path. Then follow all paths from that node. Then check if the word has ended.

There are no comments on this comment yet.