Turing test

State Space search
  State
  Operator
    Partial function  
    Precondition
  Move
  Goal state
  State space
  Branching factor
  Combinatorial explosion
  Counting distinct states of simple problems
  Towers of Hanoi Problems
  Tic-Tac-Toe
  Missionaries and Cannibals Problem
  The Farmer, Fox, Chicken and Grain Problem
  Problem formulation
  Path
  Depth-First Search
  Breadth-First Search
  Uniform-Cost Search
  Best-First Search
  A* Search
    heuristic function
    admissibility of a heuristic
    consistency of a heuristic
  Iterative Deepening Depth-First Search
  Genetic search
  Simulated annealing
  Case-based reasoning

Adversarial Search
  Two-Person Zero-Sum Game
  Minimax Search
  Static Evaluation Function
  Alpha-Beta Pruning
  Zobrist Hashing
    Bitwise exclusive-or
    finding a child state's hash value from that of its parent
  
Probabilistic decision making
  Random variable
    Domain
    Probability distribution
    Expectation
  Expectimax search
  Markov Decision Process
    Definition
    Matrix representation
    State-transition diagram
    Living reward, cost of living
  Utility using finite horizons
  Utility using discount factors
  Policy
  Expected value of a state
  Q-State
  Expected value of a Q-state
  Bellman equations
  Bellman updates
  Value Iteration