What is the least number of moves needed to solve the k-peg Towers of Hanoi problem?

Roberto Demontis. What is the least number of moves needed to solve the k-peg Towers of Hanoi problem?. Discrete Math., Alg. and Appl., 11(1):1930001, 2019. [doi]

Authors

Roberto Demontis

This author has not been identified. Look up 'Roberto Demontis' in Google