Pathfinding Solving in Maze Game Using Backtracking Algorithm

  • Prasetyo T
N/ACitations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

Games are a means of entertainment that great demand by the community. Besides games as entertainment, games can also practice thinking skills to find solutions. A game that contains elements of artificial intelligence requires algorithms in its implementation. One type of the game is Maze Game, where players are required to find a way out of the maze. Backtracking algorithm was chosen to solve this game. This algorithm works recursively to solve problems by finding possible solutions. If the path being traced is not the right solution, it will be backtracked and traced to other paths. This solution will not be ignored or deleted. But if the path taken is right, it will continue to check the next path until the player reaches the final solution.

Cite

CITATION STYLE

APA

Prasetyo, T. A. (2023). Pathfinding Solving in Maze Game Using Backtracking Algorithm. Jurnal CoreIT: Jurnal Hasil Penelitian Ilmu Komputer Dan Teknologi Informasi, 9(1), 39. https://doi.org/10.24014/coreit.v9i1.17109

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