Pathfinding Intro

Question 1

Pathfinding uses undirected weighted graphs?

Answer 1

No, sometimes we need directed weighted graphs

Question 2

Basic pathfinding algorithms

Answer 2

D. Dijkstra
G. Generic Best First Search
A. A* Search

Question 3

World Representations for pathfinding

Answer 3

G. Graphs
G. Grids
M. Meshes

Question 4

Improving pathfinding performance examples

Answer 4

A. A* data structures
H. Heuristics for pathfinding
A. A* variants for pathfinding

Question 5

How do we solve additional movement problems on pathfinding?

Answer 5

Path post processing

Question 6

1- With the Local Movement you go ___ to ___ ___ and only ___ ___ if an ___ is in front of you
2- Pathfinding finds ___ ___ ___ ___

Answer 6

1- directly / the Target / changes route / obstacle

2- the most Efficient path

Question 7

Pathfinding defenition:

Finding a good path from a ___ ___ to a ___ ___ avoiding ___ and ___ ___

Answer 7

starting point
goal point
obstacles
minimizing costs