Penerapan Algoritma Ascent Hill Climbing Pada Game Edukasi Penyusunan Deretan Angka Puzzle-8

Authors

  • Mike Febri Mayang Sari STMIK Jayanusa Padang, Padang

DOI:

https://doi.org/10.30865/json.v3i2.3612

Keywords:

Educational Games, Searching, Artificial intelligence, Puzzle-8, Ascent Hill Climbing Algorithm

Abstract

Number preparation using Puzzle 8 is a game that is very popular with children at this time, this educational game has very broad benefits for improving memory and thinking patterns. The 8 Puzzle Game Algorithm must have a clear step-by-step process in order to achieve a goal in the Search system. Logic Game 8 puzzles using the Ascent Hill Climbing Algorithm are often used in artificial intelligence. The problem that occurs in the research, the lack of understanding of children to find a suitable algorithm to arrange the 8 Puzzle game according to the principle of how an algorithm works. The game of compiling 8 puzzles must follow the rules that have been determined in order to obtain the correct algorithm so as to produce an arrangement that is in accordance with the initial data. The benefit of this research is that it provides a solution to complete the game of 8 puzzles according to the rules of the Ascent Hill Climbing Search Algorithm so as to produce a solution in the search method. Based on the search process, the final result of the puzzle game is in the correct position of 8 squares according to the initial rule, so the search is stopped and produces a goal.

References

S. Kasus et al., “Perbandingan Algoritma Hill Climbing Dan Algoritma Ant Colony Dalam Penentuan Rute Optimum Comparison of Hill Climbing Algorithm and Ant Colony Algorithm in Determining Optimum Route,†Jurnal Ilmu Matematika dan Terapan, vol. 11, pp. 139–150, 2017.

Y. Afero, “Artificial Intelegence Penerapan Kasus Algoritma Ascent Hill Climbing Dalam Permainan Puzzle 8,†Elkom : Jurnal Elektronika dan Komputer, vol. 14, no. 2, pp. 325–331, 2021, doi: 10.51903/elkom.v14i2.508.

A. Rachmat, “Implementasi Algoritma Generate and Test,†no. 1, pp. 1–10.

S. Rahayu, A. B. Kusumah, S. Supriyadi, and W. O. Widyarto, “Optimization of Total Production of Refined Sugar From Raw Sugar Raw Materials and Supporting Raw Materials Using the Generate-And-Test Method at PT. DSI Banten,†Journal of Machine Learning and Soft Computing, vol. 1, no. 2, p. 29, 2019, doi: 10.30656/jlmsc.v1i2.1677.

C. Puspitasari, Y. Diah, and R. Yunita, “Optimasi Rute Sales Pengiriman Berdasarkan Jarak dengan Metode Simple Hill Climbing ( Studi Kasus CV Maju Jaya ),†pp. 1–8.

Y. Adharani, E. Susilowati, and E. Purwanto, “Penerapan Metode Simple Hill Climbing Search Untuk Pencarian Lokasi Terdekat Sekolah Menengah Atas Muhammdiyah,†Sistem Informasi, Teknologi Informatika dan Komputer, vol. 7, no. 2, p. 15, 2017.

E. V. Dangkua, V. Gunawan, and K. Adi, “Penerapan Metode Hill Climbing Pada Sistem Informasi Geografis Untuk Mencari Lintasan Terpendek,†Jurnal Sistem Informasi Bisnis, vol. 5, no. 1, pp. 19–25, 2015, doi: 10.21456/vol5iss1pp19-25.

V. No, Y. I. Nurhasanah, S. Umaroh, N. Halimah, and A. Ghoniyyah, “Pencarian Rute Optimal Dengan Metode Steepest Ascent Hill Climbing Untuk Tempat Wisata Di Bandung Menggunakan Android 1 , 3 Program Studi Informatika , Institut Teknologi Nasional 2 Program Studi Sistem Informasi , Institut Teknologi Nasional membuat wisa,†vol. 4, no. 2, pp. 113–124, 2021.

N. Nurdin and S. Harahap, “Implementasi Algoritma Hill Climbing Dan Algoritma a* Dalam Penyelesaian Penyusunan Suku Kata Dasar Dengan Pola Permainan Bintang Kejora,†Jurnal Informatika, vol. 10, no. 2, pp. 1222–1232, 2016, doi: 10.26555/jifo.v10i2.a5064.

E. Elvina and L. Hakim, “Modifikasi Algoritma Steepest-Ascent Hill Climbing Dan Backtracking Untuk Pencarian Lintasan Kritis Proyek,†CogITo Smart Journal, vol. 4, no. 2, p. 268, 2019, doi: 10.31154/cogito.v4i2.133.268-282.

L. Auditya, C. Kartiko, and C. Wiguna, “Jurnal Edik Informatika Jurnal Edik Informatika,†Penelitian Bidang Komputer Sains dan Pendidikan Informatika, vol. 7, no. 1, pp. 9–18, 2020.

Downloads

Published

2021-12-31

How to Cite

Sari, M. F. M. (2021). Penerapan Algoritma Ascent Hill Climbing Pada Game Edukasi Penyusunan Deretan Angka Puzzle-8. Jurnal Sistem Komputer Dan Informatika (JSON), 3(2), 141–146. https://doi.org/10.30865/json.v3i2.3612

Issue

Vol. 3 No. 2 (2021): Desember 2021

Section

Articles

License

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License

Authors who publish with this journal agree to the following terms:

  1. 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.
  2. 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.
  3. 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).