We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byJudith Wilkerson
Modified over 2 years ago
The Turk First chess playing machine, made in 1770.
Computing Machines Begin to appear in 1940's
Claude Shannon Father of Information Theory & Computer Chess
Position Evaluation Chess position is evaluated to assign a value Value = 2.1
Minimax Algorithm Values propagate up to give better estimate
Type A Strategy Examine all variations to a fixed depth
Type B Strategy Examine selected variations to variable depth
First Program Written in 1957, 7 years after Shannon's paper
Alpha Beta Pruning Doubles how deep computers can look ahead
First Milestone Computer defeats 1500 rated player in 1967
The Bet Levy bet a computer could not beat him in 10 years
Levy Wins In 1978 Levy wins the bet
Fredkin Prize $100,000 to beat the world chess champion
Personal Chess Computer Annual sales of $100 million
Garry Kasparov Became world chess champion in 1985
Deep Thought First chip designed to play only chess
Deep Blue IBM takes interest in computer chess
2010 PC chess programs defeat world champion
Future Humans will always enjoy chess
Arimaa Playable with a chess set, but different rules
Bobby Fischer Proposed random initial setup for chess
Aamir Arimaa is aamir backwards with a leading A
Arimaa is Difficult High branching factor, no opening books, few captures
Arimaa Challenge $10,000 to beat top human players before 2020
Arimaa and AI Will require a breakthrough in AI before 2020
Questions More info at www.arimaa.com
Luca Weibel Honors Track: Competitive Programming & Problem Solving Partisan game theory.
Adversarial Search Reference: “Artificial Intelligence: A Modern Approach, 3 rd ed” (Russell and Norvig)
Adversarial Search Board games. Games 2 player zero-sum games Utility values at end of game – equal and opposite Games that are easy to represent Chess.
G5AIAI Introduction to AI Graham Kendall Game Playing Garry Kasparov and Deep Blue. © 1997, GM Gabriel Schwartzman's Chess Camera, courtesy IBM.
Instructor: Vincent Conitzer
Games and adversarial search
Today’s Topics Playing Deterministic (no Dice, etc) Games –Mini-max – - pruning –ML and games? 1997: Computer Chess Player (IBM’s Deep Blue) Beat Human.
Games & Adversarial Search Chapter 6 Section 1 – 4.
Mastering Chess An overview of common chess AI Adam Veres.
ICS-270a:Notes 5: 1 Notes 5: Game-Playing ICS 270a Winter 2003.
MIU Mini-Max Graham Kendall Game Playing Garry Kasparov and Deep Blue. © 1997, GM Gabriel Schwartzman's Chess Camera, courtesy IBM.
Parallel Programming in Chess Simulations Tyler Patton.
Lecture 13 Last time: Games, minimax, alpha-beta Today: Finish off games, summary.
1 Adversarial Search Chapter 6 Section 1 – 4 The Master vs Machine: A Video.
Chess Applications:Alpha- Beta Search Greg Parker ‘03 Senior Thesis Advisor: Andrew Appel.
Adversarial Search Chapter 6 Section 1 – 4. Types of Games.
Adversarial Search Chapter 5.
AI for Connect-4 (or other 2-player games) Minds and Machines.
© 2017 SlidePlayer.com Inc. All rights reserved.