Depth-First Iterative Deepening (DFID) search combines the best features of breadth-first search and depth-first search. Depth-First Iterative Deepening search first performs a depth-first search to […]
DEPTH-FIRST ITERATIVE DEEPENING Read More »
Depth First Search (DFS) searches deeper into the problem space. Breadth-first search always generates successor of the deepest unexpanded node. It uses last-in
DEPTH FIRST SEARCH Read More »
If all the edges in the search graph do not have the same cost then breadth-first search generalizes to uniform-cost
UNIFORM-COST SEARCH Read More »
Breadth First Search (BFS) searches breadth-wise in the problem space. Breadth-First search is like traversing a tree where each node is
BREADTH FIRST SEARCH Read More »
Generate-and-test search algorithm is a very simple algorithm that guarantees to find a solution if done systematically and there exists
GENERATE-AND-TEST SEARCH Read More »
The most general search algorithms are brute-force searches since they do not require any domain specific knowledge. All that is
BRUTE FORCE SEARCH Read More »
Performance of bruteforce backtracking can be improved by using a number of techniques such as variable ordering, value ordering, back
INTELLIGENT BACKTRACKING Read More »
Limited Discrepancy Search (LDS) is a completely general tree-search algorithm, but is most useful in the context of constraint satisfaction
LIMITED DISCREPANCY SEARCH Read More »
The idea of quiescence is that the static evaluator should not be applied to positions whose values are unstable, such as those
One of the most elegant of all AI search algorithms is alpha-beta pruning. The idea, similar to branch-and-bound, is that
ALPHA BETA PRUNING Read More »