首页
登录
职称英语
Early in the film "A Beautiful Mind", the mathematician John Nash is seen si
Early in the film "A Beautiful Mind", the mathematician John Nash is seen si
游客
2023-12-14
25
管理
问题
Early in the film "A Beautiful Mind", the mathematician 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 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 highly 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. 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 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 programming a computer to mimic that process goes to the core of artificial intelligence, which involves the study of learning and decision-making, strategic thinking, 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 crunching 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.
"Part of the challenge has to do with processing speed. The typical chess program can evaluate about 300,000 positions in a second, and Deep Blue was able to evaluate some 200 million positions in a second. By mid-game, most Go programs can evaluate only a couple of dozen positions each second," said Anders Kierulf, who wrote a program called SmartGo.
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 evaluating positions quickly; they have trouble evaluating them correctly. Nonetheless, the allure of computer Go increases as the difficulties it poses encourage programmers to advance basic work in artificial intelligence.
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] According to the passage, what causes the fascination in programming a computer to play GO?
选项
A、The award of Nobel Prize.
B、The ambition of beating human in playing Go like Deepblue did in playing chess.
C、The possibility to advance basic work in artificial intelligence.
D、The possibility to make computers behave like man.
答案
C
解析
文章在结束出提到,“尽管围棋程序的开发如此之难,编程人员越发产生了浓厚的兴趣”可见正因为其难,一旦攻克就可以在人工智能方面取得重大进展,这正是激励科学家们的最重要原因,A、B选项流于肤浅,D选项错在“behave”,应该是“think”。
转载请注明原文地址:https://tihaiku.com/zcyy/3272177.html
相关试题推荐
Iusedtofindnotesleftinthecollectionbasket,beautifulnotesaboutmy
Earlyinthefilm"ABeautifulMind",themathematicianJohnNashisseensi
Earlyinthefilm"ABeautifulMind",themathematicianJohnNashisseensi
Earlyinthefilm"ABeautifulMind",themathematicianJohnNashisseensi
WhichareaiscalledtheGardenofEnglandandisfamousforbeautifulblossoms
Tobecalledbeautifulisthoughttonamesomethingessentialtowomen’scha
Tobecalledbeautifulisthoughttonamesomethingessentialtowomen’scha
Tobecalledbeautifulisthoughttonamesomethingessentialtowomen’scha
Tobecalledbeautifulisthoughttonamesomethingessentialtowomen’scha
Tobecalledbeautifulisthoughttonamesomethingessentialtowomen’scha
随机试题
关于抹灰的平均厚度,错误的是()。A.现浇混凝土顶棚不得大于15mm B.
下列饰面砖工程的设计要求中,哪条有误?A.外墙饰面砖的粘结应设置伸缩缝 B.伸
A.错构 B.虚构 C.器质性遗忘 D.柯萨可夫综合征 E.人为的(心因
50岁,宫颈活检确诊为"子宫颈癌",妇科检查发现癌组织浸润达阴道穹隆处,双侧宫旁
Mypianoplayinghasimprovedsignificant
禁止阻塞线采用45黄色与黑色相间的等宽条纹,宽度宜为50~150mm,长度不小于
油浸式变压器、充有可燃油的高压电容器和多油断路器等用房宜()。(A)与其他设
非代理型CM合同谈判中的焦点和难点在于()。A、确定CM费 B、确定GMP的具
(2020年真题)采用单指标法评价设计方案时,可采用的评价方法有()。A.
女,60岁,患咳嗽咳痰已8~9年。查体:可平卧,桶状胸,两肺少量湿啰音,剑突下可
最新回复
(
0
)