Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Problems.ArtificialAnt/3.3/ArtificialAntExpressionGrammar.cs @ 3376

Last change on this file since 3376 was 3376, checked in by swagner, 14 years ago

Moved interfaces and classes for deep cloning from HeuristicLab.Core to HeuristicLab.Common (#975).

File size: 2.8 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2010 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
23using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
24using System.Collections.Generic;
25using System;
26using System.Linq;
27using HeuristicLab.Common;
28using HeuristicLab.Core;
29using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
30using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.GeneralSymbols;
31namespace HeuristicLab.Problems.ArtificialAnt {
32  [StorableClass]
33  public class ArtificialAntExpressionGrammar : DefaultSymbolicExpressionGrammar {
34
35    public ArtificialAntExpressionGrammar()
36      : base() {
37      Initialize();
38    }
39
40    private void Initialize() {
41      var ifFoodAhead = new IfFoodAhead();
42      var prog2 = new Prog2();
43      var prog3 = new Prog3();
44      var move = new Move();
45      var left = new Left();
46      var right = new Right();
47      var defun = new Defun();
48      var allSymbols = new List<Symbol>() { ifFoodAhead, prog2, prog3, move, left, right };
49      var nonTerminalSymbols = new List<Symbol>() { ifFoodAhead, prog2, prog3 };
50
51      allSymbols.ForEach(s => AddSymbol(s));
52      SetMinSubtreeCount(ifFoodAhead, 2);
53      SetMaxSubtreeCount(ifFoodAhead, 2);
54      SetMinSubtreeCount(prog2, 2);
55      SetMaxSubtreeCount(prog2, 2);
56      SetMinSubtreeCount(prog3, 3);
57      SetMaxSubtreeCount(prog3, 3);
58      SetMinSubtreeCount(move, 0);
59      SetMaxSubtreeCount(move, 0);
60      SetMinSubtreeCount(left, 0);
61      SetMaxSubtreeCount(left, 0);
62      SetMinSubtreeCount(right, 0);
63      SetMaxSubtreeCount(right, 0);
64
65      // each symbols is allowed as child of the start symbol
66      allSymbols.ForEach(s => SetAllowedChild(StartSymbol, s, 0));
67
68      // each symbol is allowed as child of all other symbols (except for terminals that have MaxSubtreeCount == 0
69      foreach (var parent in allSymbols) {
70        for (int argIndex = 0; argIndex < GetMaxSubtreeCount(parent); argIndex++) {
71          foreach (var child in allSymbols) {
72            SetAllowedChild(parent, child, argIndex);
73          }
74        }
75      }
76    }
77  }
78}
Note: See TracBrowser for help on using the repository browser.