Using various patterns and features on move prediction in the game of Go
碩士 === 國立東華大學 === 資訊工程學系 === 104 === Monte-carlo tree search (MCTS) is a common method in computer games. However, MCTS performs badly in huge complex board games. Because MCTS may not find good moves in limited time. But it can avoid expending bad moves by pattern and feature weight that traine...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/72584001717714844916 |