Package mazealgo.model.algorithms.search

Class BestFirstSearch

java.lang.Object

mazealgo.model.algorithms.search.ASearchingAlgorithm

mazealgo.model.algorithms.search.BreadthFirstSearch

mazealgo.model.algorithms.search.BestFirstSearch

All Implemented Interfaces:

ISearchingAlgorithm

public class BestFirstSearch
extends BreadthFirstSearch

Best First Search algorithm. It works just like Breadth First Search (BFS), but instead of exploring equally in all directions, it uses a "smart" queue (a priority queue) to decide where to go next. It prioritizes states based on their actual cost so far PLUS an estimated cost to the goal, obtained from the domain's own heuristic. This makes it act like A*, finding the cheapest path while exploring far fewer nodes than BFS - assuming the domain provides an admissible heuristic.

Field Summary

Fields inherited from class mazealgo.model.algorithms.search.BreadthFirstSearch

openList

Fields inherited from class mazealgo.model.algorithms.search.ASearchingAlgorithm

numberOfNodesEvaluated

Constructor Summary

Constructors

Constructor	Description
BestFirstSearch()

Method Summary

Modifier and Type	Method	Description
String	getName()
Solution	solve(ISearchable domain)

Methods inherited from class mazealgo.model.algorithms.search.BreadthFirstSearch

reset

Methods inherited from class mazealgo.model.algorithms.search.ASearchingAlgorithm

buildSolution, getNumberOfNodesEvaluated, onNodeEvaluated, setNodeEvaluatedListener

Methods inherited from class java.lang.Object

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

Constructor Details

BestFirstSearch

public BestFirstSearch()

Method Details

solve

public Solution solve(ISearchable domain)

Specified by:

solve in interface ISearchingAlgorithm

Overrides:

solve in class BreadthFirstSearch

getName

public String getName()

Specified by:

getName in interface ISearchingAlgorithm

Overrides:

getName in class BreadthFirstSearch