The ABNMS BN Repository


3 BNs found.

BPP: The Bayesian Poker Player

The Bayesian Poker Player (BPP) began life as an honours project at Monash in 1993. Since then several honours students have worked on various aspects of the project and some of the work has been written up as research publications. BPP was originally developed to play 5-card stud poker, using Bayesian network technology. In 2006, BPP was converted to play Texas Hold'em Poker, the main online form of poker, and re-written in Python. We have developed a simple GUI interface that allows people to play against BPP online, which is hosted here: <>. This is an ongoing project in which there are still many options for making BPP a better poker player including improving its bluffing strategies and its opponent modelling.

Kevin Korb, Ann Nicholson and Steven Mascaro
Netica .dne format
Korb, K.B., Nicholson, A.E. & Jitnah, N. (1999) Bayesian poker. In Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence, pages 343-350

This is a modified version of Russian roulette. We are given a gun with six chambers and two bullets in two consecutive chambers. I first take a shot and pass the gun to you. You must take the second shot, but you can choose to spin the chamber first, or leave it untouched. What do you choose to do?

Dhananjay Thiruvady
Netica .dne format
Monty Hall Decision Problem

The Monty Hall problem (see <>) is a simple counter-intuitive puzzle. There are three doors, two of which have goats behind them and third door, a car. First, you pick a door. Monty then chooses a door with a goat behind it. Now it is up to you: Stay with your door or swap to the other unopened door?

Owen Woodberry
Netica .dne format
Monty Hall, games, puzzle