Package mazealgo.model.algorithms.search

Interface ISearchable

All Known Implementing Classes:
SearchableMaze, SearchableMaze3D
public interface ISearchable
A search problem: knows its start, its goal, and how to enumerate the legal successors of any given state. The domain also owns its own heuristic so informed searchers (e.g. BestFirstSearch) don't need to know the concrete state types.

  • Method Details

    • getStartState

      AState getStartState()

    • getGoalState

      AState getGoalState()

    • getAllPossibleStates

      List<AState> getAllPossibleStates(AState state)

    • heuristic

      default double heuristic(AState from, AState to)
      Estimated remaining cost from from to to, used by informed searchers. Must be admissible (never overestimate) for A* to return an optimal path. Default is 0, which makes any informed searcher fall back to plain Dijkstra.