A* algorithm  Towers of Hanoi

1.  The number of rings not present on the right pole.

2.  Take a look at the largest ring not on the right pole.  You'll have to remove everything from that ring, move it to the right pole, and then put everything back on top of it.  Base a heuristic.

  Some people gave rings a priority number arguing that the largest ring will need to be moved one, the second at least twice, the third at least three times and so forth.

f(1) = 1


f(n) = f(n-1) + 1 + f(n-1) = 2f(n-1)+1

f(1) = 1
f(2) = 3
f(3) = 7

f(n) = 2^n-1


DO 100 I = 1,50  <== This is a for-loop in ForTran

DO 100 I = 1.50  <== This sets a variable called DO100I to the value 1.5