Artificial intelligence for Bidding Hex
Combinatorics
2016-04-19 v1 Computer Science and Game Theory
Probability
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.
Cite
@article{arxiv.0812.3677,
title = {Artificial intelligence for Bidding Hex},
author = {Sam Payne and Elina Robeva},
journal= {arXiv preprint arXiv:0812.3677},
year = {2016}
}
Comments
7 pages, 2 figures