laziness, impatience, and hubris  
PerlMonks 
Re^2: Best possible counts for a few test cases (in readmore) (Hanoi Challenge)by tye (Sage) 
on Oct 22, 2004 at 20:18 UTC ( #401670=note: print w/replies, xml )  Need Help?? 
It can be done more efficiently than this. You shouldn't divide the work up evenly. Below are some special cases and the smallest solution sizes possible (I believe) for them. If P is the number of pegs, D is the number of disks, and M is the minimum number of moves for which a solution exists, then:
So I can beat your 35move solution for the 5P10D case by 4 moves. I may write up why this is so, but I suspect someone else is likely to beat me to that. And if you try to figure out why I picked these cases, you'll probably have a good hint for part of a good solution for the general problem. (:  tye
In Section
Meditations

