Implementasi Algoritma Sattolo Shuffle Untuk Optimasi Pengacakan Pada Game Solitaire


  • Surya Darma Nasution * Mail Sekolah Tinggi Ilmu Manajemen Sukma Medan, Medan, Indonesia
  • Guidio Leonarde Ginting Sekolah Tinggi Ilmu Manajemen Sukma Medan, Medan, Indonesia
  • (*) Corresponding Author
Keywords: Sattolo Shuffle Algorithm; Random Number Generator; Solitaire Game; Card Shuffling; Cyclic Permutation

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

References

A. Ibijola and A. Olu, “A Simulated Enhancement of Fisher-Yates Algorithm for Shuffling in Virtual Card Games using Domain-Specific Data Structures,” Int. J. Comput. Appl., vol. 54, no. 11, pp. 975–8887, 2012.

S. D. Nasution and S. Suginam, “Modifikasi Algoritma Fisher Yates Shuffle Menggunakan Linear Congruent Method Untuk Pembangkitan Bilangan Acak,” Jurnal Ilmu Komputer, vol. 12, no. 2, pp. 101–106, 2019.

S. Bulolo, “Implementasi Metode Linear Congruent Method (LCM) pada Simulasi Ujian Akhir Sekolah Menengah Kejuruan Lolomatua,” in Prosiding Seminar Nasional Teknologi Informatika, 2019, pp. 60–64.

S. Angelina and A. D. Wowor, “Optimasi Pembangkit Bilangan Acak Dengan Fungsi Polinomial Dan Kombinasi Metode Iterasi,” JIKO (Jurnal Informatika dan Komputer), vol. 8, no. 2, p. 367, Sep. 2024, doi: 10.26798/jiko.v8i2.1313.

M. Yohanna, F. G. N. Larosa, and D. F. Malau, “Aplikasi Ujian Try Out Dengan Menerapkan Algoritma Fisher Yates Shuffle,” Jurnal Teknik Informatika, vol. 14, no. 2, 2022.

M. A. Hasan, S. Supriadi, and Z. Zamzami, “Implementasi Algoritma Fisher-Yates Untuk Mengacak Soal Ujian Online Penerimaan Mahasiswa Baru (Studi Kasus : Universitas Lancang Kuning Riau),” Jurnal Nasional Teknologi dan Sistem Informasi, vol. 3, no. 2, pp. 291–298, Sep. 2017, doi: 10.25077/teknosi.v3i2.2017.291-298.

I. Febriani, R. Ekawati, U. Supriadi, and M. I. Abdullah, “Fisher-Yates shuffle algorithm for randomization math exam on computer based-test,” in AIP Conference Proceedings, American Institute of Physics Inc., Apr. 2021. doi: 10.1063/5.0042534.

S. C. Santo and N. M. S. Iswari, “Design and Development of Animal Recognition Application Using Gamification and Sattolo Shuffle Algorithm on Android Platform Case Study: Kebun Binatang Ragunan,” IJNMT (International Journal of New Media Technology), vol. IV, no. 1, 2017.

Y. Arviansyah, N. Nurfaizah, and R. Waluyo, “Penerapan Algoritma Fisher Yates Shuffle Pada Aplikasi TOEFL Preparation Berbasis Web,” Jurnal Buana Informatika, vol. 11, no. 2, pp. 112–122, 2020.

Yusfrizal, D. Adhar, U. Indriani, E. Panggabean, A. Sabir, and H. Kurniawan, “Application of the Fisher-Yates Shuffle Algorithm in the Game Matching the World Monument Picture,” in 2020 2nd International Conference on Cybernetics and Intelligent System, ICORIS 2020, Institute of Electrical and Electronics Engineers Inc., Oct. 2020. doi: 10.1109/ICORIS50180.2020.9320766.

A. Imron Panjaitan, “Perancangan Aplikasi Memory Card Games Dengan Menerapkan Metode Multiplicative Random Number Generation,” Journal Global Tecnology Computer, vol. 2, no. 1, pp. 24–30, 2022.

S. Supriyadi, D. Hamdani, and Y. M. Furqon, “Rancang Bangun Alfabet Memory Game Menggunakan Linear Congruent Method (LCM),” Jurnal Teknologi dan Manajemen Informatika, vol. 3, no. 1, 2018.

F. Fujiati and S. Lestari Rahayu, “Implementasi Algoritma Fisher Yate Shuffle Pada Game Edukasi Sebagai Media Pembelajaran,” Cogito Smart Journal, vol. 6, no. 1, 2020.

W. Diharjo, D. Ahkam Sani, and M. Firman Arif, “Game Edukasi Bahasa Indonesia Menggunakan Metode Fisher Yates Shuffle Pada Genre Puzzle Game,” INTEGER: Journal of Information Technology, vol. 5, no. 2, pp. 23–35, 2020.


Bila bermanfaat silahkan share artikel ini

Berikan Komentar Anda terhadap artikel Implementasi Algoritma Sattolo Shuffle Untuk Optimasi Pengacakan Pada Game Solitaire

Article History
Published: 2024-10-31
Abstract View: 11 times
PDF Download: 5 times
How to Cite
Nasution, S. D., & Ginting, G. L. (2024). Implementasi Algoritma Sattolo Shuffle Untuk Optimasi Pengacakan Pada Game Solitaire. Bulletin of Artificial Intelligence, 3(2), 42-49. https://doi.org/10.62866/buai.v3i2.200
Section
Articles