Depth-First Search Algorithm Maze Creation

preview_player
Показать описание
Depth-First Search (DFS) is an algorithm for searching graph data structures. The algorithm starts with a random or given node and explores as far as possible each branch before backtracking.

In this video it is used to randomly generate a maze. DFS will follow a path through the maze until a dead end and backtrack to find another path until it finds an exit.

The mazes created with this algorithm are "perfect". This means that between two arbitrary points from the maze, there is exactly one path connecting them.
Рекомендации по теме
Комментарии
Автор

Awesome ! Could you upload your code on Github and/or explain it ? Keep it up

cynikkk
Автор

I would like to upload content about the applications I have created with Python, but I don't know how to edit. How do you go about recording your show like that?

onemoredev
welcome to shbcf.ru