8.6 Towers of Hanoi - initial solution up to 6 disks

Author: amejiarosario

src/08-dynamic-programming/hanoi-tower.js

@@ -24,10 +24,35 @@ class HanoiTowers {
   }
 
   getMovements() {
-    if(!this.t1.isEmpty()) {
-      this.move(this.t1, this.t2);
-      this.move(this.t2, this.t3);
+    const t1 = this.t1;
+    const t2 = this.t2;
+    const t3 = this.t3;
+
+    while(!this.t1.isEmpty()) {
+      this.move(t1, t2);
+      while(t2.peek() > t3.peek()) {
+        this.move(t3, t2);
+        while(t2.peek() > t1.peek()) {
+          this.move(t1, t2);
+          while(t2.peek() > t3.peek()) {
+            this.move(t3, t2);
+            while(t2.peek() > t1.peek()) {
+              this.move(t1, t2);
+              while(t2.peek() > t3.peek()) {
+                this.move(t3, t2);
+                this.move(t2, t1);
+              }
+              this.move(t2, t3);
+            }
+            this.move(t2, t1);
+          }
+          this.move(t2, t3);
+        }
+        this.move(t2, t1);
+      }
+      this.move(t2, t3);
     }
+
     return this.movements;
   }
 

src/08-dynamic-programming/hanoi-tower.spec.js

@@ -9,4 +9,28 @@ describe('hanoiTower', function() {
   it('1', function () {
     expect(hanoiTower(1)).to.equal(2);
   });
+
+  it('2', function () {
+    expect(hanoiTower(2)).to.equal(8);
+  });
+
+  it('3', function () {
+    expect(hanoiTower(3)).to.equal(26);
+  });
+
+  it('4', function () {
+    expect(hanoiTower(4)).to.equal(80);
+  });
+
+  it('5', function () {
+    expect(hanoiTower(5)).to.equal(242);
+  });
+
+  it('6', function () {
+    expect(hanoiTower(6)).to.equal(728);
+  });
+
+  it('7', function () {
+    expect(hanoiTower(7)).to.equal(728);
+  });
 });