1. k-Canadian Traveller & Problem Setup (Haunted Escape)
In the first part, we discuss our problem of escaping a haunted house with a known number of traps, some graph theory, Dijkstra's algorithm, and the Canadian Traveller Problem (we study the k-Canadian Traveller problem), classic online problems. Next time we'll talk about how we can measure how effective online algorithms can be for problems like the k-Canadian traveller problem.
For video on Dijkstra's algorithm: https://www.youtube.com/watch?v=13Mh_kngbFs
Time Stamps:
0:00 Opening
0:20 Haunted Escape, problem setup and Ms. Kitty!
12:23 Formulating Haunted House Map as Weighted Graph, Graph Concepts
19:40 Length of a path, shortest s-t path, Dijkstra's algorithm, example
31:35 Problem formulation, Canadian Traveller Problem, k-Canadian Traveller Problem
48:45 Closing
Have a beautiful day!
Supporters (to date of publication, by tier (top to bottom)):
----------------------------------------------------------
Patreon Supporters (General Support):
Draikou
Patreon Supporters (Basic Support):
Patreon Supporters (Supporter Access!):
Eric R
-----------------------------------------------------------
Become a supporter today! To support my work and mission to provide free or accessible Computer Science education (especially in theory), subscribe to the channel, share my videos. Please donate and contribute to support my work for more content:
PATREON: https://www.patreon.com/PageWizard
SUBSCRIBESTAR: https://www.subscribestar.com/drpage
PAYPAL: https://paypal.me/pagewizard
Follow also at:
FACEBOOK: https://www.facebook.com/DanielRPage
TWITTER: https://twitter.com/PageWizardGLE
QUORA: https://www.quora.com/profile/Daniel-R-Page
TWITCH: https://www.twitch.tv/pagewizard
#ComputerScience
#canadiantravellers
#OnlineAlgorithms