![]() student in computer science at the University of Alberta in Canada. “ The solutions for imperfect-information games require computers to handle the additional complication of not knowing exactly what the game’s state is, such as not knowing an opponent’s hand,” says Neil Burch, a Ph.D. ![]() By solving an “imperfect-information game” such as poker, computer algorithms could also potentially handle real-world scenarios with similar levels of uncertainty. Future programs might even master the ancient game of Go. But computers face a different challenge in consistently winning at poker, because each player has two hidden cards that represent information hidden from the opponent. Since that stunning moment in 1997, computer algorithms have solved games such as Connect Four and checkers by analyzing all the possible plays and figuring out the perfect strategy for each move starting from the beginning of each game. It’s been almost two decades since the IBM computer called Deep Blue beat the world chess champion Garry Kasparov. A new algorithm has taken the first big step in figuring out poker, t he globally popular card game played by more than 150 million people, by solving a two-player version known as heads-up limit Texas hold’em. All your poker chips may soon belong to the computers.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |