What is the least number of moves needed to solve the k-peg...

Discrete Mathematics Algorithms and Applications 2019 / 02 Vol. 11; Iss. 1

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

Demontis, Roberto
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
11
Journal:
Discrete Mathematics, Algorithms and Applications
DOI:
10.1142/S1793830919300017
Date:
February, 2019
File:
PDF, 138 KB
2019
Conversion to is in progress
Conversion to is failed