Artificial intelligence for Bidding Hex
Sam Payne, Elina Robeva · arXiv (Cornell University) · 2008
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.