Hi, I don’t know where I have to start for the following problem. For a 3D FPS game I should find 3 path-finding algorithms where the NPC avoid collisions with any obstacle. I have 1 day, 1 week and 1 month to implement. Which algorithm I should use and what are the main criteria to make a decision to implement the algorithm in 1 day, 1 week and 1 month. I have read many documents about different algorithms but now I don’t know which I should choose…

Why 3? And why the odd times? Is it 1 day for the first algorithm, 1 week for the second, and 1 month for the 3rd? Is this homework?

Sounds like a question from an application test I saw. It's about what would you do if you had 1 day, 1 week or 1 month to implement a pathfinding solution for a game.

Yes it is a homework.
Hmm.. there is nothing mentioned on my exercise sheet about different algorithms but
"Provide 3 different suggestions considering you’d have 1 day / 1 week / 1 month time to implement a solution."

therefor it is not completely clear for me ??

Is there a standard proceeding/algorithm in a company if there is a strict time target to implement??

e.g.: primarily we use A* and extend it depending on how much time we have???

thanks for reply

This isn't a question where you're supposed to know a 'standard'. It's a question where it's asking you about 3 different ways to attempt the same goal, one quick to implement but not very good, one very good but not quick to implement, and one in the middle. If you read about a few different approaches then it should be apparent which are more difficult and so on.

If you need to make decisions in a game, check out decision tables. In [this blog post] about the topic, the author uses a decision table to determine how a rover navigates on mars, while avoiding collisions. This sounds similar to what you need.