![]() |
|
No such thing as a small change | |
PerlMonks |
Re(3): Puzzle: need a more general algorithmby FoxtrotUniform (Prior) |
on Jul 08, 2002 at 23:42 UTC ( #180351=note: print w/replies, xml ) | Need Help?? |
That's what backtracking's for. :-) Actually, that brings up an interesting question: Ovid, are there any bounds on how optimal the answer has to be? Exactly optimal (sucky if this problem turns out to be NP-Hard)? Within a constant factor of optimal (like, max length no more than 1.5x larger than optimal)? --
In Section
Seekers of Perl Wisdom
|
|