Early in the film A Beautiful Mind, the
1
John Nash is seen sitting in a Princeton courtyard, hunched over a playing board covered with small black and white pieces that look like pebbles. He was playing Go, an ancient Asian game. Frustration at losing that game
2
the real Nash to pursue the mathematics of game theory, research for which he eventually was awarded a Nobel Prize.
In recent years, computer experts, particularly those specializing in
3
intelligence, have felt the same fascination and
4
. Programming other board games has been a relative snap. Even chess has
5
to the power of the processor. Ten years ago, a chess-playing computer called Deep Blue not only beat but
6
humbled Garry Kasparov, the world champion at that time. That is because chess, while
7
complex, can be reduced to a matter of brute force computation. Go is different. Deceptively easy to learn, either for a computer or a human, it is a game of such
8
and complexity that it can take years for a person to become a strong player. To date, no computer has been able to achieve a skill level beyond that of the casual player.
The game is played on a board divided into a grid of 19 horizontal and 19 vertical lines. Black and white pieces called stones are placed one at a time on the grid"s intersections. The object is to acquire and
9
territory by surrounding it with stones. Programmers working on Go see it as more accurate than chess in reflecting the ways the human mind works. The challenge of programming a computer to mimic that process goes to the core of artificial intelligence, which involves the study of learning and decision-making,
10
thinking, knowledge representation, pattern recognition and perhaps most intriguingly, intuition.
A. highly B. pushed C. mathematician D. thoroughly
E. strategic F. frustration G. succumbed H. inspired
I. artificial J. grand K. depth L. occupy
M. profound N. defend O. obsession