diff --git a/src/Assignments/A1/Driver.java b/src/Assignments/A1/Driver.java
index ec8847e..dd3db8f 100644
--- a/src/Assignments/A1/Driver.java
+++ b/src/Assignments/A1/Driver.java
@@ -26,10 +26,10 @@ public class Driver {
     public static void main(String[] args) {
         DFS solver = new DFS();
         Board board = BoardGenerator.generateBoard();
-        Board result = solver.dfs(board, 0, new ArrayList<>());
+        boolean result = solver.traverse(board);
         int count = 0;
-        while (count != 100 || result != null) {
-            result = solver.dfs(board, 0, new ArrayList<>());
+        while (count != 100 || !result) {
+            result = solver.traverse(board);
             System.out.println(count);
             count++;
             board = BoardGenerator.generateBoard();
diff --git a/src/Assignments/A1/solving_algorithms/DFS.java b/src/Assignments/A1/solving_algorithms/DFS.java
index bab8a0e..ead5df1 100644
--- a/src/Assignments/A1/solving_algorithms/DFS.java
+++ b/src/Assignments/A1/solving_algorithms/DFS.java
@@ -43,4 +43,68 @@ public class DFS {
         return null;
     }
 
+    public boolean traverse(Board root) {
+        BoardNode current = new BoardNode(root);
+        Stack<BoardNode> lvr = new Stack<>();
+        lvr.push(current);
+        while (!lvr.isEmpty()) {
+            BoardNode curr = lvr.pop();
+            if (curr.board.equals(solved)) {
+                return true;
+            }
+            List<Move> moves = curr.board.getMoves();
+            for (Move move : moves) {
+                Board child = new Board(curr.board);
+                child.swap(move);
+                if (!curr.hasAncestor(child)) {
+                    BoardNode childNode = new BoardNode(child, curr);
+                    curr.addChild(childNode);
+                    lvr.add(childNode);
+                }
+            }
+        }
+        return false;
+
+    }
+
+
+
+
+}
+
+class BoardNode {
+
+    public Board board;
+    public BoardNode parent;
+    public List<BoardNode> children;
+
+    public BoardNode(Board child, BoardNode parent) {
+        this.board = child;
+        this.parent = parent;
+        this.children = new ArrayList<>();
+    }
+
+    public BoardNode (Board child) {
+        this.board = child;
+        this.parent = null;
+        this.children = new ArrayList<>();
+    }
+
+    public boolean hasAncestor(Board board) {
+        BoardNode current = this;
+        while (current.parent != null) {
+            current = current.parent;
+            if (current.board.equals(board)) {
+                return true;
+            }
+        }
+        return false;
+    }
+
+    public void addChild(BoardNode child) {
+        if (child != null) {
+            children.add(child);
+        }
+    }
+
 }