Improving Monte–Carlo Tree Search in Havannah

DOI10.1007/978-3-642-17928-0_10zbMath1316.68140OpenAlexW1598714892WikidataQ56093101 ScholiaQ56093101MaRDI QIDQ3073743

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

Mathematics Subject Classification ID

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

Related Items (2)

On the complexity of connection games ⋮ Havannah and TwixT are PSPACE-complete

This page was built for publication: Improving Monte–Carlo Tree Search in Havannah