ITERATIVE DEEPENING A STAR
Iterative Deepening A* (IDA*) Search Just as iterative deepening solved the space problem of breadth-first search, iterative deepening A* (IDA*) eliminates […]
ITERATIVE DEEPENING A STAR Read More »
PURE HEURISTIC SEARCH
The simplest of heuristic search algorithms, the pure heuristic search, expands nodes in order of their heuristic values h(n). It
PURE HEURISTIC SEARCH Read More »
A STAR ALGORITHM
The A* algorithm combines features of uniform-cost search and pure heuristic search to efficiently compute optimal solutions. A* algorithm is a best-first search algorithm
DEPTH FIRST SEARCH
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 »
UNIFORM-COST SEARCH
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 »
ALPHA BETA PRUNING
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 »
MINIMAX SEARCH
The standard algorithm for two-player perfect-information games such as chess, checkers or othello is minimax search with heuristic static evaluation. The minimax
UNIFORM-COST SEARCH ALGORITHM
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 ALGORITHM Read More »
DEPTH FIRST SEARCH
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 »