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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.