Gamedev In-depth: Pathfinding Part 3: Finding Shortest Path @Kidscancode
Gamedev In-depth: Pathfinding Part 3: Finding Shortest Path  @Kidscancode
Uploaded January 2017 | Updated September 2026, 3 weeks ago
Pathfinding can be a tricky subject. In this mini-series, we'll demystify graphs, discuss different ways of modeling map data, and explore a few different pathfinding algorithms.

Code for this example: github.com/kidscancode/pygame_tutorials/blob/master/examples/pathfinding/part3.py

"In-depth Topics" will explore and explain a little more deeply certain subjects that may be tricky for new programmers to understand, or that may not quite fit into the usual tutorial structure. Most will likely be math related, but they may also cover other topics that come up or are requested by viewers.

Note: While the examples here will be using Python/Pygame, the actual material will apply more generally to all game development, regardless of what language you may be using.

If you like these videos please consider supporting me on Patreon: patreon.com/kidscancode
Gamedev In-depth: Pathfinding Part 3: Finding Shortest PathCircle Jump: A Godot Mobile Game (Part 4)Space Rocks! Godot Tutorial Part 5Godot 101 - Part 13: KinematicBody2D Collisions Done RightLearning Godot 3.0: Your First Game Part 1Pygame Platformer Part 1: Setting UpCircle Jump: A Godot Mobile Game (Part 9)Extra: Setting up the Atom Editor for PythonGodot 2.1 to 3.0 Gotchas!Tile-based game Part 13: Map ObstaclesSpace Rocks! Godot Tutorial Part 10Pygame Shmup Part 9: Shields
KidsCanCode |

Gamedev In-depth: Pathfinding Part 3: Finding Shortest Path

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER