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 »
SEMANTIC NETS
A semantic net (or semantic network) is a knowledge representation technique used for propositional information. So it is also called a propositional net. Semantic
FRAMES
WHAT ARE FRAMES? Natural language understanding requires inference i.e., assumptions about what is typically true of the objects or situations
RULE BASED EXPERT SYSTEMS
Rules are the popular paradigm for representing knowledge. A rule based expert system is one whose knowledge base contains the domain knowledge
RULE BASED EXPERT SYSTEMS Read More »