Google
is a pioneer in limited artificial general intelligence (aka computers
that can learn w/o preprogramming them). One successful example
is AlphaGo. It just beat this Go Grandmaster three times in a row.
What makes this win interesting is that AlphaGo didn't win through brute force. Go is too complicated for that:
...the average 150-move game contains more possible board configurations — 10170 — than there are atoms in the Universe, so it can’t be solved by algorithms that search exhaustively for the best move.
It also didn't win by extensive preprogramming by talented engineers, like IBM's Deep Blue did to win at Chess.
Instead, AlphaGo won this victory by learning how to play the game from scratch using this process:
More @ Global Guerrillas
No comments:
Post a Comment