Data commit

Task/Towers-of-Hanoi/JavaScript/towers-of-hanoi-1.js

@@ -0,0 +1,8 @@
+function move(n, a, b, c) {
+  if (n > 0) {
+    move(n-1, a, c, b);
+    console.log("Move disk from " + a + " to " + c);
+    move(n-1, b, a, c);
+  }
+}
+move(4, "A", "B", "C");

Task/Towers-of-Hanoi/JavaScript/towers-of-hanoi-2.js

@@ -0,0 +1,16 @@
+(function () {
+
+    // hanoi :: Int -> String -> String -> String -> [[String, String]]
+    function hanoi(n, a, b, c) {
+        return n ? hanoi(n - 1, a, c, b)
+            .concat([
+                [a, b]
+            ])
+            .concat(hanoi(n - 1, c, b, a)) : [];
+    }
+
+    return hanoi(3, 'left', 'right', 'mid')
+        .map(function (d) {
+            return d[0] + ' -> ' + d[1];
+        });
+})();

Task/Towers-of-Hanoi/JavaScript/towers-of-hanoi-3.js

@@ -0,0 +1,4 @@
+["left -> right", "left -> mid",
+ "right -> mid", "left -> right",
+ "mid -> left", "mid -> right",
+ "left -> right"]

Task/Towers-of-Hanoi/JavaScript/towers-of-hanoi-4.js

@@ -0,0 +1,26 @@
+(() => {
+    "use strict";
+
+    // ----------------- TOWERS OF HANOI -----------------
+
+    // hanoi :: Int -> String -> String ->
+    // String -> [[String, String]]
+    const hanoi = n =>
+        (a, b, c) => {
+            const go = hanoi(n - 1);
+
+            return Boolean(n) ? [
+                ...go(a, c, b),
+                ...[
+                    [a, b]
+                ],
+                ...go(c, b, a)
+            ] : [];
+        };
+
+
+    // ---------------------- TEST -----------------------
+    return hanoi(3)("left", "right", "mid")
+        .map(d => `${d[0]} -> ${d[1]}`)
+        .join("\n");
+})();