From 48d2c516520dceebff732776892406672761bc98 Mon Sep 17 00:00:00 2001
From: Jonathan Turner <turner@atlantissrv.com>
Date: Sun, 11 Feb 2024 11:31:33 -0500
Subject: [PATCH] Added support for both Mac M1 and X86 Windows

---
 pom.xml                                       | 11 ++-----
 .../A1/solving_algorithms/DFS.java            | 29 -------------------
 2 files changed, 3 insertions(+), 37 deletions(-)

diff --git a/pom.xml b/pom.xml
index 66a7f93..a391a84 100644
--- a/pom.xml
+++ b/pom.xml
@@ -14,20 +14,15 @@
         <project.build.sourceEncoding>UTF-8</project.build.sourceEncoding>
     </properties>
     <dependencies>
-        <dependency>
-            <groupId>org.fxmisc.richtext</groupId>
-            <artifactId>richtextfx</artifactId>
-            <version>0.11.0</version>
-        </dependency>
         <dependency>
             <groupId>org.openjfx</groupId>
             <artifactId>javafx-controls</artifactId>
-            <version>12.0.2</version>
+            <version>18.0.2</version>
         </dependency>
         <dependency>
             <groupId>org.openjfx</groupId>
             <artifactId>javafx-fxml</artifactId>
-            <version>20.0.1</version>
+            <version>18.0.2</version>
         </dependency>
     </dependencies>
     <build>
@@ -42,7 +37,7 @@
                 <artifactId>javafx-maven-plugin</artifactId>
                 <version>0.0.8</version>
                 <configuration>
-                    <mainClass>edu.jturn.cs3642.CS3642-Artificial_Intelligence/Assignments.A1.GUIDriver</mainClass>
+                    <mainClass>Assignments/A1/GUILauncher</mainClass>
                 </configuration>
             </plugin>
         </plugins>
diff --git a/src/main/java/Assignments/A1/solving_algorithms/DFS.java b/src/main/java/Assignments/A1/solving_algorithms/DFS.java
index a79ec3d..9068ae6 100644
--- a/src/main/java/Assignments/A1/solving_algorithms/DFS.java
+++ b/src/main/java/Assignments/A1/solving_algorithms/DFS.java
@@ -13,35 +13,6 @@ public class DFS {
     private final Board solved = new Board();
     private final List<String> tried = new ArrayList<>();
 
-    /* Commented out for future reference. */
-//    public Board dfs(Board root, int depth, ArrayList<String> visited) {
-//        counter++;
-//        if (root.equals(solved)) {
-//            return root;
-//        }
-//
-//        ArrayList<String> directParents = new ArrayList<>(visited);
-//        if (depth == Parameters.MAX_DEPTH || visited.contains(root.toString()) || tried.contains(root.toString())) {
-//            return null;
-//        }
-//        directParents.add(root.toString());
-//        tried.add(root.toString());
-//
-//        List<Move> moves = root.getMoves();
-//        int moveNum = 1;
-//        for (Move next : moves) {
-//
-//            Board child = next.getBoard();
-//            child.swap(next);
-//            moveNum++;
-//            Board board = dfs(child, depth+1, directParents);
-//            if (board != null) {
-//                return board;
-//            }
-//        }
-//        return null;
-//    }
-
     public Board traverse(Board root, int depth) {
         Stack<Board> stack = new Stack<>();
         stack.push(root);