6533b829fe1ef96bd1289791

RESEARCH PRODUCT

Fuzzified Tree Search in Real Domain Games

Dmitrijs Rutko

subject

Tree (data structure)Search algorithmPrincipal variation searchMonte Carlo tree searchPruning (decision trees)Alpha–beta pruningGame treeIterative deepening depth-first searchAlgorithmMathematics

description

Fuzzified game tree search algorithm is based on the idea that the exact game tree evaluation is not required to find the best move. Therefore, pruning techniques may be applied earlier resulting in faster search and greater performance. Applied to an abstract domain, it outperforms the existing ones such as Alpha-Beta, PVS, Negascout, NegaC*, SSS*/ Dual* and MTD(f). In this paper we present experimental results in real domain games, where the proposed algorithm demonstrated 10 percent performance increase over the existing algorithms.

yearjournalcountryeditionlanguage
2011-01-01
https://doi.org/10.1007/978-3-642-25324-9_13