Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/92353
Title: Procedurally generating game content with the use of L-systems
Authors: Vella, Miguel (2021)
Keywords: Computer games -- Design
Level design (Computer science)
Computer graphics
L systems
Issue Date: 2021
Citation: Vella, M. (2021). Procedurally generating game content with the use of L-systems (Bachelor's dissertation).
Abstract: Modern day game projects rely on teams of highly skilled, multidisciplinary teams, which among others consist of story writers and graphic designers. These projects also come with a lot of problems during the development, such as issues relating to the budget, quality of the game and scheduling issues. The work conducted in this project is meant to point out ways that can help alleviate some of the pressure that is put on the shoulders of game developers, by demonstrating the use of Procedural Content Generation (PCG) via L-Systems. PCG is a technique used to generate game content through the means of an algorithm, rather than manually generating this content. Lindenmayer Systems, or L-Systems, were introduced by Aristid Lindenmayer as a method of simulating the growth of multicellular organisms such as plants. Its applications have been extended to other areas, such as that of game content generation, due to the string rewriting nature of L-Systems. The approach chosen for this project was to develop a two-dimensional rogue-like dungeon game that utilizes L-Systems as a framework to generate the level-design of the dungeon in game, creating a main path and a branching path. The main path will end with a boss room, which is the only way to finish the game. However, the branching paths may offer powerups that would benefit the player throughout the game. The rooms in both paths need to be generated in such a way that every room is accessible through at least one other room. The rooms of the main path should be connected to one another, meaning that if the player chooses, he/she can ignore the subpaths that are generated by the algorithm and head straight to the boss room.
Description: B.Sc. IT (Hons)(Melit.)
URI: https://www.um.edu.mt/library/oar/handle/123456789/92353
Appears in Collections:Dissertations - FacICT - 2021
Dissertations - FacICTCIS - 2021

Files in This Item:
File Description SizeFormat 
21BITCB008.pdf
  Restricted Access
3.48 MBAdobe PDFView/Open Request a copy


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