Informed Search

From Algorithm Wiki
Revision as of 10:57, 10 October 2022 by Admin (talk | contribs) (Created page with "== Problem Description== Informed search tries to reduce the amount of search that must be done by making intelligent choices for the nodes that are selected for expansion. == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Problem Description

Informed search tries to reduce the amount of search that must be done by making 

intelligent choices for the nodes that are selected for expansion.

Bounds Chart

Informed SearchBoundsChart.png

Step Chart

Informed SearchStepChart.png

Improvement Table

Complexity Classes Algorithm Paper Links Lower Bounds Paper Links
Exp/Factorial
Polynomial > 3
Cubic
Quadratic
nlogn
Linear
logn
Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Informed_Search&oldid=92"