|
Physical Society Colloquium
Professor M. Newborn
School of Computer Science IBM's DEEP BLUE chess program defeated Garry Kasparov in a six-game match last year, marking the first time in history that a computer defeated the reigning world champion in a regulation match. It did so by using a supercomputer, special-purpose chess hardware and 500,000 lines of software. This talk will try to examine some of the lessons learned from designing such a large system, and its implications for solving other large problems that involve searching through very large state spaces.
Friday, January 29th 1999, 15:30 |