title: Tower of Hanoi recursion java
body: <p>Here's my Java code for solving Tower of Hanoi using recursion: </p>
  
  <pre><code>/**here is a stack of N disks on the first of three poles (call
  them A, B and C) and your job is to move the disks from pole A to pole B without
  ever putting a larger disk on top of a smaller disk.*/ 
  
  public class Hanoi {
  
      public static void main(String[] args) {
          playHanoi (2,"A","B","C");
      }
  
      //move n disks from position "from" to "to" via "other"
      private static void playHanoi(int n, String from , String other, String to) {
          if (n == 0)
              return;
          if (n &gt; 0)
          playHanoi(n-1, from, to, other);
          System.out.printf("Move one disk from pole %s to pole %s \n ", from, to);
          playHanoi(n-1, other, from, to);
      }
  
  }
  </code></pre>
  
  <p>Does the place I put the print method matter? Also, can I do it like this:</p>
  
  <pre><code>    playHanoi(n-1, from, to, other);
      playHanoi(n-1, other, from, to);
      System.out.printf("Move one disk from pole %s to pole %s \n ", from, to);
  </code></pre>