作者: Athanasios Papadopoulos , Konstantinos Toumpas , Antonios Chrysopoulos , Pericles A. Mitkas
关键词:
摘要: This paper discusses the design and implementation of a highly efficient MiniMax algorithm for game Abalone. For perfect information games with relatively low branching factor their decision tree (such as Chess, Checkers etc.) accurate evaluation function, Alpha-Beta search proved to be far more than Monte Carlo Tree Search. In recent years many new techniques have been developed improve efficiency tree, applied variety scientific fields. explores several increasing Search on board Abalone while introducing some innovative that very effective. The main idea behind them is incorporation probabilistic features otherwise deterministic search.