Penerapan Algoritma Recursive DFS dalam pembuatan Labirin Dinamis pada Game “Lingkaran Setan” dengan teknik Procedural Maze Generation

  • Afiifah Zain Raidah Program Studi Teknik Informatika Universitas Islam Negeri Maulana Malik Ibrahim Malang

Abstract

This research explores the application of Procedural Maze Generation techniques in creating dynamic mazes for the game "Lingkaran Setan". Dynamic mazes are necessary to provide an engaging and challenging gameplay experience, ensuring constant variation in each game session. We use a Procedural Maze Generation algorithm to automatically create mazes with complex yet accessible structures, allowing players to explore the game environment uniquely each time the game starts. This research focuses on the integration of the Procedural Maze Generation algorithm with the game "Lingkaran Setan," resulting in dynamic and always challenging environments. Experimental results show that using this technique can enhance replayability and player satisfaction. Additionally, we measure the algorithm's performance in terms of efficiency and maze-building speed to ensure a smooth gaming experience. The findings from this study contribute to a further understanding of the application of Procedural Maze Generation techniques in the context of video games, providing a foundation for developing more dynamic and engaging games in the future.

Downloads

Download data is not yet available.

References

Adiguna, Y., & Swanjaya, D. (2020). Implementasi Algoritma Backtracking untuk Mencari Jalan Keluar Labirin.

Fadila, J. N., Nugroho, F., Artanti, V., Rohma, S. A., Huda, M. K., & Priambudi, N. S. (2023). Penerapan Hfsm Pada Game 3d “Petualang Qur’an.” Jurnal Ilmiah Informatika, 11(01), 15–21. https://doi.org/10.33884/jif.v11i01.6538

Krisdiawan, R. A., Fitriani, A., & Budianto, H. (2022). Penerapan Algoritma Recursive Backtracking Sebagai Maze Generator Pada Game Labirin Aksara Sunda. Media Jurnal Informatika, 14(1), 31. https://doi.org/10.35194/mji.v14i1.2326

Needham, M., & Hodler, A. E. (n.d.). Graph Algorithms.

Putri, N. M., Umri, I. R., Azmi, M. I. N., Amriadi, A., Shaffira, F., Karami, A. F., & Nugroho, F. (2024). Implementasi Algoritma Recursive Depth First Search Pada Game Labirin 3d Berbasis Desktop. Jurnal Digit, 14(1), 1-8.

Rahmasuci, M., S, H. H., Azizah, M., Wulandari, P., A, D. A., & Bukhori, S. (2019). Strategi Menemukan Jalan Keluar Labirin dengan Waktu Tercepat Menggunakan Metode DFS. INFORMAL: Informatics Journal, 3(1), 12. https://doi.org/10.19184/isj.v3i1.9852

PlumX Metrics

Published
2024-08-31
How to Cite
Raidah, A. (2024). Penerapan Algoritma Recursive DFS dalam pembuatan Labirin Dinamis pada Game “Lingkaran Setan” dengan teknik Procedural Maze Generation. Maliki Interdisciplinary Journal, 2(8), 55-62. Retrieved from https://urj.uin-malang.ac.id/index.php/mij/article/view/9416
Section
Articles