Artificial intelligence for bidding hex

MaRDI QIDQ2949130zbMATH OpenFDO

Authors Sam Payne, Elina Robeva

Publication date 7 October 2015

Full work available at URL https://arxiv.org/abs/0812.3677

zbMATH Keywords

artificial intelligenceMonte Carlo algorithmbidding hex gamerandom-turn hex

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial games (91A46)

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.

Recommendations

• scientific article; zbMATH DE number 1944396
• A hierarchical approach to computer Hex
• scientific article; zbMATH DE number 1784980
• Random-Turn Hex and Other Selection Games
• Solving 7 7 hex with domination, fill-in, and virtual connections

Cited in

(1)

• Bidding games and efficient allocations

This page was built for publication: Artificial intelligence for bidding hex

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2949130)