An integrated approach to achieving optimal design of computer games

Publication Type  Journal Article
Year of Publication  2006
Authors  Hsu, S. H.; Lee, F. L.; Wu, M. C.
Journal Title  Expert Systems with Applications
Volume  31
Pagination  145-149
ISBN Number  0957-4174
Accession Number  ISI:000236903700016
Key Words  neural networks; genetic algorithms; optimization; computer game; artificial neural-networks; genetic algorithms; support-system; optimization
Abstract  

In a time-to-market environment, designers may not be able to incorporate all the design features in a computer game. For each feature, there are several levels of implementation, which is corresponded to different levels of benefit as well as cost. Therefore, a trade-off decision for determining appropriate levels of implementation is very important, yet has been rarely studied in literature. This paper presents an approach to solve the trade-off decision problem. This approach applies the neural network technique and develops a genetic algorithm to optimize the design of computer games. By this approach, a near-optimal design alternative can be identified in a timely fashion.


0

learning

this article is very helpful for my researches

Free Registration

Registered users have the added benefit of being able to:

  • Search/filter the bibliography to find just the article you are looking for. You can search the computer games research bibliography by author, year, keyword, title or publication type.
  • Export references from the video games bibliography to a format suitable for your own work. Options currently include tagged and XML for Endnote users and BibTex for the rest of the world.
  • Post comments to discuss the paper or alert fellow researchers to other resources.
  • Add their own references using the 'create content' -> 'biblio' option in the block on the left.
  • NEW: Use the Biblio Search box located on the right hand of the page.
  • NEW: Browse by journal title, book title, author or keyword using the new Faceted Search tool.