An algorithm based on valuation forecasting for game tree search
| العنوان: | An algorithm based on valuation forecasting for game tree search |
|---|---|
| المؤلفون: | Guangyun Tan, Yongyi He, Ping Yi, Peipei Wei, Huahu Xu, Xinxin Shi |
| المصدر: | International Journal of Machine Learning and Cybernetics. 12:1083-1095 |
| بيانات النشر: | Springer Science and Business Media LLC, 2020. |
| سنة النشر: | 2020 |
| مصطلحات موضوعية: | Computer science, Selection strategy, Complex system, Comparison results, 020302 automobile design & engineering, Computational intelligence, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Game tree search, 0203 mechanical engineering, 010201 computation theory & mathematics, Artificial Intelligence, Search algorithm, Computer Vision and Pattern Recognition, Game tree, Algorithm, Software, Valuation (finance) |
| الوصف: | This study proposes a novel best-first search algorithm, called Valuation Increment Search Algorithm (VIS), which applies the increment of exploratory value change to predict the valuation and guide the selection of the game tree. The proposed method can effectively use node valuation and game tree size information to solve the game tree by fewer exploration steps. The relevant assumptions and search principles of the proposed algorithm are detailed. Moreover, comparative experiments with Alpha–Beta Search (α–β search), Proof-Number Search (PNS) and Monte-Carlo Tree Search (MCTS) in the domain of Dou Dizhu has been performed to verify the performance. Result demonstrate that VIS is superior to α–β search, PNS and MCTS algorithm in solving the game tree and finding the best move for some game scenarios by consuming less time and few memory resources. The improvement effect of the average Increment, magnitude of Increment, and the number of visits to node on the original VIS was validated. Also, a new selection strategy is defined for the improved VIS algorithm combined with these factors. The experimental comparison results show that improved VIS has a better performance in solving game tree with less nodes generated and expanded than original VIS. |
| تدمد: | 1868-808X 1868-8071 |
| الوصول الحر: | https://explore.openaire.eu/search/publication?articleId=doi_________::cd39fa01505e256fc4b354dfc2fb22f9Test https://doi.org/10.1007/s13042-020-01222-3Test |
| حقوق: | CLOSED |
| رقم الانضمام: | edsair.doi...........cd39fa01505e256fc4b354dfc2fb22f9 |
| قاعدة البيانات: | OpenAIRE |
| تدمد: | 1868808X 18688071 |
|---|