Implementasi Algoritma Random walk untuk Procedural generation dalam Genre Game Dungeon Crawler 2D

  • Dani Arifudin Universitas Amikom Purwokerto
  • Dhipa Ringi Rizky Universitas Amikom Purwokerto
  • Andi Dwi Riyanto Universitas Amikom Purwokerto
  • Suliswaningsih Universitas Amikom Purwokerto
Abstract views: 124 , PDF downloads: 98
Keywords: random walk, procedural generation, gdlc, game 2d, dungeon crawler

Abstract

The use of algorithms to produce content through procedural generation is an attractive alternative in game development. However, it should be noted that there are various types of algorithms with varying results, as well as their suitability for 2D/3D game types. Random walk is a simple algorithm that is often used in procedural generation. This algorithm works on discrete or continuous space, from an initial position and moves by taking a random direction at each step. The Dungeon Crawler game genre is a type of game that can utilize procedural generation. A game genre that developed from the RPG genre, focusing on the exploration of mazes or dungeons that are often randomized and full of various obstacles. This genre offers several interesting features, such as collecting exploration rewards, solving puzzles, and finding a way out. This research uses GDLC as a system development method based on Windows PC devices. The test results using the Black Box method can be said to be successful because the game succeeded in creating levels automatically by implementing the Random walk algorithm.

References

M. Nguyen, “Fundamentals of 2D Game Art,” 2021.

J. Freiknecht, “Procedural content generation for games,” 2021.

N. Shaker, J. Togelius, and M. J. Nelson, “Procedural content generation in games,” 2016.

S. Riddle and O. C. Zecha, “Perlin Noise and Returning Results from Shader Programs,” Direct3D ShaderX, p. 232.

B. Barufaldi et al., “Computational breast anatomy simulation using multi-scale Perlin noise,” IEEE Trans. Med. Imaging, vol. 40, no. 12, pp. 3436–3445, 2021.

W. R. Aisyiyah, “Simulasi 2 dimensi gambar berkabut berdasarkan Transmission Map Pada Dark Channel Pior (DCP) menggunakan citra Kawah Gunung Kelud,” Universitas Islam Negeri Maulana Malik Ibrahim, 2019.

D. A. Ramadhan and A. D. Indriyanti, “Procedural Content Generation pada Game World Exploration Sandbox Menggunakan Alogoritma Perlin Noise,” J. Informatics Comput. Sci., vol. 4, no. 01, pp. 86–91, 2022.

C. Gasch, M. Chover, I. Remolar, and C. Rebollo, “Procedural modelling of terrains with constraints,” Multimed. Tools Appl., vol. 79, pp. 31125–31146, 2020.

F. Xia, J. Liu, H. Nie, Y. Fu, L. Wan, and X. Kong, “Random walks: A review of algorithms and applications,” IEEE Trans. Emerg. Top. Comput. Intell., vol. 4, no. 2, pp. 95–107, 2019.

X. Mao, K. Yuan, Y. Hu, Y. Gu, A. H. Sayed, and W. Yin, “Walkman: A communication-efficient random-walk algorithm for decentralized optimization,” IEEE Trans. Signal Process., vol. 68, pp. 2513–2528, 2020.

M. Ijai and S. H. Suryawan, “Jurnal Computer Science and Information Technology ( CoSciTech ) Penerapan Algoritma Random Walk Untuk Procedural Map Pada Game ‘ The Last Hope ’ 2D Application of the Random Walk Algorithm for Procedural Maps in the 2D Game ‘ The Last Hope ,’” vol. 4, no. 3, 2024.

Shubham Pandey and R. K¨uhn, “A Random Walk Perspective on Hide-and-Seek Games,” J. Phys. A Math. Theor., pp. 0–23, 2019.

R. Febriani and S. Suprijadi, “Aplikasi Metoda Random Walks untuk Kontrol Gerak Robot Berbasis Citra,” J. Otomasi Kontrol dan Instrumentasi, vol. 2, no. 1, p. 21, 2011, doi: 10.5614/joki.2010.2.1.3.

J. Sharp et al., “Labyrinthos: A Dungeon Maze Game,” 2019.

A. Y. A. Aziz, “Implementasi Algoritme Procedural Content Generation Menggunakan Lindenmayer System untuk Membuat Dunia Tiga Dimensi bagi Permainan Bergenre Dungeon Crawler,” Institut Teknologi Sepuluh Nopember, 2021.

R. A. Krisdiawan and others, “Penerapan Model Pengembangan Gamegdlc (Game Development Life Cycle) Dalam Membangun Game Platform Berbasis Mobile,” Teknokom, vol. 2, no. 1, pp. 31–40, 2019.

PlumX Metrics

Published
2024-07-31