Процедурна генерація двовимірного ігрового простору на основі комбінації алгоритму бінарного розбиття простору, алгоритму Крускала та алгоритму «А*»

Abstract

The idea to generate game maps is not new. It comes from role-playing boardgames and aims to provide a unique experience during each game session. There are many algorithms designed to generate various structures and data, find different solutions and calculate optimal paths, but most of them have a rather limited and specific purpose. At the same time, when properly applied and combined, these algorithms together allow you to create an interesting game map for the player, improving the gameplay and increasing the replayability. The given work is devoted to procedural generation of the game environment based on a combination of popular algorithms: binary space partitioning, Kruskal’s, «A*».