Pacman: Chase Algorithm

Started by
10 comments, last by jammanut 17 years, 6 months ago
Quote:Original post by Daivuk
When I came to an interview at DTI soft in montreal, they told me about the algo (just for my general culture) and they said :

The pacman algo is A*

- One of the ghost takes the shortest way
- One of the ghost takes the longest
- The other is just random


Maybe they are wrong, but it sounds perfect to me.
They were wrong. There's no reason why A* or dijkstra would've been implemented in a game made in 1980. Computer resources were scarce, programming was hard (full asm most likely) and moreover, the game wouldn't be any better with A* ghosts (I can imagine it being worse). Plus, A* doesn't give you the longest way. What even is the longest way when you can just loop in a circle forever in some corner?
Advertisement
Hi. I found this:
http://jongy.tripod.com/GhostPsychology.html
last year when I was thinking of writing of my own PacMan clone. I hope it helps.

Jon

This topic is closed to new replies.

Advertisement