1 paper · 1 filter
Daniel Berend, Amir Sapir, Shay Solomon
The generalized Tower of Hanoi problem with h \ge 4 pegs is known to require a sub-exponentially fast growing number of moves in order to transfer a pile of n disks from one peg to…