A* Algorithm (Informed Search Informed Search): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 10:3210:32, 15 February 2023Admin talk contribs 363 bytes +363 Created page with "== Time Complexity == $O(b^d)$ == Space Complexity == $O(b^d)$ (https://en.wikipedia.org/wiki/A*_search_algorithm: Stores all generated nodes in memory) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1968 == Reference == https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/document/4082128/"