Technical Perspective: Solving Imperfect Information Games
"Heads-Up Limit Hold'em Poker Is Solved," by Michael Bowling, et al., takes the counterfactual regret minimization method for approximating a Nash equilibrium to the next level.
David Silver
Advertisement
Author Archives
The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions
The ancient oriental game of Go has long been considered a grand challenge for artificial intelligence. However, computer Go programs based on Monte-Carlo tree search now play at human-master levels and are beginning to challenge top professional players.
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved