On Wed, Jun 2, 2010 at 1:40 PM, Eric Baum <[email protected]> wrote: > Don Dailey wrote: >> >> There have been several amazing breakthroughs in computer chess over the >> years, so you don't know what you are talking about. You don't really >> believe we achieved several hundred ELO with only incremental refinements do >> you? > > OK, what are the several amazing breakthroughs?
I'll start: * Quiescence search * Alpha-beta pruning * Hash tables * Null-move heuristic _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
