Channel: TheHappieCat

Category: Science & Technology

Tags: pathfindingthehappiecatc#aicleardijkstrathehappycatsimpleeasypathingartificial intelligencehappycatshortest pathhappiecatgame developmentunitygame devhow-todijkstra's algorithmtutorialvideo games

Description: Today's video is on using Dijkstra's algorithm to find a shortest path when edges have different weights. We'll use this as a bridge to look at the A* algorithm in the next video, a similar but better performing technique. The A* video will be out later this week! And then something a bit different for next week / first week of June. Look at the project on Github: github.com/anneomcl/PathfindingBasics Check out my Patreon, all funds go directly back to the show: patreon.com/thehappiecat Find challenges and ask questions here: reddit.com/r/TheHappieMakers My second channel! youtube.com/c/TheHappierCat2 Follow me on Twitter: twitter.com/TheHappieCat Or Facebook: facebook.com/TheHappieCat Or Twitch: twitch.tv/happiecat