title: Towers Of Hanoi Java Recursion
body: <p>Good evening everyone,</p>
  
  <p>I have a quick question on a homework assignment my class is doing about recursion. The idea is that we have this towers of hanoi program, and we need to write a main that will make a table that will display the numbers 5-25, and how many moves it would take to solve a tower of that size, for example</p>
  
  <p>5 ---- 31 Moves</p>
  
  <p>6 ---- 63 Moves</p>
  
  <p>etc...</p>
  
  <p>I am having a little bit of trouble doing that as the TowersOfHanoi class is set up to print out each move, and I don't think we're supposed to get rid of that, but I'm not too sure.</p>
  
  <p>Here is the TowersOfHanoi class</p>
  
  <pre><code>public class TowersOfHanoi {
      private int totalDisks;
      private int count;
  
      public TowersOfHanoi(int disks) {
          totalDisks = disks;
          count = 0;
      }
  
      public void solve() {
          moveTower (totalDisks,1,3,2);
      }
  
      private void moveTower(int numDisks, int start, int end, int temp) {
          if (numDisks ==1) {
              moveOneDisk(start,end);
          }
          else {
              moveTower (numDisks-1, start, temp, end);
              moveOneDisk (start, end);
              moveTower (numDisks-1, temp, end, start);
          }
      }
  
      private void moveOneDisk(int start, int end) {
          count = count+1;
          System.out.println("Move one disk from "+start+" to "+end+" - Move "+count);
      }
  }
  </code></pre>
  
  <p>Now I just need to write a main that will create that table without printing out every single move for every single tower, but I'm not really sure how to. Any help is much appreciated</p>