News for hackers. Stuff that matters.
Re:Google achieves AI 'breakthrough' by beating Go champion by taurath on Wednesday January 27, 2016 @04:22PM (#10983514)
Wouldn't it be possible to compare the "top" move with the "runner up" move, compare outcome percentages, and declare whether there is a small or large deviation? Or comparing the "top" move with any other possible move? Or is that too much calculation?
Re:Google achieves AI 'breakthrough' by beating Go champion by umanwizard on Wednesday January 27, 2016 @07:17PM (#10984737)
Well, you can make chess engines give you a numeric evaluation for several possible moves. These are typically tuned so that the value of a pawn is around 1 point. A grandmaster 1 or 2 points ahead can routinely convert to a won game, assuming he doesn't blunder.

So if the best move has an evaluation of +0.05 and the second best has -0.02 , the difference is probably a very subtle positional improvement (and the first move may not in fact be better; chess programs aren't perfect). If the best is +3.12 and the second is -0.02, and you can't see why, there's a concrete material tactic you're missing (or, less likely, a major, obvious positional devastation).

But, it can't tell you what you're missing, just the magnitude of the difference.

Re:Google achieves AI 'breakthrough' by beating Go champion by jibalt on Sunday January 31, 2016 @02:13AM (#11005598)
Compare all you want ... that doesn't tell you why the choice was made, because it was made by evaluating and comparing many millions of positions.