Applying Monte Carlo Tree Search to Tien Gow Game
碩士 === 輔仁大學 === 資訊管理學系碩士班 === 104 === Computer game is one of the research areas of artificial intelligence(AI) development, the type of games is according to whether players know the other player’s information can be broadly divided into perfect information and imperfect information. Most of board...
Main Authors: | CHUNG,KUAN-LIN, 鐘冠麟 |
---|---|
Other Authors: | Tsai,Ming-Jyh |
Format: | Others |
Language: | zh-TW |
Published: |
2016
|
Online Access: | http://ndltd.ncl.edu.tw/handle/57655110821688357520 |
Similar Items
-
New Heuristics for Monte Carlo Tree Search Applied to the Game of Go
by: Shih-Chieh Huang, et al.
Published: (2011) -
Adversarial Game Playing Using Monte Carlo Tree Search
by: Sista, Subrahmanya Srivathsava
Published: (2016) -
RESOURCE CONSTRAINT COOPERATIVE GAME WITH MONTE CARLO TREE SEARCH
by: Cheng, Chee Chian
Published: (2016) -
Monte Carlo Tree Search for games with hidden information and uncertainty
by: Whitehouse, Daniel
Published: (2014) -
Improvement and Application of Monte Carlo Tree Search Algorithm on Computer Games
by: Cheng-Wei Chou, et al.
Published: (2013)