Surya Darma Nasution
Sekolah Tinggi Ilmu Manajemen Sukma Medan, Medan

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

Found 2 Documents
Search

Penerapan Algoritma Sattolo Shuffle dalam Sistem Pengacakan Denah Tempat Duduk Peserta Ujian untuk Mencegah Kecurangan Akademik Surya Darma Nasution; Guidio Leonarde Ginting
Bulletin of Artificial Intelligence Vol 4 No 2 (2025): October 2025
Publisher : Graha Mitra Edukasi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62866/buai.v4i2.236

Abstract

Academic cheating during examinations remains a serious problem in educational institutions. One contributing factor is the use of fixed and predictable seating arrangements, which allow exam participants to plan cheating strategies with nearby peers. This study aims to implement the Sattolo Shuffle algorithm in a seating arrangement randomization system for exam participants as a measure to prevent academic dishonesty. The Sattolo Shuffle algorithm was chosen because of its ability to generate cyclic permutations that guarantee every element moves from its original position, ensuring no exam participant occupies the same seat as in a previous exam. The study was conducted using an experimental approach involving 30 exam participants randomized using the Sattolo Shuffle algorithm. The shuffling process requires 29 iterations (n-1 iterations for n=30 elements), and the verification results show that no participant remains in their original position (0 fixed points), proving the algorithm successfully produces a perfect cyclic permutation. All 30 participants form a single cycle, confirming the derangement property of the Sattolo Shuffle algorithm
Implementasi Algoritma Sattolo Shuffle Untuk Optimasi Pengacakan Pada Game Solitaire Surya Darma Nasution; Guidio Leonarde Ginting
Bulletin of Artificial Intelligence Vol 3 No 2 (2024): October 2024
Publisher : Graha Mitra Edukasi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62866/buai.v3i2.200

Abstract

Solitaire is one of the most popular digital card games across various platforms. A critical aspect in the development of solitaire games is the card shuffling mechanism that determines the quality of gameplay experience. Suboptimal shuffling can produce predictable patterns, thereby reducing the challenge and appeal of the game. This study aims to implement the Sattolo Shuffle algorithm as a card shuffling method in solitaire games while evaluating its effectiveness in producing optimal cyclic permutations. The Sattolo Shuffle algorithm is a modification of the Fisher-Yates Shuffle algorithm specifically designed to generate cyclic permutations, where each element is guaranteed to move from its original position. Test results demonstrate that the Sattolo Shuffle algorithm can produce truly random card distributions without repeating patterns across 52 solitaire cards, consistently maintaining game difficulty levels, and providing a more dynamic playing experience compared to conventional shuffling methods. This research contributes to the development of digital card games, particularly in optimizing shuffling mechanisms to enhance gameplay quality