Introduction Pathﬁnding Algorithms Conclusions Pathﬁnding Algorithms for Games Goncalo Amador ¸ e-mail: firstname.lastname@example.org MediaLab ´ Departamento de Informatica Universidade da Beira Interior Novembro 2012
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.