The tower of Hanoi problem solved using recursion

README.md

The tower of Hanoi problem solved using recursion

More info: https://en.wikipedia.org/wiki/Tower_of_Hanoi#Recursive_solution

tower_of_hanoi_solved_recursively.js

function moveDisks(numberOfDisks, from, to, extra) {
  if (numberOfDisks > 0) {
      moveDisks(numberOfDisks - 1,
        from,
        extra,
        to
      );

      console.log(`Moving disk # ${numberOfDisks} from ${from} to ${to}`);

      moveDisks(numberOfDisks - 1,
        extra,
        to,
        from
      );
  }
}

moveDisks(4, "start pole", "target pole", "spare pole");