CSE 380 – Computer Game Programming Pathfinding AI. Dig Dug, by Namco. Pathfinding. Computation and execution of a path from point p1 to p2 Perhaps most common AI problem in games Can be very frustrating to implement well Algorithms must be tailored to fit games
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Dig Dug, by Namco
v.x = p2.x – p1.x
v.y = p2.y – p1.y