Game Edukasi Pembelajaran Menghitung Susunan Angka Pada Puzzle-8 Menggunakan Metode Steepest Ascent Hill Climbing
-
Padma Mike Putri M
*
AMIK Kosgoro, Solok, Sumatera Barat,
Indonesia
(*) Corresponding Author
Abstract
Learning games are games that are very much in the interest of preschool children today in carrying out activities because basically, this game playing uses the term play while learning, this game is very useful in brain development for preschool children to increase thinking data in sharpening the brain, this game consists of 8 sequences of numbers that are not sequentially arranged into consecutive numbers to become Puzzled -8 guided by the concept of the rules in the algorithm. The problem, in this case, is the children's lack of interest in learning to count and compile numbers because it is difficult to understand. With the learning game, the aim of this research is to help early childhood children in calculating the sequence of numbers that are usually difficult to understand. This game can be used as a game arena but contains elements of learning and compiling puzzle numbers 8. The method used uses the Ascent Hill Climbing Algorithm which is the process of The work of this algorithm that can produce a regular array of numbers by using the concept of shifting the value of numbers according to the existing rules in the Steepest Ascent Hill Climbing Method algorithm.
Downloads
References
Prasetyo, B., Agustina, I., & Gufroni, M. (2017). Perancangan Game Puzzle Pemadam Kebakaran Menggunakan Metode Linear Congruential Generator (LCG). JOINTECS (Journal of Information Technology and Computer Science), 2(2). https://doi.org/10.31328/jointecs.v2i2.473.
Novayani, W. (2019). Game genre untuk permainan pembelajaran sejarah berdasarkan kebutuhan Pedagogi dan Learning Content. Jurnal Komputer Terapan, 5(2), 54–63. https://jurnal.pcr.ac.id/index.php/jkt/.
V., Nurhasanah, Y. I., Umaroh, S., Halimah, N., & Ghoniyyah, A. (2021). Pencarian Rute Optimal Dengan te…. 4(2), 113–124.
Wijaya, E. (2013). Jurnal TIME , Vol. II No 2 : 18-26, 2013 ISSN. Time, II(2), 18–26.
Potdar, G. P., & Thool, R. C. (2014). Comparison of Various Heuristic Search Techniques for Finding Shortest Path. International Journal of Artificial Intelligence & Applications, 5(4), 63–74. https://doi.org/10.5121/ijaia.2014.5405
Dangkua, E. V., Gunawan, V., & Adi, K. (2015). Penerapan Metode Hill Climbing Pada Sistem Informasi Geografis Untuk Mencari Lintasan Terpendek. Jurnal Sistem Informasi Bisnis, 5(1), 19–25. https://doi.org/10.21456/vol5iss1pp19-25.
Lumenta, A. S. M. (2014). Perbandingan Metode Pencarian Depth-First Search, Breadth-First Search Dan Best-First Search Pada Permainan 8-Puzzle. E-Journal Teknik Elektro Dan Komputer, 1–6.
Aida, S. Aries, P. D. (2017). Penjadwalan Perkuliahan Menggunakan Algoritma Hill Climbing. Prosiding Seminar Nasional Informatika Dan Sistem Informasi, 1, 98–105.
Nurdin, N., & Harahap, S. (2016). Implementasi Algoritma Hill Climbing Dan Algoritma A* Dalam Penyelesaian Penyusunan Suku Kata Dasar Dengan Pola Permainan Bintang Kejora. Jurnal Informatika, 10(2). https://doi.org/10.26555/jifo.v10i2.a5064
Ilwaru, V. Y. I., Sumah, T., Lesnussa, Y. A., & Leleury, Z. A. (2017). Perbandingan Algoritma Hill Climbing Dan Algoritma Ant Colony Dalam Penentuan Rute Optimum. BAREKENG: Jurnal Ilmu Matematika dan Terapan, 11(2), 139–150. https://doi.org/10.30598/barekengvol11iss2pp139-150
Abrori, M., & Setiyani, R. N. (2015). Implementasi Algoritma Best-First Search (BeFS) pada Penyelesaian Traveling Salesman Problem (TSP) (Studi Kasus: Perjalanan Wisata Di Kota Yogyakarta). Jurnal Fourier, 4(2), 93. https://doi.org/10.14421/fourier.2015.42.93-111
Rizaldi, R. (2020). Komparasi Algoritma Sequential Searching dan Interpolation Searching Pada Studi Kasus Pencarian Data Tilang Pengadilan Negeri Samarinda. Jurti, 4(1), 86–92.
Juniansyah, A., & Mesterjon. (2016). Aplikasi Penentuan Rute Terpendek Untuk Bagian Pemasaran. Media Infortama, 12(1), 31–40.
Putri, A. N. (2016). Optimasi Alghoritma Breadth First Search Pada Game Engine 3D Third Person Shooter Maze Berbasis Agen Cerdas Android. Jurnal Transformatika, 14(1), 50. https://doi.org/10.26623/transformatika.v14i1.349
Alfarisi, W. (2016). Pencarian Jalur Terpendek Pengirima N Barang Menggunakan Algoritma A* Studi Kasus Kantor POS Besar Medan). JURIKOM (Jurnal Riset Komputer), 3(1), 90–95. http://dx.doi.org/10.30865/jurikom.v3i1.58
Rafi, F. M. (2020). Aplikasi Informed dan Uninformed Search Dalam Penentuan Rute Liburan Keluarga.
Apriandi, R., Rismawan, T., & Midyanti, D. M. (2018). Penerapan Metode Best First Search (BFS) Untuk Pencarian Lokasi Spbu Terdekat Menggunakan Arduino Berbasis Android. Jurnal Coding, Sistem Komputer Untan, 06(1), 1–11.
Auditya, L., Kartiko, C., & Wiguna, C. (2020). Jurnal Edik Informatika Jurnal Edik Informatika. Penelitian Bidang Komputer Sains dan Pendidikan Informatika, 7(1), 9–18.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Game Edukasi Pembelajaran Menghitung Susunan Angka Pada Puzzle-8 Menggunakan Metode Steepest Ascent Hill Climbing
Pages: 148-154
Copyright (c) 2021 Padma Mike Putri M
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).
