Unity 5: 2D Pathfinding
32mIntermediate2016-10-10
Authors

Jesse Freeman
Head of Partner and Framework Marketing at Amazon
Course details
Learn how to move characters and objects from point A to B with this introduction to pathfinding in Unity 5. This training focuses on pathfinding in the 2D world: programming simple ways to connect different locations in 2D games. Jesse Freeman starts by explaining the data structures (graphs and nodes) and the A* pathfinding algorithm: the technology that makes traversal of 2D games possible. Then he shows you how to connect paths in a 2D map, and find the fastest path between two points. You'll also build a simple demo map to illustrate and test the pathfinding logic.
Learning objectives
What is A*?
Adding node classes and properties
Storing and indexing graph nodes
Building the search class
Traversing the nodes
Searching adjacent nodes
Testing the search
Building a test map
Creating and coloring a grid
Learning objectives
What is A*?
Adding node classes and properties
Storing and indexing graph nodes
Building the search class
Traversing the nodes
Searching adjacent nodes
Testing the search
Building a test map
Creating and coloring a grid
Skills covered
Real-TimeGame DevelopmentUnityVisualization and Real-TimeAECProduct and ManufacturingSoftware DevelopmentDeep Dive (X:Y)
Concepts
0. Introduction
- 01 - Welcome
- 02 - Exercise files
1. Pathfinding Introduction
- 03 - What is A
- 04 - Setting up the project
2. The Node Class
- 05 - What is a node
- 06 - Adding the node property
3. The Graph Class
- 07 - What is a graph
- 08 - Storing the node
- 09 - Indexing the nodes
- 10 - Testing for neighbors
4. The Search Class
- 11 - Building the Search class
- 12 - Starting the search
- 13 - The Step method
- 14 - Traversing the nodes
- 15 - Continuing the search
- 16 - Searching adjacent nodes
- 17 - Getting the node index
5. Testing the Search
- 18 - Building a test map
- 19 - Running the search
- 20 - Creating a grid in Unity IU
- 21 - Changing colors on the grid
- 22 - Showing the path
Conclusion
- 23 - Next steps