2000 character limit reached
Artificial intelligence for Bidding Hex (0812.3677v1)
Published 18 Dec 2008 in math.CO, cs.GT, and math.PR
Abstract: 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.