Changeset 12895 for trunk/sources/HeuristicLab.Problems.ArtificialAnt/3.5/AntInterpreter.cs

Timestamp:

08/25/15 10:38:20 (9 years ago)

Author:

gkronber

Message:

#2421 new version of artificial ant problem that uses SymbolicExpressionTreeEncoding

Location:

trunk/sources/HeuristicLab.Problems.ArtificialAnt/3.5

Files:

• . (copied) (copied from trunk/sources/HeuristicLab.Problems.ArtificialAnt/3.4)
• AntInterpreter.cs (modified) (5 diffs)

trunk/sources/HeuristicLab.Problems.ArtificialAnt/3.5/AntInterpreter.cs

@@ -25 +25 @@
 using HeuristicLab.Data;
 using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
-using HeuristicLab.Problems.ArtificialAnt.Symbols;
 
 namespace HeuristicLab.Problems.ArtificialAnt {
   public class AntInterpreter {
 
-    public int MaxTimeSteps { get; set; }
-    public int FoodEaten { get; set; }
-    private BoolMatrix world;
-    public BoolMatrix World {
-      get { return world; }
-      set {
-        // create a clone of the world because the ant will remove the food items it can find.
-        world = (BoolMatrix)value.Clone();
-        CountFoodItems();
-      }
-    }
+    public int MaxTimeSteps { get; private set; }
+    public int FoodEaten { get; private set; }
+    public BoolMatrix World { get; private set; }
 
-    private SymbolicExpressionTree expression;
-    public SymbolicExpressionTree Expression {
-      get { return expression; }
-      set {
-        expression = value;
-      }
-    }
-
-    private SymbolicExpressionTreeNode FindMatchingFunction(string name) {
-      foreach (var defunBranch in expression.Root.Subtrees.OfType<DefunTreeNode>()) {
-        if (defunBranch.FunctionName == name) return defunBranch;
-      }
-      throw new ArgumentException("Function definition for " + name + " not found.");
-    }
-
+    public ISymbolicExpressionTree Expression { get; private set; }
 
 
@@ -65 +42 @@
     private int nFoodItems;
     private Stack<ISymbolicExpressionTreeNode> nodeStack = new Stack<ISymbolicExpressionTreeNode>();
+
+    public AntInterpreter(ISymbolicExpressionTree tree, BoolMatrix world, int maxTimeSteps) {
+      this.Expression = tree;
+      this.MaxTimeSteps = maxTimeSteps;
+      // create a clone of the world because the ant will remove the food items it can find.
+      World = (BoolMatrix)world.Clone();
+      CountFoodItems();
+    }
 
     private void CountFoodItems() {
@@ -97 +82 @@
 
       var currentNode = nodeStack.Pop();
-      if (currentNode.Symbol is Left) {
+      if (currentNode.Symbol.Name == "Left") {
         currentDirection = (currentDirection + 3) % 4;
         ElapsedTime++;
-      } else if (currentNode.Symbol is Right) {
+      } else if (currentNode.Symbol.Name == "Right") {
         currentDirection = (currentDirection + 1) % 4;
         ElapsedTime++;
-      } else if (currentNode.Symbol is Move) {
+      } else if (currentNode.Symbol.Name == "Move") {
         MoveAntForward();
-        if (World[currentAntLocationRow, currentAntLocationColumn])
+        if (World[currentAntLocationRow, currentAntLocationColumn]) {
           FoodEaten++;
-        World[currentAntLocationRow, currentAntLocationColumn] = false;
+          World[currentAntLocationRow, currentAntLocationColumn] = false;
+        }
         ElapsedTime++;
-      } else if (currentNode.Symbol is IfFoodAhead) {
+      } else if (currentNode.Symbol.Name == "IfFoodAhead") {
         int nextAntLocationRow;
         int nextAntLocationColumn;
@@ -118 +104 @@
           nodeStack.Push(currentNode.GetSubtree(1));
         }
-      } else if (currentNode.Symbol is Prog2) {
+      } else if (currentNode.Symbol.Name == "Prog2") {
         nodeStack.Push(currentNode.GetSubtree(1));
         nodeStack.Push(currentNode.GetSubtree(0));
-        return;
-      } else if (currentNode.Symbol is Prog3) {
+      } else if (currentNode.Symbol.Name == "Prog3") {
         nodeStack.Push(currentNode.GetSubtree(2));
         nodeStack.Push(currentNode.GetSubtree(1));
         nodeStack.Push(currentNode.GetSubtree(0));
-        return;
       } else if (currentNode.Symbol is InvokeFunction) {
         var invokeNode = currentNode as InvokeFunctionTreeNode;
@@ -171 +155 @@
       }
     }
+
+
+    private SymbolicExpressionTreeNode FindMatchingFunction(string name) {
+      foreach (var defunBranch in Expression.Root.Subtrees.OfType<DefunTreeNode>()) {
+        if (defunBranch.FunctionName == name) return defunBranch;
+      }
+      throw new ArgumentException("Function definition for " + name + " not found.");
+    }
   }
 }