首页
登录
职称英语
Early in the film "A Beautiful Mind," the mathematician John Nash is seen
Early in the film "A Beautiful Mind," the mathematician John Nash is seen
游客
2023-11-19
35
管理
问题
Early in the film "A Beautiful Mind," the mathematician John Nash is seen sitting in a Princeton court- yard, 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 inspired 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 artificial intelligence, have felt the same fascination and frustration. Programming other board games has been a relative snap. Even chess has succumbed to the power of the processor. Five years ago, a chess-playing computer called "Deep Blue" not only beat but thoroughly humbled Garry Kasparov, the world champion at that time. That is because chess, while tithe 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 depth and complexity that it can take years for a person to become a strong player. Today, 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 defend 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 proroguing a computer to mimic that process goes to the core of artificial intelligence, which involves the study of learning and decision-making, strategic think- Lug, knowledge representation, pattern recognition and perhaps most intriguingly, intuition.
Along with intuition, pattern recognition is a large part of the game. While computers are good at process- ing numbers, people are naturally good at matching patterns. Humans can recognize an acquaintance at a glance, even from the back.
Daniel Bump, a mathematics professor at Stanford, works on a program called GNU Go in his spare time.
"You can very quickly look at a chess game and see if there’s some major issue," he said. But to make a decision in Go, he said, players must learn to combine their pattern-matching abilities with the logic and knowledge they have accrued in years of playing.
One measure of the challenge the game poses is the performance of Go computer programs. The past five years have yielded incremental improvements but no breakthroughs, said David Fotland, a programmer and chip designer in San Jose, California, who created and sells The Many Faces of Go, one of the few commercial Go programs.
Part of the challenge has to do with processing speed. The typical chess program can evaluate about 500,000 positions in a second, and Deep Blue was able to evaluate some 200 million positions in a second. By mitigate, most Go programs can evaluate only a couple of dozen positions each second, said Anders Kiem if, who wrote a program called, Smart Go.
In the course of a chess game, a player has an average of 25 to 35 moves available. In Go, on the other hand, a player can choose from an average of 240 moves. A Go-playing computer would need about 30,000 years to look as far ahead as Deep Blue can with chess in three seconds, said Michael Reiss, a computer scientist in London. But the obstacles go deeper than processing power. Not only do Go programs have trouble evaluafing positions quickly; they have trouble evaluating them correctly. Nonetheless, the allure of computer Go increases as the difficulties it poses encourages programmers to advance basic work in artificial intelligence.
Reiss, an expert in neural networks, compared a human being’s ability to recognize a strong or weak position in Go with the ability to distinguish between an image of a chair and one of a bicycle. Both tasks, he said are hugely difficult for a computer. For that reason, Fotland said, "writing a strong Go program will teach us more about making computers think like people than writing a strong chess program." [br] Which of the following statements is the main idea of the passage?
选项
A、Go is a more complex game than chess.
B、Go reflects the way human beings think.
C、Go players are likely to feel frustrated.
D、Go poses a challenge to artificial intelligence.
答案
D
解析
主旨题。对应原文第二段:In recent years,computer experts,particularly those specializing in artificial intelligence,have felt the same fascination and frustration.此句即是文章的主题。答案为D。
转载请注明原文地址:http://tihaiku.com/zcyy/3199435.html
相关试题推荐
Iwish______toMalaysiawhenI,naps-inSingapore:Ihearit’sabeautifullan
—Howbeautifulyourbrother’spaintingis!—It’s______mine.A、notgoodmorethan
Thesurroundingshoreswerebeautiful,almostuniformlyclothedby______forest
Earlyinthefilm"ABeautifulMind,"themathematicianJohnNashisseen
Earlyinthefilm"ABeautifulMind,"themathematicianJohnNashisseen
Earlyinthefilm"ABeautifulMind,"themathematicianJohnNashisseen
Individuallinesofthepoemwereverybeautiful,butIdidn’tseehowthelines
Individuallinesofthepoemwereverybeautiful,butIdidn’tseehowthelines
______,mostofwhomwerewomenandchildren.A、Onthebeautifulshipareover22
Notforamoment______byherbeautifulwords.A、hehasbeendeceivedB、washed
随机试题
情景:你是小明。你放学回家后要与同学一起去踢球,家里没人。任务:请用英语给你妈妈写一张50词左右的便条。告诉她:(1)你要去做什么;(2)同谁一起去;(
[audioFiles]audio_eufm_229(20104)[/audioFiles]A、Mostchildrendonotreallystu
超声-回弹法与超声法相比,超声回弹综合法具有以下优点()。A.受混凝土含水
抗肿瘤药环磷酰胺的结构属于A.亚硝基脲类 B.氮芥类 C.三氮烯咪唑类 D
开关室内相对湿度保持在()%以下,除湿机应定期排水,防止发生柜内凝露现象,空调应
会计的基本职能之一包括( )。A.会计决策 B.会计分析 C.会计检查
A. B. C. D.
某生产白酒的企业为增值税一般纳税人,2019年5月取得含税销售收入128.7万元
对于公路、铁路、轨道交通等线性工程以及港口项目,验收调查应在工况稳定、生产负荷达
根据现行《建筑安装工程费用项目组成》(建标[2013]44号),下列建筑安装工程
最新回复
(
0
)