Heads-up limit hold’em poker is solved

This is from today’s news in Science. The full citation is:

M. Bowling, N. Burch, M. Johanson, O. Tammelin, “Heads-up limit hold’em poker is solved”, Science, 9 January 2015, 347(6218), 145-149, http://dx.doi.org/10.1126/science.1259433.

See also a University of Alberta site where you can play against their algorithm if interested.

There’s also an overview by T. Sandholm, “Solving imperfect information games“.

About hypergeometric

See http://www.linkedin.com/in/deepdevelopment/ and http://667-per-cm.net
This entry was posted in games of chance, probabilistic programming, risk. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s