aima.core.search.informed

Class GreedyBestFirstEvaluationFunction

java.lang.Object

aima.core.search.informed.HeuristicEvaluationFunction

aima.core.search.informed.GreedyBestFirstEvaluationFunction

All Implemented Interfaces:

EvaluationFunction

public class GreedyBestFirstEvaluationFunction
extends HeuristicEvaluationFunction

Artificial Intelligence A Modern Approach (3rd Edition): page 92.

Greedy best-first search tries to expand the node that is closest to the goal, on the grounds that this is likely to lead to a solution quickly. Thus, it evaluates nodes by using just the heuristic function; that is, f(n) = h(n)

Author:

Ciaran O'Reilly

Field Summary

Fields inherited from class aima.core.search.informed.HeuristicEvaluationFunction

hf

Constructor Summary

Constructors

Constructor and Description
GreedyBestFirstEvaluationFunction() Note: Do not forget to heuristic function before starting the search!
GreedyBestFirstEvaluationFunction(HeuristicFunction hf)

Method Summary

Modifier and Type	Method and Description
double	f(Node n)

Methods inherited from class aima.core.search.informed.HeuristicEvaluationFunction

getHeuristicFunction, setHeuristicFunction

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

GreedyBestFirstEvaluationFunction

public GreedyBestFirstEvaluationFunction(HeuristicFunction hf)

GreedyBestFirstEvaluationFunction

public GreedyBestFirstEvaluationFunction()

Note: Do not forget to heuristic function before starting the search!

Method Detail

f

public double f(Node n)