1 files changed, 1 insertions, 10 deletions

diff --git a/src/ch/epfl/maze/tests/ZooTest.java b/src/ch/epfl/maze/tests/ZooTest.java
index 04b6a79..03a84b3 100644
--- a/src/ch/epfl/maze/tests/ZooTest.java
+++ b/src/ch/epfl/maze/tests/ZooTest.java
@@ -12,7 +12,6 @@ import org.junit.Test;
 /**
  * Test cases for animals implementation.
  */
-
 public class ZooTest extends TestCase {
 
     public static final boolean DEBUG = false;
@@ -22,7 +21,6 @@ public class ZooTest extends TestCase {
      * <p>
      * The Mouse should go forward and never retrace its steps.
      */
-
     @Test
     public void testMouse() {
         int[][] labyrinth = LabyrinthGenerator.getDebugMouse();
@@ -42,7 +40,6 @@ public class ZooTest extends TestCase {
      * <p>
      * The Hamster should never revisit a dead-end it has already visited.
      */
-
     @Test
     public void testHamster() {
         int[][] labyrinth = LabyrinthGenerator.getDebugHamster();
@@ -62,7 +59,6 @@ public class ZooTest extends TestCase {
      * <p>
      * The Monkey should go directly to the exit without taking any dead-end.
      */
-
     @Test
     public void testMonkey() {
         int[][] labyrinth = LabyrinthGenerator.getDebugMonkey();
@@ -84,7 +80,6 @@ public class ZooTest extends TestCase {
      * it loops infinitely in this maze, it means that it does not properly
      * count the turns it makes.
      */
-
     @Test
     public void testBear1() {
         int[][] labyrinth = LabyrinthGenerator.getDebugBear1();
@@ -105,7 +100,6 @@ public class ZooTest extends TestCase {
      * If the Bear loops infinitely in this maze, it means that it does not
      * properly count the turns it makes.
      */
-
     @Test
     public void testBear2() {
         int[][] labyrinth = LabyrinthGenerator.getDebugBear2();
@@ -126,7 +120,6 @@ public class ZooTest extends TestCase {
      * When the Panda comes back to the intersection, then it must leave the
      * position marked once and go back into the loop.
      */
-
     @Test
     public void testPanda1() {
         int[][] labyrinth = LabyrinthGenerator.getDebugPanda1();
@@ -147,7 +140,6 @@ public class ZooTest extends TestCase {
      * The Panda must mark the intersection twice only the very last time it
      * walks on it.
      */
-
     @Test
     public void testPanda2() {
         int[][] labyrinth = LabyrinthGenerator.getDebugPanda2();
@@ -167,7 +159,6 @@ public class ZooTest extends TestCase {
      * <p>
      * The Bear should leave the maze while the Monkey should loop infinitely.
      */
-
     @Test
     public void testBearVsMonkey() {
         int[][] labyrinth = LabyrinthGenerator.getBearVsMonkey();
@@ -188,7 +179,6 @@ public class ZooTest extends TestCase {
      * The Panda should leave the maze earlier than the Hamster with a higher
      * probability than the Hamster.
      */
-
     @Test
     public void testPandaVsHamster() {
         int[][] labyrinth = LabyrinthGenerator.getPandaVsHamster();
@@ -202,4 +192,5 @@ public class ZooTest extends TestCase {
         Display display = new Display(simulation);
         display.run();
     }
+
 }