Artificial intelligence for Bidding Hex
classification
🧮 math.CO
cs.GTmath.PR
keywords
biddingalgorithmgamesrandom-turnartificialbidscarloconnecting
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.