%0 Journal Article
%T Artificial intelligence for Bidding Hex
%A Sam Payne
%A Elina Robeva
%J Mathematics
%D 2008
%I arXiv
%X We present a Monte Carlo algorithm for efficiently finding near optimal moves and bids in the game of Bidding Hex. The algorithm is based on the recent solution of Random-Turn Hex by Peres, Schramm, Sheffield, and Wilson together with Richman's work connecting random-turn games to bidding games.
%U http://arxiv.org/abs/0812.3677v1