Saved in:
Bibliographic Details
Main Authors: Vijayakumar, Jayakrishna, Mathew, Lisa
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2403.07607
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911793724522496
author Vijayakumar, Jayakrishna
Mathew, Lisa
author_facet Vijayakumar, Jayakrishna
Mathew, Lisa
contents Graph grammars form an interesting area of research because of their versatility in modelling diverse situations with graphs as the structures which are to be manipulated. A new class of graph grammars, nc-eNCE Graph Grammars has been introduced recently with an aim of restricting the order of application of graph production rules, thereby generating different graph classes using the same set of rules. On the other hand 2D game design using an algorithmic approach known as procedural content generation has been of interest recently. In this paper we modify the structure of nc-eNCE graph grammars with the aim of generating directed graphs. We show that employing these graph grammars simplifies the design of 2D games. We have also developed an algorithm which makes use of these graph grammars for generating random game level layouts ensuring that the players will get a different gaming experience each time they play.
format Preprint
id arxiv_https___arxiv_org_abs_2403_07607
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle On Graph Grammars and Games
Vijayakumar, Jayakrishna
Mathew, Lisa
Formal Languages and Automata Theory
Discrete Mathematics
Combinatorics
68Q42, 68Q45, 68R10
F.4.2; G.2.2; F.4.3; F.1.1
Graph grammars form an interesting area of research because of their versatility in modelling diverse situations with graphs as the structures which are to be manipulated. A new class of graph grammars, nc-eNCE Graph Grammars has been introduced recently with an aim of restricting the order of application of graph production rules, thereby generating different graph classes using the same set of rules. On the other hand 2D game design using an algorithmic approach known as procedural content generation has been of interest recently. In this paper we modify the structure of nc-eNCE graph grammars with the aim of generating directed graphs. We show that employing these graph grammars simplifies the design of 2D games. We have also developed an algorithm which makes use of these graph grammars for generating random game level layouts ensuring that the players will get a different gaming experience each time they play.
title On Graph Grammars and Games
topic Formal Languages and Automata Theory
Discrete Mathematics
Combinatorics
68Q42, 68Q45, 68R10
F.4.2; G.2.2; F.4.3; F.1.1
url https://arxiv.org/abs/2403.07607