Penerapan Metode Steepest Ascent Hill Climb pada Permainan Puzzle

  • Anam H
  • Hanafi F
  • Adifia A
  • et al.
N/ACitations
Citations of this article
46Readers
Mendeley users who have this article in their library.

Abstract

Puzzle is one example of the application of artificial intelligence, in the process of completion there are many search algorithms that can be applied. The 8 puzzle solution will be faster obtained if the array principle is used with a variation of the Steepest-Ascent Hill Climbing (Hill Climbing algorithm by choosing the sharpest / steepest slope) with the correct heuristic parameters and distance heuristics and combined with LogList as the storage state ever passed to overcome the problems in the hill climbing algorithm itself and avoid the looping state that has been passed. Steepest Ascent Hill Climbing is an algorithm method that is widely used for optimization problems. The application of the SAHC (Steepest Ascent Hill Climbing) Algorithm to the puzzle is needed so that the game is completed with optimal time.

Cite

CITATION STYLE

APA

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. https://doi.org/10.19184/isj.v3i2.9987

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free