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
TWO-PLAYER GAMES SEARCH ALGORITHMS
The second major application of heuristic search algorithms in Artificial Intelligence is two-player games. One of the original challenge of AI, which in
TWO-PLAYER GAMES SEARCH ALGORITHMS Read More »
LEARNING REAL-TIME A STAR
Learning Real-Time A* (LRTA*) Search If a problem is to be solved repeatedly with the same goal state but different
LEARNING REAL-TIME A STAR Read More »
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 »
COMPLEXITY IN HEURISTIC SEARCH
HEURISTIC SEARCH: COMPLEXITY OF FINDING OPTIMAL SOLUTIONS The time complexity of a heuristic search algorithm depends on the accuracy of the heuristic function.
COMPLEXITY IN HEURISTIC SEARCH Read More »
TRANSPOSITION TABLE
WHAT IS TRANSPOSITION TABLE? A transposition table is a table of previously encountered game states, together with their backed-up minimax
TRANSPOSITION TABLE Read More »