Abstract

The thesis states that there are data structures and also algorithms which are suitable for a graph-based analysis of gamespaces. The research will find data structures suitable for the formalization of gamespaces and their analysis by taking advantage of the spatial arrangement of game maps in particular. The underlying algorithms are well known and interpreted from the point of view of level design or specifically designed to enable detection of a selection of special gamespaces. The found data structures and algorithms can also be used to formally find indicators for content placement, probabilities of movement and quantify the importance of small areas in varying contexts.

Results/Implementation/Project Description

Conclusion

[ PDF (optional) ] 

[ Slides Kickoff/Final (optional)]