1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2008 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
4 | *
|
---|
5 | * This file is part of HeuristicLab.
|
---|
6 | *
|
---|
7 | * HeuristicLab is free software: you can redistribute it and/or modify
|
---|
8 | * it under the terms of the GNU General Public License as published by
|
---|
9 | * the Free Software Foundation, either version 3 of the License, or
|
---|
10 | * (at your option) any later version.
|
---|
11 | *
|
---|
12 | * HeuristicLab is distributed in the hope that it will be useful,
|
---|
13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
15 | * GNU General Public License for more details.
|
---|
16 | *
|
---|
17 | * You should have received a copy of the GNU General Public License
|
---|
18 | * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
|
---|
19 | */
|
---|
20 | #endregion
|
---|
21 |
|
---|
22 | using System;
|
---|
23 | using System.Collections.Generic;
|
---|
24 | using System.Linq;
|
---|
25 | using System.Text;
|
---|
26 | using HeuristicLab.DataAnalysis;
|
---|
27 | using HeuristicLab.Core;
|
---|
28 | using System.Xml;
|
---|
29 | using System.Diagnostics;
|
---|
30 |
|
---|
31 | namespace HeuristicLab.GP.SantaFe {
|
---|
32 | internal class AntInterpreter {
|
---|
33 | private const int N_FOOD_ITEMS = 89;
|
---|
34 | private const int WORLD_WIDTH = 32;
|
---|
35 | private const int WORLD_HEIGHT = 32;
|
---|
36 | private const int FOOD = 1;
|
---|
37 | private const int EMPTY = 0;
|
---|
38 | private int[] SANTA_FE_TRAIL = new int[] {
|
---|
39 | 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
---|
40 | 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
---|
41 | 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0,
|
---|
42 | 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0,
|
---|
43 | 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0,
|
---|
44 | 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
---|
45 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0,
|
---|
46 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
---|
47 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
---|
48 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0,
|
---|
49 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
---|
50 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
---|
51 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0,
|
---|
52 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
---|
53 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0,
|
---|
54 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0,
|
---|
55 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
---|
56 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
---|
57 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0,
|
---|
58 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0,
|
---|
59 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
---|
60 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
---|
61 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0,
|
---|
62 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0,
|
---|
63 | 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
---|
64 | 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
---|
65 | 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
---|
66 | 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
---|
67 | 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
---|
68 | 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
---|
69 | 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
---|
70 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
---|
71 | };
|
---|
72 |
|
---|
73 | private int[] trail;
|
---|
74 |
|
---|
75 | public int ElapsedTime { get; set; }
|
---|
76 | public int MaxTimeSteps { get; set; }
|
---|
77 | public int FoodEaten { get; set; }
|
---|
78 | private int currentDirection;
|
---|
79 | private int currentLocation;
|
---|
80 |
|
---|
81 | public AntInterpreter() {
|
---|
82 | currentLocation = 0;
|
---|
83 | currentDirection = 0;
|
---|
84 | FoodEaten = 0;
|
---|
85 | trail = new int[WORLD_HEIGHT * WORLD_WIDTH];
|
---|
86 | Array.Copy(SANTA_FE_TRAIL, trail, SANTA_FE_TRAIL.Length);
|
---|
87 | }
|
---|
88 |
|
---|
89 | internal void Run(IFunctionTree tree) {
|
---|
90 | while(FoodEaten < N_FOOD_ITEMS && ElapsedTime < MaxTimeSteps) {
|
---|
91 | Step(tree);
|
---|
92 | }
|
---|
93 | }
|
---|
94 |
|
---|
95 | internal void Step(IFunctionTree tree) {
|
---|
96 | int symbol = SymbolTable.MapFunction(tree.Function);
|
---|
97 | switch(symbol) {
|
---|
98 | case SymbolTable.LEFT:
|
---|
99 | if(ElapsedTime >= MaxTimeSteps || FoodEaten >= N_FOOD_ITEMS) return;
|
---|
100 | currentDirection = (currentDirection + 3) % 4;
|
---|
101 | ElapsedTime++;
|
---|
102 | return;
|
---|
103 | case SymbolTable.RIGHT:
|
---|
104 | if(ElapsedTime >= MaxTimeSteps || FoodEaten >= N_FOOD_ITEMS) return;
|
---|
105 | currentDirection = (currentDirection + 1) % 4;
|
---|
106 | ElapsedTime++;
|
---|
107 | return;
|
---|
108 | case SymbolTable.MOVE:
|
---|
109 | if(ElapsedTime >= MaxTimeSteps || FoodEaten >= N_FOOD_ITEMS) return;
|
---|
110 | currentLocation = NextField();
|
---|
111 | FoodEaten += trail[currentLocation];
|
---|
112 | trail[currentLocation] = EMPTY;
|
---|
113 | ElapsedTime++;
|
---|
114 | return;
|
---|
115 | case SymbolTable.IF_FOOD_AHEAD:
|
---|
116 | if(trail[NextField()] == FOOD) {
|
---|
117 | Step(tree.SubTrees[0]);
|
---|
118 | } else {
|
---|
119 | Step(tree.SubTrees[1]);
|
---|
120 | }
|
---|
121 | return;
|
---|
122 | case SymbolTable.PROG2:
|
---|
123 | Step(tree.SubTrees[0]);
|
---|
124 | Step(tree.SubTrees[1]);
|
---|
125 | return;
|
---|
126 | case SymbolTable.PROG3:
|
---|
127 | Step(tree.SubTrees[0]);
|
---|
128 | Step(tree.SubTrees[1]);
|
---|
129 | Step(tree.SubTrees[2]);
|
---|
130 | return;
|
---|
131 | case SymbolTable.UNKNOWN:
|
---|
132 | throw new InvalidOperationException(tree.Function.ToString());
|
---|
133 | }
|
---|
134 | }
|
---|
135 |
|
---|
136 | private int NextField() {
|
---|
137 | int currentLocationX = currentLocation % WORLD_WIDTH;
|
---|
138 | int currentLocationY = currentLocation / WORLD_HEIGHT;
|
---|
139 |
|
---|
140 | switch(currentDirection) {
|
---|
141 | case 0:
|
---|
142 | currentLocationX = (currentLocationX + 1) % WORLD_WIDTH; // EAST
|
---|
143 | break;
|
---|
144 | case 1:
|
---|
145 | currentLocationY = (currentLocationY + 1) % WORLD_HEIGHT; // SOUTH
|
---|
146 | break;
|
---|
147 | case 2:
|
---|
148 | currentLocationX = (currentLocationX + WORLD_WIDTH - 1) % WORLD_WIDTH; // WEST
|
---|
149 | break;
|
---|
150 | case 3:
|
---|
151 | currentLocationY = (currentLocationY + WORLD_HEIGHT - 1) % WORLD_HEIGHT; // NORTH
|
---|
152 | break;
|
---|
153 | default:
|
---|
154 | throw new InvalidOperationException();
|
---|
155 | }
|
---|
156 | return currentLocationY * WORLD_WIDTH + currentLocationX;
|
---|
157 | }
|
---|
158 | }
|
---|
159 | }
|
---|