removed debug code.

src/com/seefurst/towersofhanoi/boardobjects/Board.scala

@@ -6,14 +6,14 @@ class Board(numberOfDisksPerPole: Int) {
 
 
    def moveDisks(diskIdx: Int, beginningPole: Int, auxiliaryPole: Int, destinationPole: Int, displayAfterMove: (Board) => Unit): Unit  = {
-     System.out.println("we are moving disk: " + diskIdx +" from: "+ beginningPole +" to: " + destinationPole)
+     //System.out.println("we are moving disk: " + diskIdx +" from: "+ beginningPole +" to: " + destinationPole)
      if (diskIdx == 0) {
-       System.out.println("reached base case..") 
+       //System.out.println("reached base case..") 
        moveDisk(beginningPole, destinationPole)
        displayAfterMove(this)
      }
      else {
-       System.out.println("not top disk, moving disk above it.")
+       ///System.out.println("not top disk, moving disk above it.")
        moveDisks(diskIdx-1, beginningPole, destinationPole, auxiliaryPole, displayAfterMove)
        moveDisks(0, beginningPole, auxiliaryPole, destinationPole, displayAfterMove)
        moveDisks(diskIdx-1, auxiliaryPole, beginningPole, destinationPole, displayAfterMove)
@@ -23,10 +23,10 @@ class Board(numberOfDisksPerPole: Int) {
 
    @throws(classOf[IllegalStateException])  
    def moveDisk(source: Int, dest: Int) = {
-     System.out.println("calling move disk, beginning pole: " + source + " dest pole: " + dest)
+     //System.out.println("calling move disk, beginning pole: " + source + " dest pole: " + dest)
      val sourcePole = poles(source) //index
      val sourceDisk = sourcePole.removeDisk()
-     System.out.println("source disk: " + sourceDisk)
+     //System.out.println("source disk: " + sourceDisk)
      if (sourceDisk == null ) throw new IllegalStateException;
 
      val destPole = poles(dest) //index

src/com/seefurst/towersofhanoi/boardobjects/Pole.scala

@@ -9,11 +9,11 @@ class Pole(numberOfDisks: Int) {
     private val lineSeparator = System.lineSeparator();
 
     def initDisks: Stack[Disk] = {
-      println("numberOfDisks: " + numberOfDisks);
+      // println("numberOfDisks: " + numberOfDisks);
       val newDisks = new Stack[Disk]();
       for (i <- numberOfDisks - 1 to 0 by -1 
               if (i >= 0)) { // the smallest disk should be the last in ... so
-       println("pushing disk " + i)
+      // println("pushing disk " + i)
         newDisks.push(new Disk(i));
       }
       newDisks;