GreedyBestFirstSearch.java

package aima.core.search.informed;

import aima.core.search.framework.evalfunc.HeuristicFunction;
import aima.core.search.framework.qsearch.QueueSearch;

/**
 * Artificial Intelligence A Modern Approach (3rd Edition): page 92.<br>
 * <br>
 * 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 Ravi Mohan
 * @author Mike Stampone
 */
public class GreedyBestFirstSearch extends BestFirstSearch {

	/**
	 * Constructs a greedy best-first search from a specified search space
	 * exploration strategy and a heuristic function.
	 * 
	 * @param impl
	 *            a search space exploration strategy (e.g. TreeSearch,
	 *            GraphSearch).
	 * @param hf
	 *            a heuristic function <em>h(n)</em>, which estimates the
	 *            cheapest path from the state at node <em>n</em> to a goal
	 *            state.
	 */
	public GreedyBestFirstSearch(QueueSearch impl, HeuristicFunction hf) {
		super(impl, new GreedyBestFirstEvaluationFunction(hf));
	}
}