What is the least number of moves needed to solve the k-peg Towers of Hanoi problem?
From MaRDI portal
Publication:4621297
DOI10.1142/S1793830919300017zbMath1407.00009arXiv1203.3280OpenAlexW2964239108MaRDI QIDQ4621297
Publication date: 11 February 2019
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.3280
Related Items
Cites Work