1 / 16

How Computers Play Chess

Artificial Intelligence 101. How Computers Play Chess. Peter Barnum November 15, 2007. “This … raises the question ‘Can a machine play chess?’ It could fairly easily be made to play a rather bad game. It would be bad because chess requires intelligence.” –Alan Turing 1946.

chace
Download Presentation

How Computers Play Chess

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Artificial Intelligence 101 How Computers Play Chess Peter Barnum November 15, 2007

  2. “This … raises the question ‘Can a machine play chess?’ It could fairly easily be made to play a rather bad game. It would be bad because chess requires intelligence.” –Alan Turing 1946

  3. “The decisive game of the match was Game 2…we saw something that went beyond out wildest expectations…The machine refused to move to a position that had a decisive short-term advantage - showing a very human sense of danger.” – Garry Kasparov 1997

  4. What move should we make?

  5. How a computer decides

  6. How a computer decides

  7. How a computer decides

  8. How a computer decides

  9. How a computer decides

  10. How a computer decides

  11. Uh oh!

  12. Adversarial search “If I make this move, what’s the worst thing my opponent could do?”

  13. Examining all possible moves Can I make a move that will allow me to win and prevent my opponent from winning? …

  14. Wait, that’s easy! 35 x35 x35 …=35N For a game with 6 moves per player: 3512=3,379,200,000,000,000,000 possibilities If a computer can check one billion moves per second, it would take over 100 years

  15. What to do? • Can we avoid searching all possibilities? • Can we pre-compute anything? • Can we approximate the search?

  16. References • Stuart Russell and Peter Norvig Artificial Intelligence: A Modern Approach • Stanford Encyclopedia of Philosophy

More Related