COMPUTER SYSTEMS RESEARCH
Othello and Game programming
- Strategy guide (scroll down to Introduction to Strategy)
- Basic othello strategy
- Strategy and board game programming (UCI)
- Project Othello at Columbia
- Blind search algorithms, no heuristics, breadth-first, depth-first, depth-limited, iterative deepening
- 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.
- Slides from Russell/Norvig (see slide 6 for a picture)
- Minimax algorithm
- genetic algorithms
also
GA's explained