Nonrecursive solution to parallel multipeg towers of Hanoi: A decomposition approach (Q1816622): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0895-7177(96)00098-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2052966781
@@ Property / OpenAlex ID: W2052966781 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallelism for multipeg towers of Hanoi
@@ Property / cites work: Parallelism for multipeg towers of Hanoi / rank @@
+Normal rank
@@ Property / cites work @@
+A loopless approach to the multipeg towers of hanoi
+Normal rank
@@ Property / cites work @@
+A Representation Approach to the Tower of Hanoi Problem
+Normal rank
@@ Property / cites work @@
+A loopless approach for constructing a fastest algorithm for the towers of hanoi problem
+Normal rank
@@ Property / cites work @@
+An iterative algorithm for the Tower of Hanoi with four pegs
+Normal rank
@@ Property / cites work @@
+The towers of Hanoi revisited: Moving the rings by counting the moves
+Normal rank
@@ Property / cites work @@
+A note on parallelism for the towers of Hanoi
@@ Property / cites work: A note on parallelism for the towers of Hanoi / rank @@
+Normal rank
@@ Property / cites work @@
+The towers of Hanoi problem with parallel moves
@@ Property / cites work: The towers of Hanoi problem with parallel moves / rank @@
+Normal rank