Knowledge

Cepheus (poker bot)

Source 📝

63:
strategy for heads-up limit Texas hold'em, as an optimal counter-strategy to Cepheus can only win 0.000986 big blinds per game on expectation (to go from "essentially" solving the game to just "solving" the game, one has to reduce this expected loss to precisely 0 big blinds per game). However,
64:
0.000986 big blinds per game on expectation means that even if someone played against Cepheus for a lifetime, this person will not be able to say, with statistical significance, that they have won.
34:. This was the first imperfect information game played competitively by humans to be essentially solved. It was developed by the Computer Poker Research Group (CPRG) at the 81: 53: 184: 49: 165: 202:
Bowling, Michael; Burch, Neil; Johanson, Michael; Tammelin, Oskari (Jan 2015). "Heads-up limit hold'em poker is solved".
301: 38:
and was introduced in January 2015 in a paper entitled "Heads-up limit hold’em poker is solved", published in
122: 224: 76: 219: 86: 35: 211: 8: 100: 215: 245: 140: 237: 144: 40: 31: 249: 229: 130: 60: 45: 285: 135: 295: 233: 241: 27: 263: 67:
Public web access to observe and play against Cepheus is available.
95: 279: 23: 201: 82:
Association for the Advancement of Artificial Intelligence
185:"Poker Computer Takes the Pot [audio interview]" 286:
University of Alberta Computer Poker Research Group
166:"Computer Conquers Texas Hold 'Em, Researchers Say" 293: 182: 223: 134: 26:playing program that "essentially weakly 294: 59:Cepheus' strategy is very close to a 163: 120: 13: 14: 313: 273: 164:Hotz, Robert Lee (2015-01-08). 256: 195: 176: 157: 114: 1: 108: 30:" the game of heads-up limit 123:"Game Theorists Crack Poker" 7: 183:Bob McDonald (2015-01-10). 121:Ball, Philip (2015-01-08). 70: 10: 318: 136:10.1038/nature.2015.16683 52:, Michael Johanson, and 234:10.1126/science.1259433 77:Artificial Intelligence 302:Computer poker players 87:Computer poker players 280:Cepheus Poker Project 36:University of Alberta 16:Poker playing program 216:2015Sci...347..145B 189:Quirks & Quarks 170:Wall Street Journal 153:– via Nature. 101:Polaris (poker bot) 309: 268: 267: 260: 254: 253: 227: 199: 193: 192: 180: 174: 173: 161: 155: 154: 152: 151: 138: 118: 61:Nash equilibrium 317: 316: 312: 311: 310: 308: 307: 306: 292: 291: 276: 271: 262: 261: 257: 210:(6218): 145–9. 200: 196: 181: 177: 162: 158: 149: 147: 119: 115: 111: 73: 54:Oskari Tammelin 46:Michael Bowling 17: 12: 11: 5: 315: 305: 304: 290: 289: 283: 275: 274:External links 272: 270: 269: 264:"Play Cepheus" 255: 194: 175: 156: 112: 110: 107: 106: 105: 104: 103: 98: 90: 89: 84: 79: 72: 69: 32:Texas hold 'em 15: 9: 6: 4: 3: 2: 314: 303: 300: 299: 297: 287: 284: 281: 278: 277: 265: 259: 251: 247: 243: 239: 235: 231: 226: 225:10.1.1.697.72 221: 217: 213: 209: 205: 198: 190: 186: 179: 171: 167: 160: 146: 142: 137: 132: 128: 124: 117: 113: 102: 99: 97: 94: 93: 92: 91: 88: 85: 83: 80: 78: 75: 74: 68: 65: 62: 57: 55: 51: 47: 43: 42: 37: 33: 29: 25: 22:is the first 21: 258: 207: 203: 197: 188: 178: 169: 159: 148:. Retrieved 126: 116: 66: 58: 39: 19: 18: 191:(Podcast). 150:2015-01-13 109:References 50:Neil Burch 220:CiteSeerX 145:155710390 296:Category 242:25574016 96:Claudico 71:See also 288:website 282:website 250:3796371 212:Bibcode 204:Science 41:Science 20:Cepheus 248:  240:  222:  143:  127:Nature 28:solved 246:S2CID 141:S2CID 24:poker 238:PMID 230:doi 208:347 131:doi 44:by 298:: 244:. 236:. 228:. 218:. 206:. 187:. 168:. 139:. 129:. 125:. 56:. 48:, 266:. 252:. 232:: 214:: 172:. 133::

Index

poker
solved
Texas hold 'em
University of Alberta
Science
Michael Bowling
Neil Burch
Oskari Tammelin
Nash equilibrium
Artificial Intelligence
Association for the Advancement of Artificial Intelligence
Computer poker players
Claudico
Polaris (poker bot)
"Game Theorists Crack Poker"
doi
10.1038/nature.2015.16683
S2CID
155710390
"Computer Conquers Texas Hold 'Em, Researchers Say"
"Poker Computer Takes the Pot [audio interview]"
Bibcode
2015Sci...347..145B
CiteSeerX
10.1.1.697.72
doi
10.1126/science.1259433
PMID
25574016
S2CID

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.