Slashdot Mirror
$100,000 Poker Bot Tournament
Costa Galanis writes "The LA Times is reporting that a poker tournament will be held where engineers will be able to pit their automatic poker-playing programs against each other in a tournament similar to the upcoming World Series of Poker main event, with a 100,000 dollar cash prize for the winning program. The article mentions how the recent rise in popularity of poker has encouraged many to try and create the poker equivalent of chess' Big Blue, the chess playing computer program that defeated the world's top chess player in a widely publicized event, and also talks about how many engineers also are trying to make bots that are good enough to play and beat human players for money in online casinos."
Clearly you don't understand Texas Hold-'em. There is no card counting required, beyond to 6 (two in your hand, 4 on the table). Any player who is so bad that he can't read the board isn't going to be a challenge to anybody decent.
Since decks are made out of 52 cards, and you get two of them, it gets very easily to calculate probabilities for a human (mostly involves multiplying by 2).
Finally, making the probabalistic move every time will not do as well, because if you do that you would absolutely never bluff. A bot to be good in the long run must bluff, otherwise it is far too predictable and you can gain too much information from its bets and raises.
To give a quick example: If there's 100$ in the pot, and the bot bets 10$, I need to believe I'll win 1/11 times in order to justify my call. If I know that the bot never bluffs and only bets there when he's best, I can fold every time and save 10$. If the bot bluffs 1/11 times though, I suddenly have an actually complicated decision. And note if I fold those complicated decisions every time I lose more money, because he is betting more hands and I am folding each time he bets.
So no, straight up probabilities simply won't cut it.
(For more information, see Sklansky's Theory of Poker.)