Yisti Vita Via
University of Pembangunan Nasional Veteran Jawa Timur

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

Procedural Level Generation For 2D Platformer Games Based On Graph And Chunk Akmal Zidan Fahreza; Chrystia Aji Putra; Yisti Vita Via
Journal of Computer Science and Technology (JOCSTEC) Vol 4 No 3 (2026): JOCSTEC - September
Publisher : PT. Padang Tekno Corp

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.59435/jocstec.v4i3.828

Abstract

Level design is one of the key components in determining the gameplay experience in 2D platformer games. However, manual level design is time-consuming and difficult to scale. Graph theory can be used to represent the abstract structure of a level, with nodes as spatial units and edges as paths connecting those spaces. The problem is that this graph structure cannot always be directly translated into a valid and playable physical layout due to platformer constraints, such as jump height, safe distance, and gravity. This research proposes a chunk-based transformation approach, in which each graph node is represented as a fixed-size level chunk containing a platform layout, obstacles, and entry and exit points. The transformation of the graph into a physical level is carried out through the selection, arrangement, and alignment of chunks based on the graph’s topology. This study aims to design a framework for transforming an abstract graph G=(V,E) into a chunk-based 2D platformer level layout. The method used is qualitative-descriptive, involving the formulation of a graph model, rules for mapping and arranging chunks, and playability criteria. The results of the study reveal three main stages: mapping vertices to corresponding chunks, arranging chunks according to the graph’s structure, and validating reachability using an automatic path-finding agent.
Classifying Legendary Pokémon with SF-Random Forest Algorithm Aji Prayoga; Yisti Vita Via; I Gede Susrama Mas Diyasa
Journal of Information System and Informatics Vol 6 No 3 (2024): September
Publisher : Asosiasi Doktor Sistem Informasi Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.51519/journalisi.v6i3.859

Abstract

Here’s an improved version of the abstract with better articulation: Accurate classification of legendary Pokémon is essential due to their distinct characteristics compared to regular Pokémon, impacting various domains such as research, gaming, and strategy development. This study employs the SF-Random Forest algorithm, an advanced variant of Random Forest, designed to effectively handle data heterogeneity and complexity. The dataset comprises 800 Pokémon samples, including attributes like type, base stats (HP, Attack, Defense, etc.), and other relevant features. To address the inherent imbalance between legendary and non-legendary Pokémon, the data preprocessing phase includes outlier removal, handling of missing values, normalization through Min-Max Scaling, and class balancing using the SMOTE (Synthetic Minority Over-sampling Technique) method. The preprocessed data is then used to train the SF-Random Forest model, with performance evaluated using metrics such as accuracy, precision, recall, and F1-score. The results reveal that SF-Random Forest achieves perfect scores across all metrics, demonstrating 100% accuracy, precision, recall, and F1-score. This highlights the algorithm's superior ability to identify key features and manage data imbalance compared to traditional classification methods. The study underscores the efficiency and robustness of SF-Random Forest as a classification tool, paving the way for the development of more advanced classification systems applicable to various fields requiring complex pattern recognition.