Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/82141
Title: Automatic game script generation
Authors: Khalifa, Ahmed
Keywords: Computer games -- Design
Level design (Computer science)
Artificial intelligence
Machine learning
Issue Date: 2015
Publisher: Cairo University. Faculty of Engineering
Citation: Khalifa, A. (2015). Automatic game script generation (Master's thesis).
Abstract: Procedural Content Generation (PCG) has been in the industry since the early days of Video Games. It was used to support huge amount of data with a small footprint due to technical limitations. Although technical difficulties became history and storage is no longer a problem, PCG is still one of the hot topics in Video Games’ research field. PCG helps in reducing development time and cost, becoming more creative, and understanding the process of creating game content. In this work, a system is proposed to help in generating levels for Puzzle Script. Levels are generated without any restriction on the rules. Two different approaches are used with a trade of between speed (Constructive approach) and playability (Genetic approach). These two approaches use a level evaluator that calculates the scores of the generated levels automatically based on their playability and difficulty. The generated levels are assessed by human players statistically, and the results show that the constructive approach is capable of generating playable levels up to 90%, while genetic approach can reach up to 100%. The results also show a high correlation between the system scores and the human scores. The constructive approach is used to generate rules for Puzzle Script as well. The results of the new system prove the possibility of generating playable rules without any restrictions.
URI: https://www.um.edu.mt/library/oar/handle/123456789/82141
Appears in Collections:Scholarly Works - InsDG

Files in This Item:
File Description SizeFormat 
Automatic_game_script_generation_2015.pdf4.19 MBAdobe PDFView/Open


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.