Towers of hanoi problem with arbitrary<i>k</i>≧3 pages (Q3806843): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207168808803630
+Normal rank
@@ Property / OpenAlex ID @@
+W2060109034
@@ Property / OpenAlex ID: W2060109034 / rank @@
+Normal rank
@@ Property / cites work @@
+The cyclic towers of Hanoi
@@ Property / cites work: The cyclic towers of Hanoi / rank @@
+Normal rank
@@ Property / cites work @@
+A generalization of the cyclic towers of hanoi: an iterative solution
+Normal rank
@@ Property / cites work @@
+Discussion and correspondence: A note on the Towers of Hanoi problem
+Normal rank
@@ Property / cites work @@
+Towers of hanoi graphs
@@ Property / cites work: Towers of hanoi graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The towers of Hanoi revisited: Moving the rings by counting the moves
+Normal rank
@@ Property / cites work @@
+Adjudicating a towers of hanoi contest†
@@ Property / cites work: Adjudicating a towers of hanoi contest† / rank @@
+Normal rank