Games - PowerPoint PPT Presentation

About This Presentation
Title:

Games

Description:

how a computer could play chess. 1957 Allen Newell and Herb Simon predicted that: ... How much do you need to know to play chess? ... – PowerPoint PPT presentation

Number of Views:60
Avg rating:3.0/5.0
Slides: 41
Provided by: Elaine3
Category:
Tags: games | play

less

Transcript and Presenter's Notes

Title: Games


1
Games
2
The Turk
3
The Turk
  • Built by Wolfgang von Kempelen (1734 1804).

4
The Turk
  • Constructed and unveiled in 1770 to impress the
    Austro-Hungarian Empress Marie-Theresa.
  • Toured Europe and America for 85 years.
  • Destroyed by fire in 1852.
  • The secret unveiled in 1857 (some question about
    this).

5
How It Might Have Been Presented
Victorian Cut-Out Theatre 6 A Singularity of
Mind
6
Watching It Play
http//www.youtube.com/watch?vRdT4yG8wczQfeature
related
7
How Did It Work?
8
The Turk
  • How it worked
  • Exploited
  • Levers
  • Magnets
  • A candle

9
The Turk
Still fascinates people.
10
A Modern Reconstruction
Built by John Gaughan. First displayed in 1989.
Controlled by a computer. Uses the Turks
original chess board.
11
Recall How Hard Is Chess?
The 20 legal initial moves
12
Searching for the Best Move
A B C D
E F G H I
J K L M (8)
(-6) (0) (0) (2) (5)
(-4) (10) (5)
13
How Much Computation Does it Take?
  • Middle game branching factor about 35.
  • Typical game may be about 80 ply (one move for
    each player)
  • 3580 ? 3?10123
  • Number of seconds since Big Bang ? 3?1017

14
How Much Computation Does it Take?
  • Middle game branching factor about 35
  • Lookahead required to play master level chess
    about 8
  • 358 ? 2?1012
  • Number of seconds since Big Bang ? 3?1017
  • Number of sequential games since Big Bang
    150,000

15
So Could Turk Have Been Real?
16
http//www.clockwork-comics.com/2011/03/01/lost_at
_sea/
17
Ambrose Bierce
1842 1914?
18
The Devils Dictionary
  • Bore 
  • A person who talks when you wish him to listen.
  • Cannon 
  • An instrument employed in the rectification of
    national boundaries.
  • Cat 
  • A soft indestructible automaton provided by
    Nature to be kicked when things go wrong in the
    domestic circle.

19
Moxons Master
'Consciousness is the creature of Rhythm.'
http//www.sff.net/people/doylemacdonald/l_moxon.h
tm
20
Edgar Alan Poe
A replica is reburied in 2009.
http//abcnews.go.com/GMA/Weekend/edgar-allan-poe-
proper-burial-160-years/story?id8799941
MAELZEL'S CHESS-PLAYER Southern Literary
Magazine, 1836
http//www.eapoe.org/works/ESSAYS/MAELZEL.HTM
21
From Poes Article
But it is needless to dwell upon this point. It
is quite certain that the operations of the
Automaton are regulated by mind, and by nothing
else. Indeed this matter is susceptible of a
mathematical demonstration, a priori. The only
question then is of the manner in which human
agency is brought to bear.
22
From Poes Article
The Automaton does not invariably win the game.
Were the machine a pure machine this would not
be the case it would always win. The principle
being discovered by which a machine can be made
to play a game of chess, an extension of the same
principle would enable it to win a game a
farther extension would enable it to win all
games that is, to beat any possible game of an
antagonist. A little consideration will convince
any one that the difficulty of making a machine
beat all games, is not in the least degree
greater, as regards the principle of the
operations necessary, than that of making it beat
a single game.
23
Games as an Early Target of AI
  • 1950 Claude Shannon published a paper
    describing how
  • a computer could play chess
  • 1952-1962 Art Samuel built the first checkers
    program
  • 1957 Newell and Simon predicted that a computer
    will
  • beat a human at chess within 10 years (unless
    barred)
  • 1967 MacHack was good enough to achieve a
    class-C
  • rating in tournament chess.
  • 1994 Chinook became the world checkers champion
  • 1997 Deep Blue beat Kasparpov
  • 2007 Checkers is solved
  • AI in Role Playing Games now we need knowledge

24
Chess Machines
Ken Thompsons Belle computer searched about
180,000 positions per second (the super-computers
at the time were doing 5000 positions) and could
go 8 9 ply in tournament games, which enabled
it to play in the master category. It won the
world computer chess championship and all other
computer tournaments from 1980 to 1983, until it
was superseded by giant Cray X-MPs costing a
thousand times more.
25
Chess Today
In 1997, Deep Blue beat Garry Kasparov.
26
Does This Mean Its Curtains for Humans?
Special purpose hardware.
Each chip is capable of processing two to three
million positions per second. By using over 200
of these chips the overall speed of the program
could be raised to 200 million (2?108) positions
per second.
27
Does This Mean Its Curtains for Humans?
Special purpose hardware.
Each chip is capable of processing two to three
million positions per second. By using over 200
of these chips the overall speed of the program
could be raised to 200 million (2?108) positions
per second.
How much do you need to know to play chess?
28
Chess Knowledge
  • The rules generate nodes.
  • A heuristic function evaluates them.

29
Man vs Machine
http//spectrum.ieee.org/slideshow/computing/softw
are/how-computer-chess-changed-programming/?utm_so
urcetechalertutm_mediumemailutm_campaign10111
1
30
REEM-A
http//www.technovelgy.com/ct/Science-Fiction-News
.asp?NewsNum1212
31
You Can Play Anytime
http//www.caissa.com/
32
A 2013 movie set in the 1980s.
Set over the course of a weekend tournament for
chess software programmers thirty-some years ago,
Computer Chess transports viewers to a nostalgic
moment when the contest between technology and
the human spirit seemed a little more up for
grabs.
http//www.imdb.com/title/tt2007360/
33
Checkers
34
Samuels Program Learned and Improved
Suppose we have evaluated A down 8 moves. We
back up the score and remember it. Now what
happens if A shows up at a leaf node at some
later time?
35
Checkers
5?1020 possible positions
About 500 billion billion moves later, checkers
is solved http//www.sciencemag.org/cgi/conten
t/full/317/5844/1518
36
Go
  • A standard board is
  • 19 x 19
  • with 361 intersections

37
Go
An average of about 240 moves to consider. A 20
ply search would look at 4 ?1047
positions. (Recall 3 ?1017 seconds since Big
Bang.)
http//www.cosumi.net/en/
38
Go
Monte Carlo methods in MoGo
http//en.wikipedia.org/wiki/Computer_GoMonte-Car
lo_methods
39
Monte Carlo Methods
40
A Monte Carlo Example
http//www.youtube.com/watch?v-fCVxTTAtFQ
Intro, then skip to 636
41
Does This Mean Its Curtains for Humans?
42
Rubiks Cube
http//www.youtube.com/watch?vkcZw7VoD8FMfeature
player_embedded!
Write a Comment
User Comments (0)
About PowerShow.com