On generalized Frame-Stewart numbers

For the multi-peg Tower of Hanoi problem with k 4 pegs, so far the best solution is obtained by the Stewart's algorithm [15] based on the the following recurrence relation: Sk(n) = min 1tn 2

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Jonathan Chappelon, Akihiro Matsuura
• Keywords: CORR 2010, Education, Hanoi Problem, Multi-peg Tower