Random musings about generalizations of the Towers of Hanoi problem.
Suppose there are more than 3 sticks (positions). How much easier does the problem get? What is the optimal algorithm?
Are there configurations that are harder (more steps) than transferring the whole tower from one stick to another?
Suppose there is no ordering constraint (cylinders of hanoi). What permutation is most difficult?
A web search reveals most of these problems have already been considered.
No comments :
Post a Comment