[8059] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[12009] | 3 | * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[8059] | 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 HeuristicLab.Common;
|
---|
| 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
|
---|
| 26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 27 |
|
---|
| 28 | namespace HeuristicLab.Problems.LawnMower {
|
---|
| 29 | [StorableClass]
|
---|
| 30 | public sealed class ConstantTreeNode : SymbolicExpressionTreeTerminalNode {
|
---|
| 31 | private Tuple<int, int> value;
|
---|
| 32 |
|
---|
| 33 | public override bool HasLocalParameters {
|
---|
| 34 | get { return true; }
|
---|
| 35 | }
|
---|
| 36 |
|
---|
| 37 | [Storable]
|
---|
| 38 | public Tuple<int, int> Value { get { return value; } private set { this.value = value; } }
|
---|
| 39 |
|
---|
| 40 | [StorableConstructor]
|
---|
| 41 | private ConstantTreeNode(bool deserializing) : base(deserializing) { }
|
---|
| 42 | private ConstantTreeNode(ConstantTreeNode original, Cloner cloner)
|
---|
| 43 | : base(original, cloner) {
|
---|
| 44 | this.value = new Tuple<int, int>(original.value.Item1, original.value.Item2);
|
---|
| 45 | }
|
---|
| 46 |
|
---|
| 47 | public ConstantTreeNode()
|
---|
| 48 | : base(new Constant()) {
|
---|
| 49 | value = Tuple.Create(0, 0);
|
---|
| 50 | }
|
---|
| 51 | [StorableHook(HookType.AfterDeserialization)]
|
---|
| 52 | private void AfterDeserialization() {
|
---|
| 53 | }
|
---|
| 54 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 55 | return new ConstantTreeNode(this, cloner);
|
---|
| 56 | }
|
---|
| 57 | public override void ResetLocalParameters(IRandom random) {
|
---|
| 58 | value = new Tuple<int, int>(random.Next(-20, 20), random.Next(-20, 20));
|
---|
| 59 | }
|
---|
| 60 | public override void ShakeLocalParameters(IRandom random, double shakingFactor) {
|
---|
| 61 | int dX = (int)Math.Round(random.Next(-10, +10) * shakingFactor);
|
---|
| 62 | int dY = (int)Math.Round(random.Next(-10, +10) * shakingFactor);
|
---|
| 63 | value = new Tuple<int, int>(value.Item1 + dX, value.Item2 + dY);
|
---|
| 64 | }
|
---|
| 65 | }
|
---|
| 66 | }
|
---|