Steepest Ascent Hill Climbing Algorithm To Solve Cases In Puzzle Game 8

S Silvilestari(1*),

(1) Informatics Management Study Program, Akademi Manajemen Informatika Dan Komputer Kosgoro
(*) Corresponding Author


The 8th puzzle compiling game is part of searching. Puzzle 8 is an implementation of the steepest ascent hill climbing algorithm by following the established rules. The working process of this algorithm is by looking at the initial position of the puzzle arrangement, after carrying out the process, the results of the shift are seen, whether it is approaching the correct arrangement position. The problem that often occurs is the lack of knowledge in solving game cases quickly so that it takes a long time to obtain the final state. The main purpose of this study is to provide information so that it is easy to solve puzzle game cases using an algorithm. The final result is a puzzle arrangement that is in accordance with the rules by using the concept of an algorithm so as to obtain a decision-making system to complete the puzzle game correctly.

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.

Anam, H., Hanafi, F. S., Adifia, A. F., Ababil, A. F., & Bukhori, S. (2018). Penerapan Metode Steepest Ascent Hill Climb pada Permainan Puzzle. INFORMAL: Informatics Journal, 3(2), 36.

Climbing, A. H. (2017). Algoritma Hill Climbing Lecture Timetabling Using Hill Climbing. 1, 98–105.

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.

Darnila, E., Teknik, F., Malikussaleh, U., Teknik, F., & Malikussaleh, U. (2019). Lokasi Klinik Kesehatan Menggunakan Algoritma Steepest Ascent Hill. 11(2), 268–279.

Hutahaean, H. D. (2018). Penerapan Metode Best First Search Pada Permainan Tic Tac Toe. Journal Of Computer Networks, Architecture and High Performance Computing, 1(1), 10–15.

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.

Innayah, I., & Afri, E. (2018). Implementasi Menggunakan Metode Steepest Ascent Hill Climbing pada Game Math Puzzle berbasis Android. 3(1).

Permenkes RI No. 43 2019. (2019). No Titleس. ペインクリニック学会治療指針, 2, 1–13.



  • There are currently no refbacks.

Jumlah Kunjungan:

View My Stats

Published Papers Indexed/Abstracted By: