"Game AI Tutorial 2 - Movement Pathfinding - PDF"
Game AI Tutorial 2 – Movement & Pathfinding 1. Finding the interception point in predictive intercepting may appear to be a shortest- distance-to-the-line problem. But, this will normally not work well. Why? 2. To make the predator character intercept the prey target, how is the predicted interception point calculated? List down the steps required. 3. What is corrective steering in predictive path-following? And, how is it implemented? (Refer to Craig Reynolds' website on path-following behavior) 4. What are some pros and cons (advantages and disadvantages) of implementing predictive path-following? 5. The figure below shows a weighted directed graph of 7 cities, labelled A to G. Given the starting position at city A, find the shortest path and least path cost to all other destination cities using Dijkstra's Algorithm. G 3 1 B 14 16 F A C 22 10 4 12 12 E D 6. Elaborate on some weaknesses of using Dijkstra's Algorithm in the context of game AI.