The Research of Dynamic Difficulty Adjustment to Improve Sticky Factor of Novice Players in Fighting Games Based on Monte Carlo Tree Search
碩士 === 國立宜蘭大學 === 資訊工程學系碩士班 === 107 === With the development of the game industry, all kinds of games appear constantly. For novice players who play the new game, a problem which they encounter easily is having a prompt failure by strong opponents or computer’s artificial intelligences(AIs). Taking...
Main Authors: | CHEN, WEN-CHIEN, 陳文謙 |
---|---|
Other Authors: | WU, TIN-YU |
Format: | Others |
Language: | zh-TW |
Published: |
2019
|
Online Access: | http://ndltd.ncl.edu.tw/handle/78xys4 |
Similar Items
-
Adversarial Game Playing Using Monte Carlo Tree Search
by: Sista, Subrahmanya Srivathsava
Published: (2016) -
Monte Carlo Tree Search for games with hidden information and uncertainty
by: Whitehouse, Daniel
Published: (2014) -
Applying Monte Carlo Tree Search to Tien Gow Game
by: CHUNG,KUAN-LIN, et al.
Published: (2016) -
RESOURCE CONSTRAINT COOPERATIVE GAME WITH MONTE CARLO TREE SEARCH
by: Cheng, Chee Chian
Published: (2016) -
Improvement and Application of Monte Carlo Tree Search Algorithm on Computer Games
by: Cheng-Wei Chou, et al.
Published: (2013)