Ready for tomorrow.

.classpath

@@ -1,7 +1,6 @@
 <?xml version="1.0" encoding="UTF-8"?>
 <classpath>
 	<classpathentry kind="src" path="src/main/java"/>
-	<classpathentry kind="src" path="src/main/resources"/>
 	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER/org.eclipse.jdt.internal.debug.ui.launcher.StandardVMType/JavaSE-1.8/"/>
 	<classpathentry kind="con" path="org.eclipse.buildship.core.gradleclasspathcontainer"/>
 	<classpathentry kind="output" path="bin"/>

build.gradle

@@ -12,7 +12,7 @@ repositories {
 }
 
 dependencies {
-    compile 'com.github.cs125-illinois:mazemaker:0.1'
+    compile 'com.github.cs125-illinois:mazemaker:0.3'
 }
 
 checkstyle {

config/checkstyle/checkstyle.xml

@@ -165,7 +165,8 @@
         <module name="IllegalInstantiation"/>
         <module name="InnerAssignment"/>
 
-        <module name="MagicNumber"/>
+        <!-- Lab1: We need magic numbers for this one. -->
+        <!-- <module name="MagicNumber"/> -->
         <module name="MissingSwitchDefault"/>
         <module name="SimplifyBooleanExpression"/>
         <module name="SimplifyBooleanReturn"/>

src/main/java/SolveMaze.java

@@ -0,0 +1,46 @@
+import edu.illinois.cs.cs125.lib.mazemaker.Maze;
+
+/**
+ * Solve a randomly-generated maze.
+ *
+ * @see <a href="https://github.com/cs125-illinois/mazemaker">Mazemaker on GitHub</a>
+ * @see <a href="https://cs125-illinois.github.io/mazemaker/">Mazemaker Documentation</a>
+ * @see <a href="https://cs125.cs.illinois.edu/lab/2/#maze">Lab 2 Writeup</a>
+ */
+@SuppressWarnings("checkstyle:emptyblock")
+public class SolveMaze {
+
+    /**
+     * Implement your maze solving algorithm here.
+     *
+     * @param unused unused input arguments
+     */
+
+    public static void main(final String[] unused) {
+        /*
+         * Create a new 10 x 10 maze. Feel free to change these values.
+         */
+        Maze maze = new Maze(10, 10);
+
+        /*
+         * Pick (0, 0), the bottom left corner, as the starting point.
+         * Put the end in the top right corner.
+         */
+        maze.startAtZero();
+        maze.endAtTopRight();
+
+        /*
+         * You should be able to solve a 10 x 10 maze in (far fewer than) 1000 steps.
+         * Feel free to adjust this number if you experiment with other mazes.
+         */
+        for (int step = 0; step < 1000; step++) {
+            // Implement your maze solving algorithm here
+        }
+
+        if (maze.isFinished()) {
+            System.out.println("You solved the maze!");
+        } else {
+            System.out.println("Try again!");
+        }
+    }
+}