It looks like you're using an Ad Blocker.
Please white-list or disable AboveTopSecret.com in your ad-blocking tool.
Thank you.
Some features of ATS will be disabled while you continue to use an ad-blocker.
Computer scientists say they've created an algorithm that has essentially solved a version of Texas hold 'em, and it's guaranteed to beat every single puny human competitor in the long run.
Cepheus, as this poker-playing program is called, plays a virtually perfect game of heads-up limit hold'em. The variant is like the popular Texas hold 'em, except there are only two players and a fixed number of bet sizes and raises. That still leaves 3.16 × 1017 states in the game.
The sheer feat of a program that's essentially solved a type of poker has computer scientists in a tizzy. Unlike other games that have been completely solved such as checkers or Connect Four, where every past action is laid clear on the game board, poker is a game with imperfect information—namely, you don't know your opponent's cards.
originally posted by: Beartracker16
Sure, the computer may beat me at poker,but I will dominate it at kick boxing.
.
counterfactual regret minimization (CFR) (35).
CFR is an iterative method for approximating
a Nash equilibrium of an extensive-form game
through the process of repeated self-play between
two regret-minimizing algorithms (19,36). Regret
is the loss in utility an algorithm suffers for not
having selected the single best deterministic
strategy, which can only be known in hindsight.
A regret-minimizing algorithm is one that guar-
antees that its regret grows sublinearly over
time, and so eventually achieves the same utility
as the best deterministic strategy. The key in-
sight of CFR is that instead of storing and
minimizing regret for the exponential number
of deterministic strategies, CFR stores and min-
imizes a modified regret for each information
set and subsequent action, which can be used
to form an upper bound on the regret for any
deterministic strategy. An approximate Nash
equilibrium is retrieved by averaging each play-
er’s strategies over all of the iterations, and the
approximation improves as the number of itera-
tions increases.
Our CFR+ implementation was executed on a
cluster of 200 computation nodes each with 24
2.1-GHz AMD cores, 32 GB of RAM, and a 1-TB
local disk. We divided the game into 110,565
subgames (partitioned according to preflop betting,
flop cards, and flop betting). The subgames
were split among 199 worker nodes, with one
parent node responsible for the initial portion
of the game tree. The worker nodes performed
their updates in parallel, passing values back to
the parent node for it to perform its update, taking
61 min on average to complete one iteration. The
computation was then run for 1579 iterations,
taking 68.5 days, and using a total of 900 core-
years of computation
originally posted by: MichiganSwampBuck
I started to come up with a method of playing video poker. With just you against the computer, you can be certain of the basic odds of getting a pair of jacks or better.
I tried it at the casino and would have scored pretty well if I played more money, but I pulled out after awhile when I lost $50. I didn't want to lose too much as it was my birthday. Besides, I was there for the concert anyway, not to gamble.
originally posted by: Indigent
If it was me who made this i would not told anyone and just hit online poker sites until the of time.
Computer scientists say they've created an algorithm that has essentially solved a version of Texas hold 'em, and it's guaranteed to beat every single puny human competitor in the long run.
Cepheus, as this poker-playing program is called, plays a virtually perfect game of heads-up limit hold'em. The variant is like the popular Texas hold 'em, except there are only two players and a fixed number of bet sizes and raises. That still leaves 3.16 × 1017 states in the game.
The sheer feat of a program that's essentially solved a type of poker has computer scientists in a tizzy. Unlike other games that have been completely solved such as checkers or Connect Four, where every past action is laid clear on the game board, poker is a game with imperfect information—namely, you don't know your opponent's cards.
Can You Beat This Virtually Unbeatable Poker Algorithm?
Too bad is just a 2 player game and not real Texas hold'em, perhaps they just said its for this variation and they are using the real version hitting the tables as i would .
Does this mark the end of online poker?
Is this the beginning of skynet?
You can play against it in a link in the source