X

Download How computers play chess PowerPoint Presentation

SlidesFinder-Advertising-Design.jpg

Login   OR  Register
X


Iframe embed code :



Presentation url :

Home / Sports & Recreation / Sports & Recreation Presentations / How computers play chess PowerPoint Presentation

How computers play chess PowerPoint Presentation

Ppt Presentation Embed Code   Zoom Ppt Presentation

PowerPoint is the world's most popular presentation software which can let you create professional How computers play chess powerpoint presentation easily and in no time. This helps you give your presentation on How computers play chess in a conference, a school lecture, a business proposal, in a webinar and business and professional representations.

The uploader spent his/her valuable time to create this How computers play chess powerpoint presentation slides, to share his/her useful content with the world. This ppt presentation uploaded by onlinesearch in Sports & Recreation ppt presentation category is available for free download,and can be used according to your industries like finance, marketing, education, health and many more.

About This Presentation

Slide 1 - How Computers Play Chess Peter Barnum November 15, 2007 Artificial Intelligence 101
Slide 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
Slide 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
Slide 4 - What move should we make?
Slide 5 - How a computer decides
Slide 6 - How a computer decides
Slide 7 - How a computer decides
Slide 8 - How a computer decides
Slide 9 - How a computer decides
Slide 10 - How a computer decides
Slide 11 - Uh oh!
Slide 12 - “If I make this move, what’s the worst thing my opponent could do?” Adversarial search
Slide 13 - Examining all possible moves … Can I make a move that will allow me to win and prevent my opponent from winning?
Slide 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
Slide 15 - What to do? Can we avoid searching all possibilities? Can we pre-compute anything? Can we approximate the search?
Slide 16 - Stuart Russell and Peter Norvig Artificial Intelligence: A Modern Approach Stanford Encyclopedia of Philosophy References