This presentation is discussed the way to solve the Pacman game. Pacman is one of the most popular video games developed by Namco and released by Midway in Japan, May 22 1980. In Pacman games, the player should walk through maze and eat all dots to finish the game, also the player must avoid colliding with the ghosts to keep alive. But in this paper the game will be simplified, thus there are no ghosts and the things that the Pacman need to do is eat all dots in the maze to finish the game. There are two ways that can be used to solve the Pacman, which are using backtracking algorithm and BFS algorithm. Backtracking algorithm is one of the algorithms that usually use by developer to solve computational problems, that based on the Depth First Search (DFS). By using backtracking algorithm, we only need to check the possibility of providing solution. Providing solution in this case is the considered solution, therefore the searching time is more efficient. While the BFS (Breadth First Search) algorithm is an algorithm that performs a wide spread that checks in pre-order that is checking a possibility adjacent first. This paper is implementing backtracking algorithm and BFS algorithm to make the Pacman eat all the dots automatically. In particular, we have shown that both algorithms can handle the Pacman eat all dots to finish the game. The results show that to solve Pacman game simplified version, backtracking algorithm is more efficient than BFS algorithm.
