Strong defence and less silly moves

vaquierm · Mar 20, 2019 · 479ec27 · 479ec27
1 parent 34212d9
commit 479ec27
Show file tree

Hide file tree

Showing 4 changed files with 51 additions and 26 deletions.
diff --git a/.gitignore b/.gitignore
@@ -1,3 +1,5 @@
 /logs/
 /.idea/
 /out/
+*.xml
+
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
diff --git a/src/boardgame/Server.java b/src/boardgame/Server.java
@@ -48,10 +48,10 @@ public class Server implements Runnable {
     protected static final String VERSION = "0.08";
     protected static final int DEFAULT_PORT = 8123;
 
-    public static final int DEFAULT_TIMEOUT = 9999999;
+    public static final int DEFAULT_TIMEOUT = 2000;
     private static final int DEFAULT_TIMEOUT_CUSHION = 1000;
 
-    public static final int FIRST_MOVE_TIMEOUT = 9999999;
+    public static final int FIRST_MOVE_TIMEOUT = 30000;
     private static final int FIRST_MOVE_TIMEOUT_CUSHION = 1000;
 
     protected static final String DEFAULT_BOARDCLASS = "pentago_swap.PentagoBoard";

diff --git a/src/student_player/MonteCarloTreeSearch.java b/src/student_player/MonteCarloTreeSearch.java
@@ -277,7 +277,7 @@ else if (boardState.getWinner() == 1 - player) {
                 // If the opponent was able to win in one move, we should not consider this move
                 node.updateStatus(MonteCarloTreeNode.Status.LOSS);
 
-                if (node.getParent().getParent() == root)
+                if (node.getParent().getParent() == root) // If the node is a move that is directly two levels under root, the opponent could win in one turn if we play this move's parent
                     node.getParent().updateStatus(Status.LOSS);
             }
         }