public HeuristicSearchNode < O , T > makeNode ( Successor successor ) throws SearchNotExhaustiveException { HeuristicSearchNode < O , T > node = ( HeuristicSearchNode < O , T > ) super . makeNode ( successor ) ; // Make sure the new node has a reference to the heuristic evaluator node . heuristic = this . heuristic ; // Compute h for the new node node . computeH ( ) ; return node ; }
Returns a new node based on a successor of this node . This new node will also be a HeuristicSearchNode .