Vexbot

From PokerAI

Jump to: navigation, search

UNDER COSTRUCTION, PLEASE SEE THIS POST IN RESERVE COPY

Vexbot is a heads up limit adaptive pokerbot developed by the University of Alberta Computer Poker Research Group. It is described in the paper "Game-Tree Search with Adaptation in Stochastic Imperfect-Information Games" [1]. It uses the Miximax algorithm to determine a best response to its opponent, and is similar to BRPlayer. It is one of the opponents available in Poker Academy. According to Poker Academy, you may find it quite a weak opponent to begin with, but it gets stronger after several hundred hands.

Vexbot won the gold medal at the Computer Olympiad held in Graz, Austria 2003. Sparbot, the game-theory based pokerbot, took silver medal in the same competition.

This [2] press release from the University of Alberta made the following comments about the 2005 match in Las Vegas against Phil Laak:

"Laak easily beat Vexbot, ... partly because he played better, but also because he had far more luck that day -- as Laak himself readily admits. ... Vexbot adjusted its style in an attempt to exploit Laak's tendencies, but it didn't always make the best choices, Schaeffer says. "It was aggressive, it had a learning component, but it had an unstable learning component..."

Poker Academy promotional literature says [3]:

"Vexbot ... is an AI system based completely on opponent modeling. This is a radical departure and very different from the original rule-based Loki. It has been successful thus far in proving that opponent modeling is critical when playing poker at a world class level. Vexbot forces an opponent to continually change strategies and adapt their play, as it will attempt to exploit any and all weakness or predictability it finds in their playing style. Players facing Vexbot find themselves asking "how can I win against myself?"

See also

Links