Monte-carlo tree search (mcts) has been found to play suboptimally in some tactical domains due to its highly selective search, focusing only on the most promising moves. In order to combine the strategic strength of mcts and the tactical strength of minimax, mcts-minimax hybrids have been introduced, embedding shallow minimax searches into the mcts framework. Their results have been promising even without making use of domain knowledge such as heuristic evaluation functions. This paper continues this line of research for the case where evaluation functions are available. Three different approaches are considered, employing minimax with an evaluation function in the rollout phase of mcts, as a replacement for the rollout phase, and as a node prior to bias move selection. The latter two approaches are newly proposed. The mcts-minimax hybrids are tested and compared to their counterparts using evaluation functions without minimax in the domains of othello, breakthrough, and catch the lion. Results showed that introducing minimax search is effective for heuristic node priors in othello and catch the lion. The mcts-minimax hybrids are also found to work well in combination with each other. For their basic implementation in this investigative study, the effective branching factor of a domain is identified as a limiting factor of the hybrid’s performance.
|Title of host publication||Computer Games|
|Subtitle of host publication||Third Workshop on Computer Games, CGW 2014, Held in Conjunction with the 21st European Conference on Artificial Intelligence, ECAI 2014, Prague, Czech Republic, August 18, 2014, Revised Selected Papers|
|Number of pages||19|
|Publication status||Published - 2014|
|Series||Communications in Computer and Information Science|