4 ms·
Agreed, good call. Another possible optimisation might be to order the generated next-moves, so that the 'better' options are returned earlier in the list. Alt
by jimsmart 8y ago
Agreed, good call.
Another possible optimisation might be to order the generated next-moves, so that the 'better' options are returned earlier in the list. Although I'm not sure what 'better' here means, exactly. But, through experimentation, one may find that visiting boards with more available options first, or vice versa(?), could produce a quicker route to the goal?
(Making it an 'informed' search, a kind of greedy/best-first depth-first search)
- taeric 8y agoI posted it top-level, but I'll post here, as well. Look into Knuth's discussion of Exact Cover problems. He has a very elegant algorithm for this style of problem that, I believe, is quite hard to beat. (Would love for someone to prove me wrong.)