Midterm Examination
CSE 415: Introduction to Artificial Intelligence
The University of Washington, Seattle, Spring 2016
Date: Monday, April 25, 2016
Format: Several short-answer questions, with a few longer-answer questions possible.
Topics:
Turing test

Python
  Lists
    slices
    concatenation
    copying
    list comprehensions

  Functions
    def
    default values of arguments
    lambda
    local and global variables
    recursive functions

  Dictionaries

ISA hierarchies
  Binary relations and the partial-order properties:
    Reflexiveness, Antisymmetry, Transitivity.
    Inferrable conclusions, Detecting redundancy
    Also, symmetry.

State Space search
  State
  Operator
    Move
    Partial function  
    Precondition
  Goal state
  Problem formulation
  Path
  Depth-First Search
  Breadth-First Search
  Uniform-Cost Search
  Best-First Search
  A* Search
    heuristic function
    admissibility of A*
  Iterative Deepening Depth-First Search
  Two-Person, Zero-sum games
    minimax search
    alpha-beta pruning
    static evaluation functions
      Tic-tac-toe
      Checkers
    Zobrist hashing
  Genetic search
  Simulated annealing
  Case-based reasoning