By Topic

To create DDA by the approach of ANN from UCT-created data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

8 Author(s)
Xinyu Li ; Int. Sch., Beijing Univ. of Posts & Telecommun., Beijing, China ; Suoju He ; Yue Dong ; Qing Liu
more authors

Dynamic Difficulty Adjustment (DDA) can adjust game difficulty level dynamically; so it generates a tailor-made experience for each gamer. If a game is too easy, the gamer will feel bored; if it is too hard, the gamer will become frustrated. DDA is a mechanism to overcome this dilemma and augment the entertainment of a game by dynamically adjusting the parameters, scenarios and behaviors in the game in real-time based on the gamer's personal ability. We use Upper Confidence bound for Trees (UCT) to create the training data, and then train the Artificial Neural Networks (ANN) off-line with that data. Finally, we derive DDA from ANN approach. In this paper, the prey and predator game genre of Pac-Man is utilized as a test-bed, the procedure of training ANN is shown, and the feasibility of applying DDA to game artificial intelligence (AI) development is demonstrated.

Published in:

Computer Application and System Modeling (ICCASM), 2010 International Conference on  (Volume:8 )

Date of Conference:

22-24 Oct. 2010