A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On The Average-Case Complexity of the Bottleneck Tower of Hanoi Problem

2013
*
2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
*

The Bottleneck Tower of Hanoi (BTH) problem, posed in 1981 by Wood [29], is a natural generalization of the classic Tower of Hanoi (TH) problem. There, a generalized placement rule allows a larger disk to be placed higher than a smaller one if their size difference is less than a given parameter k ≥ 1. The objective is to compute a shortest move-sequence transferring a legal (under the above rule) configuration of n disks on three pegs to another legal configuration. In SOFSEM'07, Dinitz and

doi:10.1137/1.9781611973204.10
dblp:conf/analco/SolomonS14
fatcat:ha454kbay5a4homi7l7f6yalhq