Changeset 12763 for branches/HeuristicLab.Problems.GrammaticalOptimization

Timestamp:

07/15/15 10:34:33 (9 years ago)

Author:

gkronber

Message:

optimal artificial ant solutions

Location:

branches/HeuristicLab.Problems.GrammaticalOptimization

Files:

• Test/TestInstances.cs (modified) (1 diff)
• antsol.tar.gz (added)

branches/HeuristicLab.Problems.GrammaticalOptimization/Test/TestInstances.cs

@@ -143 +143 @@
       Console.WriteLine(p.Grammar);
 
-      // one possible optimal solution: if-food-ahead (move) ( left left if-food-ahead (move) (right)) move right
+      // all possible minimal solutions to the artificial ant problem
       Assert.AreEqual(89, p.Evaluate("?(m)(ll?(m)(r))mr"));
+      Assert.AreEqual(89, p.Evaluate("?(m)(rr?(m)(l))ml"));
+      Assert.AreEqual(89, p.Evaluate("r?(m)(ll?(m)(r))m"));
+      Assert.AreEqual(89, p.Evaluate("l?(m)(rr?(m)(l))m"));
+      Assert.AreEqual(89, p.Evaluate("mr?(m)(ll?(m)(r))"));
+      Assert.AreEqual(89, p.Evaluate("ml?(m)(rr?(m)(l))"));
+      Assert.AreEqual(89, p.Evaluate("?(m)(ll?(m)(l))ml"));
+      Assert.AreEqual(89, p.Evaluate("?(m)(rr?(m)(r))mr"));
+      Assert.AreEqual(89, p.Evaluate("l?(m)(ll?(m)(l))m"));
+      Assert.AreEqual(89, p.Evaluate("r?(m)(rr?(m)(r))m"));
+      Assert.AreEqual(89, p.Evaluate("ml?(m)(ll?(m)(l))"));
+      Assert.AreEqual(89, p.Evaluate("mr?(m)(rr?(m)(r))"));
     }