| Display title | Fringe search |
| Default sort key | Fringe search |
| Page length (in bytes) | 5,758 |
| Namespace ID | 0 |
| Page ID | 234431 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>OrgMain |
| Date of page creation | 21:03, 6 March 2023 |
| Latest editor | imported>OrgMain |
| Date of latest edit | 21:03, 6 March 2023 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | 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... |
