{"type":"video","version":"1.0","html":"<iframe src=\"https://www.loom.com/embed/d72f98979c0d4a868951770f32560b32\" frameborder=\"0\" width=\"1112\" height=\"834\" webkitallowfullscreen mozallowfullscreen allowfullscreen></iframe>","height":834,"width":1112,"provider_name":"Loom","provider_url":"https://www.loom.com","thumbnail_height":834,"thumbnail_width":1112,"thumbnail_url":"https://cdn.loom.com/sessions/thumbnails/d72f98979c0d4a868951770f32560b32-037a4d18a37e629b.gif","duration":85.611,"title":"DFS Maze Generation and Backtracking Solver","description":"This Loom explains how the maze was generated and solved using 2D Ares with North Wall and East Wall tracking. It describes a stack-based depth-first search to create the maze, visualized dynamically, and includes a bonus challenge by eating an extra random wall after generation to introduce a cycle. The solver uses a backtracking algorithm where red dots show the current exploration path through dead ends and blue dots indicate the stack used to backtrack. This process continues until the exit is found, which it is."}