Upcoming SlideShare
×

# Pathfinding En

369 views
258 views

Published on

A brief overview regarding pathfinding for games.

Published in: Education
0 Likes
Statistics
Notes
• Full Name
Comment goes here.

Are you sure you want to Yes No
• Be the first to comment

• Be the first to like this

Views
Total views
369
On SlideShare
0
From Embeds
0
Number of Embeds
2
Actions
Shares
0
0
0
Likes
0
Embeds 0
No embeds

No notes for slide

### Pathfinding En

1. 1. Introduction Pathﬁnding Algorithms Conclusions Pathﬁnding Algorithms for Games Goncalo Amador ¸ e-mail: gamador@it.ubi.pt MediaLab ´ Departamento de Informatica Universidade da Beira Interior Novembro 2012
2. 2. Introduction Pathﬁnding Algorithms Conclusions 1 Introduction Overview Graph types 2 Pathﬁnding Algorithms Dijkstra A* (A Star) A* (A Star) Variants 3 Conclusions Conclusions
3. 3. Introduction Pathﬁnding Algorithms Conclusions 1 Introduction Overview Graph types 2 Pathﬁnding Algorithms 3 Conclusions
4. 4. Introduction Pathﬁnding Algorithms ConclusionsOverview Pathﬁnding for Games Goal: Find (if any) a path in a graph between a node A and node B. Problems: Fulﬁll the purpose within a limited range of time for several players. What to do if a path does not exist? Existing solutions require to much memory and/or process- ing. Solutions: New algorithms, improve existing algorithms.
5. 5. Introduction Pathﬁnding Algorithms ConclusionsGraph types Points-of-interest Graph
6. 6. Introduction Pathﬁnding Algorithms ConclusionsGraph types Regular Grid Graph
7. 7. Introduction Pathﬁnding Algorithms Conclusions 1 Introduction 2 Pathﬁnding Algorithms Dijkstra A* (A Star) A* (A Star) Variants 3 Conclusions
8. 8. Introduction Pathﬁnding Algorithms ConclusionsDijkstra Dijkstra
9. 9. Introduction Pathﬁnding Algorithms ConclusionsA* (A Star) A* (”A Star”)
10. 10. Introduction Pathﬁnding Algorithms ConclusionsA* (A Star) Variants IDA* (Iterative Deepening A Star)
11. 11. Introduction Pathﬁnding Algorithms ConclusionsA* (A Star) Variants Fringe
12. 12. Introduction Pathﬁnding Algorithms Conclusions 1 Introduction 2 Pathﬁnding Algorithms 3 Conclusions Conclusions
13. 13. Introduction Pathﬁnding Algorithms ConclusionsConclusions Conclusions A* and Fringe are the most used pathﬁnding algo- rithms for games. Pathﬁnding is a ﬁeld where improvements can be made.
14. 14. Introduction Pathﬁnding Algorithms ConclusionsConclusions Questions, Suggestions, Constructive Comments?