A machine learning algorithm, Alpha Zero, recently defeated the leading chess computer and revolutionized centuries of chess theory. After studying the game for four hours.
I'd be curious to see the same algorithm applied to unbounded strategy. The number of possible positions on a chess board is in the range of 10^45. That means a sufficiently powerful computer could plausibly play every game...
-
-
But something with known and unknown unknowns, like multiplayer no-limit poker, would task it in a different way. Brute force, no matter how creative, wouldn't cut it alone.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Alpha Go Zero crushed the human Go champion and Go has many more possible moves.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.