This article introduces a method for exploring liminal horror environments using a modified Wave Function Collapse algorithm. This approach employs real-time generated regions to create infinite, non-deterministic environments, removing the feeling of security due to familiarity. An eventdriven system further reinforces unpredictability by dynamically integrating horror experiences. While still in an exploratory stage, this method provides a foundation for future research on how architectural structures, unpredictability, and environmental cues contribute to unsettling experiences in games.

This paper explores the use of 2D cellular automata (CA) to generate 3D terrains through a simple additive approach. Experimenting with multiple CA transition rules produced aesthetically interesting, navigable landscapes, suggesting applicability for terrain generation in games.

Snappable Meshes is an algorithm that procedurally generates 3D environments by iteratively selecting and linking pre-built map pieces. These pieces are triangular meshes annotated by designers with connectors marking potential links, and bounding volumes indicating where overlaps should be avoided. In this article, we present a method for automatically generating connectors and bounding volumes from generic non-manifold triangular meshes for use with the Snappable Meshes algorithm, minimizing artist/designer work, while encouraging iteration of map piece design, an essential part of successful environment generation.

In this paper we introduce PyXYZ, a 3D wireframe software rendering framework for educational purposes. The main goal of this framework is to provide a simple-to-understand tool that students can use to build a more sophisticated engine, while learning mathematics and acquiring a deeper knowledge of the complexity of a modern 3D engine. PyXYZ can be used as a teaching aid in course work and/or as a template for multi-goal project assignments, allowing students with diverse capabilities and interests to have different levels of commitment. The engine has been used with positive results in a mathematics course unit of a computer games BA and can be easily adapted to various teaching scenarios.

We present an approach for teaching maths to game development undergraduates from a wide variety of backgrounds. We discuss the concepts behind an introductory maths course, its assessment and put forward some preliminary results on a practical implementation.

Security solutions are not easily adapted to the DTN paradigm, for example, traditional key management solutions cannot be applied in such environments. A key management scheme for DTNs must consider the dynamic topology, be self-organized and distributed and be effective in the presence of intermittent connections. There are just a few key management scheme for DTNs. Nevertheless, all of them have serious issues. They generate a huge overhead, have a single point of failure, are centralized or do not provide any security against very simple attacks. This work introduces a new key management scheme for DTNs based on chains of digital signatures (DSC-KM - Digital Signature Chains Key Management Scheme). It is decentralized, fully distributed, and does not have a single point of failure. It allows nodes to leave and joint the network at any time, works in the presence of intermittent connections, has a very small communication and memory overhead. It is based on chains of digital signatures and on a very simple chain exchange mechanism. According to simulation results, it is able to correctly and securely disseminate all certificates through the network in a short period, while maintaining the size of the chains very small. Moreover, it is able to resist to several attacks to the key management infrastructure.