diff --git a/src/SalamanderSearch.java b/src/SalamanderSearch.java
index 93c9ab5..3cf7360 100644
--- a/src/SalamanderSearch.java
+++ b/src/SalamanderSearch.java
@@ -44,6 +44,75 @@ public static void main(String[] args) {
      * @throws IllegalArgumentException if the enclosure does not contain a salamander
      */
     public static boolean canReach(char[][] enclosure) {
+        int[] start = salamanderLocation(enclosure);
+        boolean[][] visited = new boolean[enclosure.length][enclosure[0].length];
+        return canReach(enclosure, start, visited);
+    }
+
+    public static boolean canReach(char[][] enclosure, int[] current, boolean[][] visited) {
+        int currC = current[1];
+        int currR = current[0];
+
+        if(enclosure[currR][currC] == 'f') return true;
+        if(visited[currR][currC]) return false;
+
+        visited[currR][currC] = true;
+
+        List<int[]> neighbors = possibleMoves(enclosure, current);
+        for(int[] neighbor : neighbors) {
+            if(canReach(enclosure, neighbor, visited)) return true;
+        }
         return false;
     }
+
+    public static List<int[]> possibleMoves(char[][] enclosure, int[] current) {
+        List<int[]> moves = new ArrayList<>();
+
+        int currR = current[0];
+        int currC = current[1];
+
+        // Up
+        int newR = currR - 1;
+        int newC = currC;
+        if(newR >= 0 && enclosure[newR][newC] != 'W') {
+            moves.add(new int[]{newR, newC});
+        }
+
+        // Down
+        newR = currR + 1;
+        newC = currC;
+        if(newR < enclosure.length && enclosure[newR][newC] != 'W') {
+            moves.add(new int[]{newR, newC});
+        }
+
+        // Left
+        newR = currR;
+        newC = currC - 1;
+        if(newC >= 0 && enclosure[newR][newC] != 'W') {
+            moves.add(new int[]{newR, newC});
+        }
+
+        // Right
+        newR = currR;
+        newC = currC + 1;
+        if(newC < enclosure[newR].length && enclosure[newR][newC] != 'W') {
+            moves.add(new int[]{newR, newC});
+        }
+
+        return moves;
+    }
+
+    // O(m*n) m = # of rows n = # of columns
+    public static int[] salamanderLocation(char[][] enclosure) {
+        for(int r = 0; r < enclosure.length; r++) {
+            for(int c = 0; c <enclosure[r].length; c++) {
+                if(enclosure[r][c] == 's') {
+                    int[] location = new int[]{r, c};
+                    return location;
+                }
+            }
+        }
+
+        throw new IllegalArgumentException("No salamander present");
+    }
 }
diff --git a/src/SalamanderSearchTest.java b/src/SalamanderSearchTest.java
index ddad9de..a8b5af2 100644
--- a/src/SalamanderSearchTest.java
+++ b/src/SalamanderSearchTest.java
@@ -34,203 +34,203 @@ public void canReach_NoPath() {
         assertFalse(actual);
     }
 
-    // @Test
-    // public void testSalamanderLocation_centerOfGrid() {
-    //     char[][] enclosure = {
-    //         {'.', '.', '.'},
-    //         {'.', 's', '.'},
-    //         {'.', '.', '.'}
-    //     };
-    //     int[] expected = {1, 1};
-    //     assertArrayEquals(expected, SalamanderSearch.salamanderLocation(enclosure));
-    // }
-
-    // @Test
-    // public void testSalamanderLocation_topLeftCorner() {
-    //     char[][] enclosure = {
-    //         {'s', '.', '.'},
-    //         {'.', '.', '.'},
-    //         {'.', '.', '.'}
-    //     };
-    //     int[] expected = {0, 0};
-    //     assertArrayEquals(expected, SalamanderSearch.salamanderLocation(enclosure));
-    // }
-
-    // @Test
-    // public void testSalamanderLocation_notFound_throwsException() {
-    //     char[][] enclosure = {
-    //         {'.', '.', '.'},
-    //         {'.', '.', '.'},
-    //         {'.', '.', '.'}
-    //     };
-    //     Exception exception = assertThrows(IllegalArgumentException.class, () -> {
-    //         SalamanderSearch.salamanderLocation(enclosure);
-    //     });
-    //     assertEquals("No salamander present", exception.getMessage());
-    // }
-
-
-    // @Test
-    // public void testSalamanderLocation_at_1_2() {
-    //     char[][] enclosure = {
-    //         {'.', '.', '.'},
-    //         {'.', '.', 's'},
-    //         {'.', '.', '.'}
-    //     };
-    //     int[] expected = {1, 2};
-    //     assertArrayEquals(expected, SalamanderSearch.salamanderLocation(enclosure));
-    // }
-
-    // @Test
-    // public void testPossibleMoves_allDirectionsOpen() {
-    //     char[][] enclosure = {
-    //         {'.', '.', '.'},
-    //         {'.', 's', '.'},
-    //         {'.', '.', '.'}
-    //     };
-    //     int[] location = {1, 1};
-    //     List<int[]> moves = SalamanderSearch.possibleMoves(enclosure, location);
-    //     Set<String> moveSet = toSet(moves);
-
-    //     assertEquals(4, moves.size());
-    //     assertTrue(moveSet.contains("0,1")); // up
-    //     assertTrue(moveSet.contains("2,1")); // down
-    //     assertTrue(moveSet.contains("1,0")); // left
-    //     assertTrue(moveSet.contains("1,2")); // right
-    // }
-
-    // @Test
-    // public void testPossibleMoves_allDirectionsBlockedByWalls() {
-    //     char[][] enclosure = {
-    //         {'W', 'W', 'W'},
-    //         {'W', 's', 'W'},
-    //         {'W', 'W', 'W'}
-    //     };
-    //     int[] location = {1, 1};
-    //     List<int[]> moves = SalamanderSearch.possibleMoves(enclosure, location);
-    //     assertTrue(moves.isEmpty());
-    // }
-
-    // @Test
-    // public void testPossibleMoves_partialEdge() {
-    //     char[][] enclosure = {
-    //         {'s', '.', '.'}
-    //     };
-    //     int[] location = {0, 0};
-    //     List<int[]> moves = SalamanderSearch.possibleMoves(enclosure, location);
-    //     Set<String> moveSet = toSet(moves);
-
-    //     assertEquals(1, moves.size());
-    //     assertTrue(moveSet.contains("0,1")); // only right
-    // }
-
-    // @Test
-    // public void testPossibleMoves_oneOpen_twoWalls_oneEdge() {
-    //     // Salamander at (1, 1)
-    //     // Up is W, down is wall, left is edge (0), right is open
-    //     char[][] enclosure = {
-    //         {'W', 'W', 'W'},
-    //         {'.', 's', '.'},
-    //         {'W', 'W', 'W'}
-    //     };
-    //     int[] location = {1, 1};
-    //     List<int[]> moves = SalamanderSearch.possibleMoves(enclosure, location);
-    //     Set<String> moveSet = toSet(moves);
-
-    //     assertEquals(2, moves.size());
-    //     assertTrue(moveSet.contains("1,2"));
-    //     assertTrue(moveSet.contains("1,0"));
-    // }
-
-    // @Test
-    // public void testPossibleMoves_blockedAboveByWall() {
-    //     char[][] enclosure = {
-    //         {'.', 'W', '.'},
-    //         {'.', 's', '.'},
-    //         {'.', '.', '.'}
-    //     };
-    //     int[] location = {1, 1};
-    //     List<int[]> moves = SalamanderSearch.possibleMoves(enclosure, location);
-    //     Set<String> moveSet = toSet(moves);
-
-    //     assertFalse(moveSet.contains("0,1")); // up blocked
-    //     assertTrue(moveSet.contains("2,1"));  // down open
-    //     assertTrue(moveSet.contains("1,0"));  // left open
-    //     assertTrue(moveSet.contains("1,2"));  // right open
-    // }
-
-    // @Test
-    // public void testPossibleMoves_blockedBelowByWall() {
-    //     char[][] enclosure = {
-    //         {'.', '.', '.'},
-    //         {'.', 's', '.'},
-    //         {'.', 'W', '.'}
-    //     };
-    //     int[] location = {1, 1};
-    //     Set<String> moveSet = toSet(SalamanderSearch.possibleMoves(enclosure, location));
-
-    //     assertTrue(moveSet.contains("0,1"));  // up open
-    //     assertFalse(moveSet.contains("2,1")); // down blocked
-    //     assertTrue(moveSet.contains("1,0"));  // left open
-    //     assertTrue(moveSet.contains("1,2"));  // right open
-    // }
-
-    // @Test
-    // public void testPossibleMoves_blockedLeftByWall() {
-    //     char[][] enclosure = {
-    //         {'.', '.', '.'},
-    //         {'W', 's', '.'},
-    //         {'.', '.', '.'}
-    //     };
-    //     int[] location = {1, 1};
-    //     Set<String> moveSet = toSet(SalamanderSearch.possibleMoves(enclosure, location));
-
-    //     assertTrue(moveSet.contains("0,1"));  // up open
-    //     assertTrue(moveSet.contains("2,1"));  // down open
-    //     assertFalse(moveSet.contains("1,0")); // left blocked
-    //     assertTrue(moveSet.contains("1,2"));  // right open
-    // }
-
-    // @Test
-    // public void testPossibleMoves_blockedRightByWall() {
-    //     char[][] enclosure = {
-    //         {'.', '.', '.'},
-    //         {'.', 's', 'W'},
-    //         {'.', '.', '.'}
-    //     };
-    //     int[] location = {1, 1};
-    //     Set<String> moveSet = toSet(SalamanderSearch.possibleMoves(enclosure, location));
-
-    //     assertTrue(moveSet.contains("0,1"));  // up open
-    //     assertTrue(moveSet.contains("2,1"));  // down open
-    //     assertTrue(moveSet.contains("1,0"));  // left open
-    //     assertFalse(moveSet.contains("1,2")); // right blocked
-    // }
-
-    // @Test
-    // public void testPossibleMoves_topLeftCornerWithOneOpen() {
-    //     char[][] enclosure = {
-    //         {'s', 'W'},
-    //         {'W', '.'}
-    //     };
-    //     int[] location = {0, 0};
-    //     List<int[]> moves = SalamanderSearch.possibleMoves(enclosure, location);
-
-    //     assertTrue(moves.isEmpty()); // surrounded by walls/edges
-    // }
-
-    // @Test
-    // public void testPossibleMoves_rightEdgeWithOpenLeft() {
-    //     char[][] enclosure = {
-    //         {'.', '.', 's'}
-    //     };
-    //     int[] location = {0, 2};
-    //     List<int[]> moves = SalamanderSearch.possibleMoves(enclosure, location);
-    //     Set<String> moveSet = toSet(moves);
-
-    //     assertEquals(1, moves.size());
-    //     assertTrue(moveSet.contains("0,1"));
-    // }
+    @Test
+    public void testSalamanderLocation_centerOfGrid() {
+        char[][] enclosure = {
+            {'.', '.', '.'},
+            {'.', 's', '.'},
+            {'.', '.', '.'}
+        };
+        int[] expected = {1, 1};
+        assertArrayEquals(expected, SalamanderSearch.salamanderLocation(enclosure));
+    }
+
+    @Test
+    public void testSalamanderLocation_topLeftCorner() {
+        char[][] enclosure = {
+            {'s', '.', '.'},
+            {'.', '.', '.'},
+            {'.', '.', '.'}
+        };
+        int[] expected = {0, 0};
+        assertArrayEquals(expected, SalamanderSearch.salamanderLocation(enclosure));
+    }
+
+    @Test
+    public void testSalamanderLocation_notFound_throwsException() {
+        char[][] enclosure = {
+            {'.', '.', '.'},
+            {'.', '.', '.'},
+            {'.', '.', '.'}
+        };
+        Exception exception = assertThrows(IllegalArgumentException.class, () -> {
+            SalamanderSearch.salamanderLocation(enclosure);
+        });
+        assertEquals("No salamander present", exception.getMessage());
+    }
+
+
+    @Test
+    public void testSalamanderLocation_at_1_2() {
+        char[][] enclosure = {
+            {'.', '.', '.'},
+            {'.', '.', 's'},
+            {'.', '.', '.'}
+        };
+        int[] expected = {1, 2};
+        assertArrayEquals(expected, SalamanderSearch.salamanderLocation(enclosure));
+    }
+
+    @Test
+    public void testPossibleMoves_allDirectionsOpen() {
+        char[][] enclosure = {
+            {'.', '.', '.'},
+            {'.', 's', '.'},
+            {'.', '.', '.'}
+        };
+        int[] location = {1, 1};
+        List<int[]> moves = SalamanderSearch.possibleMoves(enclosure, location);
+        Set<String> moveSet = toSet(moves);
+
+        assertEquals(4, moves.size());
+        assertTrue(moveSet.contains("0,1")); // up
+        assertTrue(moveSet.contains("2,1")); // down
+        assertTrue(moveSet.contains("1,0")); // left
+        assertTrue(moveSet.contains("1,2")); // right
+    }
+
+    @Test
+    public void testPossibleMoves_allDirectionsBlockedByWalls() {
+        char[][] enclosure = {
+            {'W', 'W', 'W'},
+            {'W', 's', 'W'},
+            {'W', 'W', 'W'}
+        };
+        int[] location = {1, 1};
+        List<int[]> moves = SalamanderSearch.possibleMoves(enclosure, location);
+        assertTrue(moves.isEmpty());
+    }
+
+    @Test
+    public void testPossibleMoves_partialEdge() {
+        char[][] enclosure = {
+            {'s', '.', '.'}
+        };
+        int[] location = {0, 0};
+        List<int[]> moves = SalamanderSearch.possibleMoves(enclosure, location);
+        Set<String> moveSet = toSet(moves);
+
+        assertEquals(1, moves.size());
+        assertTrue(moveSet.contains("0,1")); // only right
+    }
+
+    @Test
+    public void testPossibleMoves_oneOpen_twoWalls_oneEdge() {
+        // Salamander at (1, 1)
+        // Up is W, down is wall, left is edge (0), right is open
+        char[][] enclosure = {
+            {'W', 'W', 'W'},
+            {'.', 's', '.'},
+            {'W', 'W', 'W'}
+        };
+        int[] location = {1, 1};
+        List<int[]> moves = SalamanderSearch.possibleMoves(enclosure, location);
+        Set<String> moveSet = toSet(moves);
+
+        assertEquals(2, moves.size());
+        assertTrue(moveSet.contains("1,2"));
+        assertTrue(moveSet.contains("1,0"));
+    }
+
+    @Test
+    public void testPossibleMoves_blockedAboveByWall() {
+        char[][] enclosure = {
+            {'.', 'W', '.'},
+            {'.', 's', '.'},
+            {'.', '.', '.'}
+        };
+        int[] location = {1, 1};
+        List<int[]> moves = SalamanderSearch.possibleMoves(enclosure, location);
+        Set<String> moveSet = toSet(moves);
+
+        assertFalse(moveSet.contains("0,1")); // up blocked
+        assertTrue(moveSet.contains("2,1"));  // down open
+        assertTrue(moveSet.contains("1,0"));  // left open
+        assertTrue(moveSet.contains("1,2"));  // right open
+    }
+
+    @Test
+    public void testPossibleMoves_blockedBelowByWall() {
+        char[][] enclosure = {
+            {'.', '.', '.'},
+            {'.', 's', '.'},
+            {'.', 'W', '.'}
+        };
+        int[] location = {1, 1};
+        Set<String> moveSet = toSet(SalamanderSearch.possibleMoves(enclosure, location));
+
+        assertTrue(moveSet.contains("0,1"));  // up open
+        assertFalse(moveSet.contains("2,1")); // down blocked
+        assertTrue(moveSet.contains("1,0"));  // left open
+        assertTrue(moveSet.contains("1,2"));  // right open
+    }
+
+    @Test
+    public void testPossibleMoves_blockedLeftByWall() {
+        char[][] enclosure = {
+            {'.', '.', '.'},
+            {'W', 's', '.'},
+            {'.', '.', '.'}
+        };
+        int[] location = {1, 1};
+        Set<String> moveSet = toSet(SalamanderSearch.possibleMoves(enclosure, location));
+
+        assertTrue(moveSet.contains("0,1"));  // up open
+        assertTrue(moveSet.contains("2,1"));  // down open
+        assertFalse(moveSet.contains("1,0")); // left blocked
+        assertTrue(moveSet.contains("1,2"));  // right open
+    }
+
+    @Test
+    public void testPossibleMoves_blockedRightByWall() {
+        char[][] enclosure = {
+            {'.', '.', '.'},
+            {'.', 's', 'W'},
+            {'.', '.', '.'}
+        };
+        int[] location = {1, 1};
+        Set<String> moveSet = toSet(SalamanderSearch.possibleMoves(enclosure, location));
+
+        assertTrue(moveSet.contains("0,1"));  // up open
+        assertTrue(moveSet.contains("2,1"));  // down open
+        assertTrue(moveSet.contains("1,0"));  // left open
+        assertFalse(moveSet.contains("1,2")); // right blocked
+    }
+
+    @Test
+    public void testPossibleMoves_topLeftCornerWithOneOpen() {
+        char[][] enclosure = {
+            {'s', 'W'},
+            {'W', '.'}
+        };
+        int[] location = {0, 0};
+        List<int[]> moves = SalamanderSearch.possibleMoves(enclosure, location);
+
+        assertTrue(moves.isEmpty()); // surrounded by walls/edges
+    }
+
+    @Test
+    public void testPossibleMoves_rightEdgeWithOpenLeft() {
+        char[][] enclosure = {
+            {'.', '.', 's'}
+        };
+        int[] location = {0, 2};
+        List<int[]> moves = SalamanderSearch.possibleMoves(enclosure, location);
+        Set<String> moveSet = toSet(moves);
+
+        assertEquals(1, moves.size());
+        assertTrue(moveSet.contains("0,1"));
+    }
 
 
     private Set<String> toSet(List<int[]> list) {