Scribd
Upload
10 views16 pages

How Computers Analyze Chess Moves

The document discusses how computers play chess, highlighting the challenges of making intelligent moves in the game. It references Alan Turing's early thoughts on machine intelligence and Garry Kasparov's observations of a computer's strategic decision-making. The text also addresses the complexity of chess and the need for efficient search algorithms to evaluate possible moves.

Uploaded by

cuong.nguyenmanh1
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
10 views16 pages

How Computers Analyze Chess Moves

The document discusses how computers play chess, highlighting the challenges of making intelligent moves in the game. It references Alan Turing's early thoughts on machine intelligence and Garry Kasparov's observations of a computer's strategic decision-making. The text also addresses the complexity of chess and the need for efficient search algorithms to evaluate possible moves.

Uploaded by

cuong.nguyenmanh1
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd

How Computers Play Chess

Artificial Intelligence 101

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
“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
What move should we make?
How a computer decides
How a computer decides
How a computer decides
How a computer decides
How a computer decides
How a computer decides
Uh oh!
Adversarial search

“If I make this move, what’s the worst thing


my opponent could do?”
Examining all possible moves

Can I make a move that will allow me to win and


prevent my opponent from winning?
Wait, that’s easy!

35x35x35…=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
What to do?

•Can we avoid searching all possibilities?


•Can we pre-compute anything?
•Can we approximate the search?
References
• Stuart Russell and Peter Norvig Artificial
Intelligence: A Modern Approach
• Stanford Encyclopedia of Philosophy

You might also like