COMPUTER SYSTEMS RESEARCH
Othello and Game programming

  1. Strategy guide (scroll down to Introduction to Strategy)
  2. Basic othello strategy
  3. Strategy and board game programming (UCI)
  4. Project Othello at Columbia
  5. Blind search algorithms, no heuristics, breadth-first, depth-first, depth-limited, iterative deepening
  6. AStar demonstration, heuristic search, f = h + g, where h is the estimated cost to reach the goal, g is the actual cost so far in the search, f is the sum of these two.
  7. Slides from Russell/Norvig (see slide 6 for a picture)
  8. Minimax algorithm
  9. genetic algorithms also GA's explained