Normally enemy would use A* to find a path to the “hero”, but my problem is:
1)I have no knowledge of pathfinding.
2)My map is really huge so traversing through all cells will take eternity.
3)There will be multiple enemies, plus the hero is constantly moving, so making it more difficult to calculate a path.
What solution can i use for this? I thinking of maybe there is some trick i can use instead of actual pathfinding. Things that may be of benefit here:-
1)The chase begins and continues only if enemy is near the player(simple distance check).
2)The paths are all straight, no curve, no angles, all are at 90degrees
