Optimalisasi Penyelesaian Permainan pada Game Puzzle 8 dengan Perbandingan Algoritma A* dan Greedy

Abstract

The development of a fast and diverse game makes the game as one of the stress relievers for humans. There are some games that are created to hone the ability of users, but there are also games that are created only limited to mild entertainment. Games that are too difficult to solve, it is not impossible that it will make users event stress and stop playing the game. One of the games that is enough to drain the mind is puzzle 8, where players are required to be able to cpmplete the game by arranging each game box so that they can be arranged in order. Many methods can be used to help solve puzzle 8 games. One of them is the A-star algorithm. A-star is used to finish the game optimally by using heuristic function. Which heuristics is one technique that develops efficiency in search. The making of this project is to implement the A-star algorithm in puzzle 8 using the Java programming language. In testing the A-star algorithm application has fewer steps compared to the Greedy algorithm, but the time required for the A-star algorithm is longer. This is because A-star calculates costs twice, but the Greedy algorithm is only one time. After testing it can be concluded that the S-star algorithm provides optimal steps in solving puzzle 8 viewed from the number of steps to complete the game.