Doni El Rezen Purba, Anirma Kandida Ginting, Alex Rikki, Zekson Arizona Matondang
The Depth First Search Algorithm (DFS) is one form of the Search Algorithm, DFS performs a search by expanding the first root child of the selected search tree and going deeper until the destination node is found, or until it finds a node that has no children. Then Search Backtracking will return to the node that has not finished tracing. Fisher Yates Algorithm is one of several Randomization Algorithms. Fisher Yates was used to change the order of a randomly given input. The permutations generated by this algorithm appear with the same probability. In this educational game, this Counting Operation was formed based on these two algorithms. The DFS algorithm is used in the maze-making process and in the randomization process with the Fisher Yates Algorithm. The form of this Counting Operations educational game, players explore the labyrinth space while passing through the numbers that appear. The numbers that have been skipped will be stored by the system to perform a Count Operation according to the player's initial choice. When the player manages to find a way out of the Labyrinth, a question will appear, how many answers are there from the numbers that have been passed after the calculation operation is carried out. If the player succeeds in answering the question, a score will be given in the form of a star. © 2023 Author(s).
Universitas Katolik Santo Thomas, Medan, Indonesia