重磅消息：谷歌人工智能分先5:0击败欧洲冠军樊辉职业二段，16年3月将分先挑战李世石

yang738

重磅消息：谷歌人工智能分先5:0击败欧洲职业围棋冠军（樊辉职业二段)，2016年3月将分先挑战李世乭

一个月前，DeepMind创始人Demis Hassabis曾说道很快会有关于围棋研究的惊喜，而1月28日的《Nature》杂志即将以封面论文的形式介绍Google旗下人工智能公司DeepMind开发的一款名为AlphaGo的人工智能，它已经击败了欧洲围棋冠军，并将于3月与世界冠军李世乭对战。该程序采用了两个深度神经网络，policy network与value network，极大地降低了需要考虑的搜索空间的复杂度，前者降低搜索的广度，后者降低搜索的深度，很像人脑在下围棋时凭直觉快速锁定策略的思维。


Nature封面

1月28日的《Nature》杂志上即将以封面论文报道一种能在传统策略游戏，围棋上击败专业选手的电脑程序。围棋被认为是人工智能领域一个具有标志性的“大挑战”，这源于围棋巨大的搜索空间，很难估计局面和下子。这项发现可能为其他看似棘手的人工

智能领域实现人类级别的能力带来希望。

围棋游戏起源于中国，两个选手在矩形格子上交换下黑子和白子，目标是在比赛结束时比对方占领更多的地盘。迄今最成功的围棋计算机程序能达到业余人类选手的程度，但还不能和专业选手在不让子的情况下平局。

David Silver, Aja Huang 和 Demis Hassabis 和他们的团队开发了一个叫”AlphaGo“的程序，利用“价值网络”去计算局面，用“策略网络”去选择下子。训练这些深度神经网络的，是对人类专业棋局的监督学习以及让它和自己对弈的增强学习。AlphaGo在和其他围棋程序的对抗中获得了99.8%的胜率，并且在一项竞赛中以5比0的成绩战胜了人类欧洲围棋冠军。这是第一次计算机程序能

在不让子的情况下，在完整的围棋游戏中击败专业选手——原本认为十年后人工智能才能达到的成就。

AlphaGo的下一个挑战将是李世乭，过去十年被认为是世界围棋冠军，比赛将于三月份在首尔举行。

去年年底，机器之心曾预告，Google旗下人工智能公司DeepMind的CEO Demis Hassabis在一次采访中透露他们可能已经攻克了世界最难的棋类游戏——中国围棋。（神秘的人工智能公司DeepMind可能破解了围棋）而现在，这个重磅消息即将刊登在1月28日的《Nature》杂志封面上。

以下是Demis Hassabis去年接受采访的视频：
字幕由机器之心翻译出品
到底AlphaGo能不能战胜世界冠军呢？让我们拭目以待三月的对弈吧！

yang738

Google AlphaGo computer beats professional at 'world's most complex board game' Go

It was considered one of the last great challenges between man and machine but now, for the first time, a computer program has beaten a professional player of the ancient Chinese game of Go in a defeat that many had not expected for at least another 10 years.

The machine’s victory is being likened to the defeat of reigning world chess champion Garry Kasparov in 1997 by IBM’s Deep Blue computer, which became a milestone in the advance of artificial intelligence over the human mind.

Go, however, is more complex than chess with an infinitely greater number of potential moves, so experts were surprised to find that computer scientists had invented a suite of artificial intelligence (AI) algorithms that taught the computer how to win against Europe’s top player.


READ MORE
'Artificial intelligence alarmists' win 'Luddite of the Year' award
The program, called AlphaGo, defeated European champion Fan Hui by a resounding five games to nil in a match played last October but only now revealed in a scientific study of the moves and algorithms published last night in the journal Nature. A match against the current world Go champion, Lee Sedol from South Korea, is now scheduled for March.

It was the first time a computer had won against a professional Go player on a full-sized board without any handicaps or advantages given to either side, said Demis Hassabis of Google DeepMind, the AI arm of Google in London, who helped to write the program.

Go rules

The rules of Go are deceptively simple and no luck is involved. Two players – one black, one white –  start with an empty board by placing one of their pieces or “stones” on a position, from where it does not move. The winner is the first to fill more than half the board with their stones. It is possible to take an opponent’s stone by completely surrounding it with your stones. Children and adults can easily play against each other and a handicap system allows players of different strengths to play with a 50 per cent chance of winning.
“Go is the probably the most complex board game humans play. There are more configurations of the board than there are atoms in the Universe. In the end, AlphaGo won 5-nil and it was perhaps stronger than even we were expecting,” Mr Hassabis said.

“AlphaGo discovered for itself many of the patterns and moves needed to play Go. Go is considered to be the pinnacle of AI research – the holy grail. For us, it was an irresistible challenge,” he said.

Computer chess programs work by analysing every possible move on the board but this is relatively straightforward when there are about 20 possible moves for each stage of the game. In Go, however, there are about 200 possible moves, making the task of writing a winning program far more difficult.

yang738

Milestones in AI Research

1950: British mathematician Alan Turing published a landmark study speculating on the possibility of creating machines that can think – as defined by his Turing Test.

1956: The field of Artificial Intelligence (AI) or “machine intelligence” was born with the Dartmouth Conference of researchers including Marvin Minsky talking about creating an artificial brain.

1980s: Concept of “expert systems” widely adopted by computer companies as the first commercial exploitation of AI.

1989: Carnegie Mellon University developed Deep Thought, an expert system that could play chess as well as a grand master.

1997: IBM’s Deep Blue computer beats reigning world chess champion Garry Kasparov for the first time.

2005: A Stanford University robot won the Darpa Grand Challenge by driving autonomously for 131 miles along a rehearsed desert track.

2011: IBM’s Watson, a question-answering computer, defeated the two greatest champions in the American quiz show Jeopardy!, Brad Rutter and Ken Jennings. Watson won $1m first prize.

netstat

yang738

The first game mastered by a computer was noughts and crosses (also known as tic-tac-toe) in 1952.
Then fell checkers in 1994.
In 1997 Deep Blue famously beat Garry Kasparov at chess. It’s not limited to board games either—IBM's Watson [PDF] bested two champions at Jeopardy in 2011, and in
2014 our own algorithms learned to play dozens of Atari games just from the raw pixel inputs.

But to date, Go has thwarted AI researchers; computers still only play Go as well as amateurs


1952  tic-tac-toe
1994  checker
1997  chess
2014  chinese chess
2016  go

Gladwin

牛呀

yaol

距离人类毁灭又近了一步

billwong999

好消息，等了很久了。但可能也是坏消息，离机器人统治世界又近了一步

css2015

细思极恐

静好如初

不是说这两人差距还是蛮大的？当然李世石还比不上柯洁就是了~