Free cookie consent management tool by TermsFeed Policy Generator

source: stable/HeuristicLab.Problems.ArtificialAnt/3.4/ArtificialAntExpressionGrammar.cs @ 12008

Last change on this file since 12008 was 11170, checked in by ascheibe, 9 years ago

#2115 updated copyright year in stable branch

File size: 3.1 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2014 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 System.Collections.Generic;
24using HeuristicLab.Common;
25using HeuristicLab.Core;
26using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
27using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
28using HeuristicLab.Problems.ArtificialAnt.Symbols;
29namespace HeuristicLab.Problems.ArtificialAnt {
30  [StorableClass]
31  [Item(Name = "ArtificialAntExpressionGrammar", Description = "The default grammar for an artificial ant problem.")]
32  public class ArtificialAntExpressionGrammar : SymbolicExpressionGrammar {
33
34    public ArtificialAntExpressionGrammar()
35      : base(ItemAttribute.GetName(typeof(ArtificialAntExpressionGrammar)), ItemAttribute.GetDescription(typeof(ArtificialAntExpressionGrammar))) {
36      Initialize();
37    }
38    [StorableConstructor]
39    protected ArtificialAntExpressionGrammar(bool deserializing) : base(deserializing) { }
40    protected ArtificialAntExpressionGrammar(ArtificialAntExpressionGrammar original, Cloner cloner) : base(original, cloner) { }
41    public override IDeepCloneable Clone(Cloner cloner) {
42      return new ArtificialAntExpressionGrammar(this, cloner);
43    }
44
45    private void Initialize() {
46      var ifFoodAhead = new IfFoodAhead();
47      var prog2 = new Prog2();
48      var prog3 = new Prog3();
49      var move = new Move();
50      var left = new Left();
51      var right = new Right();
52      var allSymbols = new List<Symbol>() { ifFoodAhead, prog2, prog3, move, left, right };
53      var nonTerminalSymbols = new List<Symbol>() { ifFoodAhead, prog2, prog3 };
54
55      allSymbols.ForEach(s => AddSymbol(s));
56      SetSubtreeCount(ifFoodAhead, 2, 2);
57      SetSubtreeCount(prog2, 2, 2);
58      SetSubtreeCount(prog3, 3, 3);
59      SetSubtreeCount(move, 0, 0);
60      SetSubtreeCount(left, 0, 0);
61      SetSubtreeCount(right, 0, 0);
62
63      // each symbols is allowed as child of the start symbol
64      allSymbols.ForEach(s => AddAllowedChildSymbol(StartSymbol, s));
65      allSymbols.ForEach(s => AddAllowedChildSymbol(DefunSymbol, s));
66
67      // each symbol is allowed as child of all other symbols (except for terminals that have MaxSubtreeCount == 0
68      foreach (var parent in nonTerminalSymbols) {
69        foreach (var child in allSymbols) {
70          AddAllowedChildSymbol(parent, child);
71        }
72      }
73    }
74  }
75}
Note: See TracBrowser for help on using the repository browser.