Pathfinding in Warcraft 1
Posted
by
Valmond
on Game Development
See other posts from Game Development
or by Valmond
Published on 2012-09-14T12:11:19Z
Indexed on
2012/09/14
15:50 UTC
Read the original article
Hit count: 213
Dijkstra and A* are all nice and popular but what kind of algorithm was used in Warcraft 1 for pathfinding?
I remember that the enemy could get trapped in bowl-like caverns which means there were (most probably) no full-path calculations from "start to end". If I recall correctly, the algorithm could be something like this:
A) Move towards enemy until success or hitting a wall B) If blocked by a wall, follow the wall until you can move towards the enemy without being blocked and then do A)
But I'd like to know, if someone knows :-)
© Game Development or respective owner