Implementation Backtracking Algorithm, and Tree in Mouse Trap Maze Game
Daftar Isi:
- This game is a simple game, which is played by two characters. Where the mouse is called the user and doraemon is called the computer (AI). In this game the mouse (user) can move one step in left, up, right, and down to find the door to finish, and doraemon (computer) will eat mouse and prevented from reaching the door finish. This game uses backtracking algorithm. This algorithm is applied to locate the mouse. Step movement computer stored in tree. This game will end when the mouse reaches the finish or the mouse in a pinch not find a way. In this game backtracking algorithm is not perfect in the search process mouse (player) because the mouse is always moving. Backtraking algorithm will be optimized when performing a search of placing fixed and not moving.