Human Go Champion 'Speechless' After 2nd Loss To Machine (phys.org)
Reader chasm22 points to a Phys.org report about the second straight loss of Lee Sedol to AlphaGo, the program developed by Google's DeepMind unit. The human Go champion, Sedol found himself "speechless" after the showdown on Thursday. The human versus machine face-off lasted more than four hours, which to Sedol's credit is a slight improvement over his previous match, which had ended with him resigning nearly half an hour remaining on the clock.
"It was a clear loss on my part," Sedol said at a press conference on Thursday. "From the beginning there was no moment I thought I was leading." Demis Hassabis, who heads Google's DeepMind, said, "Because the number of possible Go board positions exceeds the number of atoms in the universe, top players rely heavily on their intuition."
Sedol will battle Google's AlphaGo again on Saturday, Sunday, and Tuesday.
Having a competitive Go engine capable of beating a 9-dan player is huge. Huge.
something something.... overlords... something something....
In Capitalist US, the commerce controls the Government.
They tried to program a computer to play Magic The Gathering, but the computer immediately received a wedgie, and was stuffed into a locker.
AI's will also never best you at sitting on the couch in your parents' basement eating cheetos and watching anime. Your skillz are safe.
Sedol will battle Google's AlphaGo again on Saturday, Sunday, and Tuesday.
Note that for many people in the western hemisphere, the days are actually Friday, Saturday, and Monday.
Live streams are here.
While the loser of the match was struck silent by the defeat the computer just... will... not.. stop... talking. GAWD! How annoying.
Does the computer not know either pity or remorse for its opponent?
I am armed because I am free. I am free because I am armed.
As long as they never take our waifus.
he's playing against it like it's a human opponent, he's playing against it like he's a go champion, he needs to play against it like he's a programmer. I would be curious as to how it deals with mirror play, or wildly suboptimal plays. I would wonder if it's overfit to go played well.
Ever tried that with a chess program? Doesn't go over well. A wildly suboptimal play just makes the tree search look really good for the computer. It doesn't get emotionally distraught because it thinks you've seen something it didn't. It just sees better valued moves.
This Go algorithm is even more complex. It's a neural-network algorithm combined with tree-search (I don't play Go, but as I understand it, the number of permutations are so high, tree-search alone isn't feasible). This neural network was trained using input from previous tournaments, using games against expert players, and using games against itself. I don't think you can throw anything at it that will break it. Computers have officially become better than humans at Go. In a decade or so, when the really good Go programs can run in your phone, you'll be seeing the same type of cheating attempts going on that currently plague chess competitions.
Wow, that's closer to passing the Turing test than I realized.
My chess computer beat me every &^#@! time, but it was no match for me at kickboxing.
Just cruising through this digital world at 33 1/3 rpm...