Comparison of Ascent Hill Climbing Algorithm And Simple Hill Climbing Algorithm Solving The 8-Puzzle Case

Padma Mike Putri M(1*),

(1) Computer Engineering, Akademi Manajemen Informatika Dan Komputer Kosgoro, Solok
(*) Corresponding Author


Puzzle 8 game is a game that shifts numbers in the form of a box consisting of 9 squares arranged with numbers 1 to 8 based on the order of count and there is an order of 3x3. This form of game is very easy to complete if you follow the rules that have been applied to the algorithm. Comparison of the ascent hill climbing algorithm and the simple hill climbing algorithm. The purpose of this algorithm is to help children who are just learning to arrange a sequence of numbers so that they explore brain power and increase imagination for children. The difference between the ascent hill climbing algorithm and the simple hill climbing algorithm lies in the search movement which does not start from the far left position but the next movement is searched based on the best heuristic value. To obtain the Goal, a systematic process is needed to make it easy and fast in finding solutions so as to save time in finding the final goal.

Full Text:



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.

Afero, Y. (2021). Artificial Intelegence Penerapan Kasus Algoritma Ascent Hill Climbing Dalam Permainan Puzzle 8. Elkom : Jurnal Elektronika dan Komputer, 14(2), 325–331.

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.

Elvina, E., & Hakim, L. (2019). Modifikasi Algoritma Steepest-Ascent Hill Climbing Dan Backtracking Untuk Pencarian Lintasan Kritis Proyek. CogITo Smart Journal, 4(2), 268.

Informatika, J. R. (2019). Implementasi Algoritma Hill Climbing Pada Penentuan. 1(3).

S., Rute, P., Jalur, O., Ferry, P., Seram, P., Lease, P., 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.

No, 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.

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.

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.

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.



  • There are currently no refbacks.

Jumlah Kunjungan:

View My Stats

Published Papers Indexed/Abstracted By: