public AStarMax(INode initialNode, IPrunningMethod prunningMethod, IGoalCheckMethod goalCheckMethod) : base(initialNode, prunningMethod, goalCheckMethod)
        {
            var maxComparer = new MaxComparer();

            openList = new SortedList <int, INode>(maxComparer);
            openList.Add(initialNode);
        }
        public GreedyLoopMax(INode initialNode, IGoalCheckMethod goalCheckMethod, int loops) : base(initialNode, new NoPrunning(), goalCheckMethod)
        {
            var maxComparer = new MaxComparer();

            _initialNode = initialNode;
            _iterationsSinceLastImprovement = 0;
            _lastBestG = 0;
            _loops     = loops;
        }
Esempio n. 3
0
 public Solver(INode initialNode, IPrunningMethod prunningMethod, IGoalCheckMethod goalCheckMethod)
 {
     Expended        = 0;
     Generated       = 0;
     AlgPruned       = 0;
     ExternalPruned  = 0;
     PrunningMethod  = prunningMethod;
     GoalCheckMethod = goalCheckMethod;
     if (GoalCheckMethod.ValidGoal(initialNode))
     {
         candidateGoalNode = initialNode;
     }
 }
 public AStarMax(INode initialNode, IGoalCheckMethod goalCheckMethod) : this(initialNode, new NoPrunning(), goalCheckMethod)
 {
 }
Esempio n. 5
0
        public GreedyMax(INode initialNode, IGoalCheckMethod goalCheckMethod) : base(initialNode, new NoPrunning(), goalCheckMethod)
        {
            var maxComparer = new MaxComparer();

            _head = initialNode;
        }
 public DfBnbMax(INode initialNode, IPrunningMethod prunningMethod, IGoalCheckMethod goalCheckMethod) : base(initialNode, prunningMethod, goalCheckMethod)
 {
     openList = new Stack <INode>();
     openList.Push(initialNode);
 }