Comparison of Simple Hill Climbing Algorithm and Stepest Ascent Hill Climbing Algorithm in The Game Order of Numbers

Narti Eka Putria(1*),

(1) STIE Nagoya Indonesia
(*) Corresponding Author

Abstract


The arrangement of a series of numbers is a game that is in great demand by various groups, this game is very useful for all circles because this game requires concentration and sharpening the brain power of the player, if this game follows the existing rules it will produce output in the form of a solution. Arrangement of numerical series is an implementation of the Searching method. The process of compiling a series of numbers has strong rules in order to obtain a solution. Problems In this study, we are looking for a comparison between the Simple Hill Climbing Algorithm and the Ascent Hill Climbing Algorithm which method is the fastest to find a solution. The final result of this research is an arrangement of numbers that is in accordance with the sequence by looking at the time and memory used to obtain the final solution.The final result of this study concluded that the Ascent Hill Climbing Algorithm is easier and faster to find a solution compared to the Simple Hill Climbing Algorithm

Full Text:

Pdf

References


Febri, M., & Sari, M. (2021). Penerapan Algoritma Ascent Hill Climbing Pada Game Edukasi Penyusunan Deretan Angka Puzzle-8. 3, 141–146. https://doi.org/10.30865/json.v3i2.3612.

Afero, Y. (2021). Artificial Intelegence: Penerapan Kasus Algoritma Ascent Hill Climbing Dalam Permainan Puzzle 8. Elkom : Jurnal Elektronika dan Komputer, 14(2), 325–331. https://doi.org/10.51903/elkom.v14i2.508.

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), 1222–1232. https://doi.org/10.26555/jifo.v10i2.a5064.

Auditya, L., Kartiko, C., & Wiguna, C. (2020). Jurnal Edik Informatika Jurnal Edik Informatika. Penelitian Bidang Komputer Sains dan Pendidikan Informatika, 7(1), 9–18.

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 Comparison of Hill Climbing Algorithm and Ant Colony Algorithm in Determining Optimum Route. Jurnal Ilmu Matematika dan Terapan, 11, 139–150.

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

V., Nurhasanah, Y. I., Umaroh, S., Halimah, N., & Ghoniyyah, A. (2021). 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. 4(2), 113–124.

Satriyo, A. (2020). Penerapan Metode Simple Hill Climbing Dalam Menentukan Rute Terpendek Pada Pengiriman (Studi Kasus di Supplier Hotel). JISO : Journal of Industrial and Systems Optimization, 3(2), 79–83. https://doi.org/10.51804/jiso.v3i2.79-83.

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.

Adharani, Y., Susilowati, E., & Purwanto, E. (2017). Penerapan Metode Simple Hill Climbing Search Untuk Pencarian Lokasi Terdekat Sekolah Menengah Atas Muhammdiyah. Sistem Informasi, Teknologi Informatika dan Komputer, 7(2), 15.

Anam, H., Hanafi, F. S., & Adifia, A. F. (2018). Penerapan Metode Steepest Ascent Hill Climb pada Permainan Puzzle. 3(2), 36–40.




DOI: https://doi.org/10.30645/ijistech.v6i1.210

Refbacks

  • There are currently no refbacks.







Jumlah Kunjungan:

View My Stats

Published Papers Indexed/Abstracted By: