Fringe, | search
Click here to view Fringe, news from 60+ newspapers.
Bookmark or Share- Why is A* optimal if the heuristic function is admissible?The tree search does not remember which states it has already visited, only the "fringe" of states it hasn't visited yet. A graph search is a general search strategy for searching graph-structured problems, where it's possible to double back to an earlier state, like in chess (e.g. both players can just move their kings back and forth).
- What is the difference between tree search and graph search?There is always a lot of confusion about this concept, because the naming is misleading, given that both tree and graph searches produce a tree (from which you can derive a path) while exploring the search space, which is usually represented as a graph.
- What are the differences between A* and greedy best-first search?However, A* needs to keep all nodes in memory while searching, not just the ones in the fringe, because A*, essentially, performs an "exhaustive search" (which is "informed", in the sense that it uses a heuristic function).
- How is iterative deepening A* better than A*?The iterative deepening A* search is an algorithm that can find the shortest path between a designated start node and any member of a set of goals. The A* algorithm evaluates nodes by combining the
- What is the fringe in the context of search algorithms?In English, the fringe is (also) defined as the outer, marginal, or extreme part of an area, group, or sphere of activity. In the context of AI search algorithms, the state (or search) space is usually represented as a graph, where nodes are states and the edges are the connections (or actions) between the corresponding states.
More
