![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Friday 18 February 2011, 16:00-16:30
The Deep Blue chess algorithm
- đ¤ Speaker: Pascal Bugnion
- đ Date & Time: Friday 18 February 2011, 16:00 - 16:30
- đ Venue: TCM Seminar Room, Cavendish Laboratory
Questions? Contact
Daniel Cole
Abstract
In 1997, Deep Blue, a purpose-built IBM computer, defeated Garry Kasparov to become the first ever machine to beat the top-ranked player worldwide.
We discuss briefly the features of the algorithm used in Deep Blue, and even more briefly the manner in which the algorithm was implemented.
The talk is based on: Campbell, Hoan, Hsu, Deep Blue, Artificial Intelligence, Vol. 134, Issues 1-2, January 2002, pp 57-83.
Series This talk is part of the TCM Journal Club series.
Included in Lists
- All Cavendish Laboratory Seminars
- All Talks (aka the CURE list)
- Centre for Health Leadership and Enterprise
- Featured lists
- ME Seminar
- Neurons, Fake News, DNA and your iPhone: The Mathematics of Information
- Quantum Matter Journal Club
- School of Physical Sciences
- TCM Journal Club
- TCM Seminar Room, Cavendish Laboratory
- Thin Film Magnetic Talks
- TQS Journal Clubs
Note: Ex-directory lists are not shown.