Muhammad Rama Alfiannur
Department of Information Technology, Faculty of Science and Technology, Universitas Sari Mulia Banjarmasin Indonesia

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

Found 1 Documents
Search

Algorithms and Web Architecture for Lightweight Multiplayer Archipelago Monopoly Game Engine Muhammad Fahrul Bahri; Muhayat Muhayat; Akhmad Hafidz Ardianto; Husni Majedi; Muhammad Rama Alfiannur
Sinkron : jurnal dan penelitian teknik informatika Vol. 10 No. 4 (2026): Research Articles October 2026
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/sinkron.v10i4.16866

Abstract

Browser-based turn-based simulations frequently encounter client-side rendering bottlenecks and transactional race conditions when operating on low-bandwidth networks without dedicated server daemons. This study introduces an optimized web game architecture and programmatic pipeline implementing canonical economic board game rules contextualized within Indonesian geography. The proposed framework integrates four core algorithmic solutions: an atomic advisory file-locking transaction system utilizing flock() for room-level state concurrency control without relational database engines; a category-interleaved deck shuffling algorithm establishing mathematical guarantees against prolonged penalty sequences; an autonomous heuristic decision model that dynamically balances property acquisition costs against risk-adjusted liquidity reserves; and real-time audio synthesis executed entirely via native browser oscillators. Rigorous experimental evaluation spanning computational simulations, ApacheBench load tests, and user testing verified system capabilities. The card distribution mechanism completely bounds consecutive adverse event occurrences to two draws across two thousand execution cycles, mitigating punitive card clustering. In two hundred simulated four-player matches, the autonomous agent demonstrated a thirty-five percent victory frequency, significantly outperforming greedy over-leveraging and naive random baseline strategies while sustaining sub-millisecond calculation speed. Concurrency benchmarking confirmed server throughput of four hundred fifty requests per second under peak load with zero data corruption, and thirty participants reported a composite system usability score of eighty-four. These outcomes validate that disciplined algorithm and programming methodologies coupled with lightweight state isolation deliver high-performing multiplayer gaming experiences over standard web protocols without requiring complex server daemons.