Dynamic Difficulty Adjustment based on an improved algorithm of UCT for the Pac-Man Game

摘要：

one major problem of Pac-Man Game is how to generate intelligence of opponents at appropriate challenge level.This paper presents an approach for creating game opponents by DDA (Dynamic Difficulty Adjustment), which is used to dynamically adjust challenge level of opponents according to the players skill level.The approach of DDA is based on time-constrained-Cl.Furthermore, in order to improve the performance of Pac-Man Game AI, this paper also discusses an alternative approach, knowledge-based-CI-controlled-NPC, which creates DDA based on knowledge from DTS.

关键词： Pac-Man Game DDA DTS time-constrained-DTS knowledge-based-Cl-controUed-NPC

作者: Bin Wu DingDing Chen Suoju He Qijin Sun Zhengjun Li Minxi Zhao

作者单位: School of Software Engineering,Beijing University of Posts and Telecommunications,Beijing,China,100876

会议类型: 国际会议

会议名称: 2011 3rd International Conference on Computer and Network Technology(ICCNT 2011)(2011第三届IEEE计算机与网络技术国际会议)

会议地点: 太原

会议语种:英文

页码: 306-310

在线出版日期: 2011-02-26（万方平台首次上网日期，不代表论文的发表时间）