Editorial Board
Introduction
Measuring the performance potential of chess programs
The development of a world class Othello program
Reasoning with uncertainty in computer chess
An incremental negamax algorithm
Conspiracy numbers
A generalised quiescence search algorithm
Singular extensions: Adding selectivity to brute-force searching
Perfect knowledge revisited
Forthcoming papers