PROBLEM
CRITICAL REVIEW ON CURRENT ALGORITHM + CURRENT PROBLEM
For implementing Pac-Man game, scratch is used to demonstrate this game. Scratch used tree and lines so, it is not efficient enough to implement big games like Pac-Man.
As following video, it shows that the ghost only following the
Pac-Man using current algorithm and been looping non stop.
​
Scratch used is not challenging enough to the players to feel the thrill of playing Pac-Man
SOLUTION
Thus, in order to improve the game we use another environment called Processing that runs using Java language. In that environment, we test new differents algorithm such as Depth-First Search (DFS), Breadth-First Search (BFS) and A* Search.
Thus, in order to improve the game we use another environment called Processing that runs using Java language. In that environment, we test new differents algorithm such as Depth-First Search (DFS), Breadth-First Search (BFS) and A* Search.
We just reuse another project and the full source code can be obtain here :