Study of NPC Pathfinding Algorithm for MMOG
The traditional pathfinding algorithm in MMOG can only provide an efficient path for NPC.It could result in congestion of colony NPC when they are moving.This paper proposes DIDA* algorithm based on iterative deepening.It can provide many a better path to solve the problem of colony NPC moving.With the variation of map information,NPC may encounter obstacles while moving.This paper uses a kind of local connected Hopfield neural network model to train NPC to avoid the obstacles in real-time environment.The experiment results show that the colony NPC can search the goal fleetly by DIDA* algorithm.When the path changed,NPC can avoid the obstacles then reach destination,so it is adapted for MMOG's dynamic environment.