Tower of Hanoi ES6 solution added

Author: me-shaon

Others/Tower of Hanoi/es6/test.js

@@ -0,0 +1,4 @@
+const Hanoi = require('./tower_of_hanoi')
+
+/****** Testing Tower of Hanoi code *******/
+Hanoi(3, 'A', 'B', 'C').forEach((move) => console.log(`moved ${move.disk} from: ${move.from} to: ${move.to}`))

Others/Tower of Hanoi/es6/tower_of_hanoi.js

@@ -0,0 +1,32 @@
+/* Tower of Hanoi implementation in Javascript(ES6) */
+
+// This function will recursively store all the moves and return the moves information as Array
+const hanoi = (count, source, aux, destination, moves) => {
+    moves = moves || [];
+
+    // When there is only single disk move it from 'source' to 'destination'
+    if (count === 1) {
+      moves.push({
+          'disk': 1,
+          'from': source,
+          'to': destination
+      });
+    }
+    else {
+        // Move 'n-1' disks from 'source' to 'aux'
+        hanoi(count - 1, source, destination, aux, moves);
+
+        // Move n-th disk from 'source' to 'detination'
+        moves.push({
+          'disk': count,
+          'from': source,
+          'to': destination
+        });
+
+        // Move (n-1) disks from 'aux' to 'destination'
+        hanoi(count - 1, aux, source, destination, moves);
+    }
+    return moves;
+}
+
+module.exports = hanoi