diff --git a/src/Search.java b/src/Search.java
index cebb278..763624a 100644
--- a/src/Search.java
+++ b/src/Search.java
@@ -1,3 +1,6 @@
+import java.util.ArrayList;
+import java.util.LinkedList;
+
 public class Search {
      /**
      * Finds the location of the nearest reachable cheese from the rat's position.
@@ -29,6 +32,98 @@ public class Search {
      * @throws HungryRatException if there is no reachable cheese
      */
     public static int[] nearestCheese(char[][] maze) throws EscapedRatException, CrowdedMazeException, HungryRatException {
-        return null;
+        boolean[][] visited = new boolean[maze.length][maze[0].length]; // assuming we have rectanglular array (maze[0])
+        
+        int[] start = ratLocation(maze);
+
+        // queue = [], start off w/ empty queue
+        Queue<int[]> queue = new LinkedList<>();
+
+        // queue.add(start) , visit rat first
+        queue.add(start);
+
+        // while queue not empty
+        //  current = queue.poll()
+        //  if visited: continue, dont want to do anything,
+        //  else -> mark visited
+        //  if (current is cheese): return current
+        //  else -> add all neighbors to queue
+        while (!queue.isEmpty()) {
+            int[] current = queue.poll();
+            int curR = current[0];
+            int curC = current[1];
+
+            if (visited[curR][curC]) continue; // if visited is true since boolean array starts off all false
+
+            visited[curR][curC] = true;
+
+            if (maze[curR][curC] == 'c') return current; // why not return "maze[curR][curC]" ?????????? bc current is row, column location.
+
+            // get our neighbors and put into list variable
+            //for (int[] neighbor : getNeighbors(maze, current)) {
+            //    queue.add(neighbor);
+            //}
+
+            queue.addAll(getNeighbors(maze, current));
+        }
+
+        // if searched entirely and never found it -> throw hungry exception
+        throw new HungryRatException();
     }
-}
\ No newline at end of file
+
+    public static List<int[]> getNeighbors(char[][] maze, int[] current) {
+        int curR = current[0];
+        int curC = current[1]; // ?
+
+        int[][] directions = {
+            {-1, 0}, // UP
+            {1, 0},  // DOWN
+            {0, -1}, // LEFT
+            {0, 1}   // RIGHT
+        };
+
+        List<int[]> possibleMovies = new ArrayList<>();
+
+        for (int[] direction : directions) {
+            int changeR = direction[0];
+            int changeC = direction[1];
+
+            int newR = curR + changeR;
+            int newC = curC + changeC;
+
+            if (newR >= 0 && newR < maze.length &&          // check row is valid
+                newC >= 0 && newC < maze[newR].length &&    // check column is valid
+                maze[newR][newC] != 'w')                    // make sure its not a wall
+            {
+                int[] validMove = {newR, newC};
+                possibleMovies.add(validMove);
+            }
+        }
+
+        return possibleMovies;
+    }
+
+    public static int[] ratLocation(char[][] maze) throws EscapedRatException, CrowdedMazeException, HungryRatException {
+        int[] location = null;
+
+        // Searching
+        for (int r = 0; r < maze.length; r++) {
+            for(int c = 0; c < maze[r].length; c++) { // if that specific row.length
+                if (maze[r][c] == 'R') {
+                    if (location != null) throw new CrowdedMazeException();
+
+                    location = new int[]{r, c};
+                }
+            }
+        }
+
+        if (location == null) {
+            // 404 rat not found
+            throw new EscapedRatException();
+        }
+
+        return location;
+    }
+}
+
+public static void main(String[] args) {}
\ No newline at end of file