[13210] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17181] | 3 | * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[13210] | 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 HeuristicLab.Common;
|
---|
| 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
|
---|
[17097] | 25 | using HEAL.Attic;
|
---|
[13210] | 26 |
|
---|
| 27 | namespace HeuristicLab.Problems.GeneticProgramming.Robocode {
|
---|
[17097] | 28 | [StorableType("93829075-7B5D-4D2D-B297-64AD120B6342")]
|
---|
[13210] | 29 | public class BooleanTreeNode : SymbolicExpressionTreeTerminalNode {
|
---|
| 30 | private bool value;
|
---|
| 31 | [Storable]
|
---|
| 32 | public bool Value {
|
---|
| 33 | get { return value; }
|
---|
| 34 | private set { this.value = value; }
|
---|
| 35 | }
|
---|
| 36 |
|
---|
| 37 | [StorableConstructor]
|
---|
[17097] | 38 | protected BooleanTreeNode(StorableConstructorFlag _) : base(_) { }
|
---|
[13210] | 39 | protected BooleanTreeNode(BooleanTreeNode original, Cloner cloner)
|
---|
| 40 | : base(original, cloner) {
|
---|
| 41 | value = original.value;
|
---|
| 42 | }
|
---|
| 43 |
|
---|
| 44 | public BooleanTreeNode(BooleanValue boolValueSy) : base(boolValueSy) { }
|
---|
| 45 |
|
---|
| 46 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 47 | return new BooleanTreeNode(this, cloner);
|
---|
| 48 | }
|
---|
| 49 |
|
---|
| 50 | public override bool HasLocalParameters {
|
---|
| 51 | get { return true; }
|
---|
| 52 | }
|
---|
| 53 |
|
---|
| 54 | public override void ResetLocalParameters(IRandom random) {
|
---|
| 55 | // initialization
|
---|
| 56 | value = random.NextDouble() > 0.5;
|
---|
| 57 | }
|
---|
| 58 |
|
---|
| 59 | public override void ShakeLocalParameters(IRandom random, double shakingFactor) {
|
---|
| 60 | // mutation: flip value with 5% probability
|
---|
| 61 | if (random.NextDouble() < 0.05) value = !value;
|
---|
| 62 | }
|
---|
| 63 | }
|
---|
| 64 | } |
---|