#region License Information /* HeuristicLab * Copyright (C) 2002-2013 Heuristic and Evolutionary Algorithms Laboratory (HEAL) * * This file is part of HeuristicLab. * * HeuristicLab is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * HeuristicLab is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with HeuristicLab. If not, see . */ #endregion using HeuristicLab.Common; using HeuristicLab.Core; using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding; using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; namespace HeuristicLab.Problems.Robocode { [StorableClass] public class BooleanTreeNode : SymbolicExpressionTreeTerminalNode { private bool value; [Storable] public bool Value { get { return value; } private set { this.value = value; } } [StorableConstructor] protected BooleanTreeNode(bool deserializing) : base(deserializing) { } protected BooleanTreeNode(BooleanTreeNode original, Cloner cloner) : base(original, cloner) { value = original.value; } public BooleanTreeNode() : base(new LogicalValue()) { } public override IDeepCloneable Clone(Cloner cloner) { return new BooleanTreeNode(this, cloner); } public override bool HasLocalParameters { get { return true; } } public override void ResetLocalParameters(IRandom random) { value = random.Next(0, 2) == 1; } } }