Application of Artificial Intelligence on Puzzle-8 Using Steepest Ascent Hill Climbing Algorithm

Y Yendrizal(1*),

(1) AMIK KOSGORO
(*) Corresponding Author

Abstract


The Steepest-Ascent Hill Climbing algorithm is part of the implementation of artificial intelligence. To solve the case problem in Puzzle 8, an algorithm is needed to obtain the final result. Problems that often occur in this algorithm include, 1. the state of all adjacent boxes is worse or equal to its own state, 2. the state of all adjacent cities is the same as its own state, 3. local optimum which is due to the inability to use all operators at once. The way the Ascent Hill Climbing algorithm works is to start with the initial state, perform the test, if it is a goal then stop, and if not, continue with the current state as the initial state. The final result of this research is that there are 5 incorrect positions, after the completion process there are 8 correct puzzle positions according to the final state. Thus the test is stopped because it has obtained the final state.

Full Text:

Pdf

References


Abraham, D., & Permana, I. W. (2016). Penyelesaian Masalah 8-Puzzle dengan Algoritma Steepest-Ascent Hill Climbing. Setrum : Sistem Kendali-Tenaga-elektronika-telekomunikasi-komputer, 4(1), 40. https://doi.org/10.36055/setrum.v4i1.465

. 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

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.

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

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.

Widya Rika Perdana. (2021). Implementasi perbandingan algoritma simple hill climbing dan algoritma ascent hill climbing pada permainan 8-puzzle. 41-51.

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




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

Refbacks

  • There are currently no refbacks.







Jumlah Kunjungan:

View My Stats

Published Papers Indexed/Abstracted By: