Yes, that is why I have set the sort order 0 1 2 4 3 and have said that the frequency of earlier markers is of prime importance.
No, wait. I think the order should be 0 1 4 3 2. So change the original problem statement. Anyhow, does that address your comment, Raul? Thanks, too. On Fri, Feb 12, 2010 at 3:58 PM, Raul Miller <[email protected]> wrote: > On Fri, Feb 12, 2010 at 3:48 PM, Brian Schott <[email protected]>wrote: > >> The Einstein puzzle solver I have been developing >> works dramatically faster if the clues are provided in >> certain orders. I am not sure if there is an ideal order, >> but I have developed a heurisic for ordering the clues, >> which typically number in the twenties (ie, there are about >> 24 clues in a typical puzzle). On the chance that some folks >> might enjoy the challenge of coding such a heuristic, or of >> suggesting an approach, I am posting this description. I >> have no solution myself, but I am optimistic about the >> heuristic. >> > > In general, for good performance, you want to > use first rules which eliminate the most possibilities. > > I do not know if that helps in this case. > > -- > Raul -- (B=) ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
