public PlayerNode(LogarithmicGrid grid, SearchTree searchTree, int sum) : base(grid, searchTree, sum) { this.heuristicLazy = new Lazy <double>(() => this.SearchTree.Heuristic.Evaluate(this), false); this.possibleStatesLazy = new Lazy <IEnumerable <KeyValuePair <Move, LogarithmicGrid> > >(this.GetPossibleStates, false); this.gameOverLazy = new Lazy <bool>(this.GetGameOver, false); }
public ComputerNode(LogarithmicGrid grid, SearchTree searchTree, int sum) : base(grid, searchTree, sum) { }
protected Node(LogarithmicGrid grid, SearchTree searchTree, int sum) { this.Grid = grid; this.SearchTree = searchTree; this.Sum = sum; }
public PlayerNode(LogarithmicGrid grid, SearchTree searchTree, int sum) : base(grid, searchTree, sum) { this.heuristicLazy = new Lazy<double>(() => this.SearchTree.Heuristic.Evaluate(this), false); this.possibleStatesLazy = new Lazy<IEnumerable<KeyValuePair<Move, LogarithmicGrid>>>(this.GetPossibleStates, false); this.gameOverLazy = new Lazy<bool>(this.GetGameOver, false); }
public TraverseBenchmark() { var rootGrid = LogarithmicGrid.Parse(StartgingNode); this.searchTree = new SearchTree(null, rootGrid); }