The Knight's Tour Problem and Depth First Search (Python)
Channel: VLearnX
Date: 27/05/2022

E004 - In this session, we discuss The Knight's Tour Problem and it's solution using Depth First Search(DFS) algorithm (with Warnsdorff rule heuristic).

A longer video of the search can be found here: https://youtu.be/1BUM7ShH3v0

Jim Cathode, Tiffany Spectrum - both are fictional characters. Azure TTS is used for their voices.

Source code can be found here:
https://github.com/vinaynk/VLearnX/blob/main/algorithms/depth_first/chess_knight_journey.py

Feel free to try this at home! 
(Expect a lot of code changes and cleanups. So to get the exact version as in this video, look for commit 9e166574cba37a8b3fe22a417ff9e3e2758404d0)
--
00:00 - Introduction
01:10 - Depth first search (DFS) on a tree
04:48 - Knight's movements
06:25 - Search environment
07:11 - DFS function
09:11 - Warnsdorff's rule
10:29 - Search output
11:13 - Search result visualization
12:20 - Credits & Thanks
--

NOTE:
As with any tutorial, there can be errors or bugs in this as well. Please let us know if you find any such issues.

Credits 
Piano samples: Alexander Holm (Wavforms generated follows license CC BY 3.0)
Drum samples: Jesterdyne  (from freesound.org, CC BY 3.0)

Thumbnail: beytlik (pexels)
(They are not associated with the project)

#python #algorithm #chess #dfs #tutorial