Fringe search
id:
fringe-search-287-15897907
title:
Fringe search
text:
In computer science, fringe search is a graph search algorithm that finds the least-cost path from a given initial node to one goal node. In essence, fringe search is a middle ground between A* and the iterative deepening A* variant (IDA*). If g(x) is the cost of the search path from the first node to the current, and h(x) is the heuristic estimate of the cost from the current node to the goal, then ƒ(x) = g(x) + h(x), and h* is the actual path cost to the goal. Consider IDA*, which does a recur
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Fringe_search
date created:
date modified:
2023-02-27T22:53:55Z
main entity:
{"identifier":"Q5504599","url":"https://www.wikidata.org/entity/Q5504599"}
image:
fields total:
13
integrity:
13