Improving Monte-Carlo tree search in Havannah

DOI10.1007/978-3-642-17928-0_10zbMATH Open1316.68140OpenAlexW1598714892WikidataQ56093101 ScholiaQ56093101MaRDI QIDQ3073743FDOQ3073743

Authors: Richard J. Lorentz 

Publication date: 11 February 2011

Published in: Computers and Games (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17928-0_10

Recommendations

• Pruning playouts in Monte Carlo tree search for the game of Havannah
• Using evaluation functions in Monte-Carlo tree search
• MoHex 2.0: a pattern-based MCTS hex player
• Scalability and parallelization of Monte-Carlo tree search
• Monte-Carlo Tree Search Solver

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Experimental studies (91A90) Combinatorial games (91A46)

Cited In (5)

• Improving strategic decisions in sequential games by exploiting positional similarity
• Pruning playouts in Monte Carlo tree search for the game of Havannah
• \textsc{Havannah} and \textsc{TwixT} are PSPACE-complete
• On the complexity of connection games
• MoHex 2.0: a pattern-based MCTS hex player

This page was built for publication: Improving Monte-Carlo tree search in Havannah

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