Adaptive Path Finding in Shooter Video Games using Ant Colony Optimization

Path finding is a very important aspect of every video game that uses any NPC in it. bots have to choose most rational path to reach their destination. A* algorithm is used for path finding in most of the games and its guaratnteed that it finds the shortest path satisfying some conditions. One important issue that is researched recently in video games is adaptivablity. One important aspect of a good game is immersion. Player is immersed in a game if its not so easy and not so hard to play. Players have different level of skills and mind ability so it’s a important task to make the game adaptive for every player. In this paper we consider an adaptive way for bots to find their path using Ant Colony optimization in a way that probabality of choosing path same as players adds up as players move in environment and add fromone to path.

کلیدواژه ها:

ACO ، path finding ، adaptive difficulity ، shooter video game