Puzzle game solving with breadth first search algorithm

Abstract

Abstract Today’s games have been played by many people from young to old age. There are many types of games, one of which is a puzzle game. Puzzles, which are brain teasers that challenge the skills of their players, never seem to lose their popularity and are never consumed by age. Puzzle is one type of game that is enough to squeeze the brain to solve it. The solution that can be used to simplify problem solving is to apply a search algorithm that is used to check the initial state to the final state and provide the most optimal solution for completing the puzzle, the purpose of this study were using algorithm used to solve these problems using the Breadth First Search algorithm. The use of the Breadth First Search algorithm in solving puzzle games can make it easier for users to get the best solution in the form of completion steps and also the possibility of solving various conditions based on the puzzle conditions that you want to solve.