https://github.com/imvickykumar999/backtrack-maze

Backtrack DFS in Maze || Ursina Python Game || #imvickykumar999 https://youtu.be/BoFRICVqdms
https://github.com/imvickykumar999/backtrack-maze

2d backtracking dfs imvickykumar999 maze ursina

Last synced: 22 days ago
JSON representation

Backtrack DFS in Maze || Ursina Python Game || #imvickykumar999 https://youtu.be/BoFRICVqdms

• Host: GitHub
• URL: https://github.com/imvickykumar999/backtrack-maze
• Owner: imvickykumar999
• Created: 2024-07-21T12:18:51.000Z (5 months ago)
• Default Branch: main
• Last Pushed: 2024-08-05T05:13:20.000Z (5 months ago)
• Last Synced: 2024-08-05T06:27:24.789Z (5 months ago)
• Topics: 2d, backtracking, dfs, imvickykumar999, maze, ursina
• Language: HTML
• Homepage: https://imvickykumar999.github.io/BackTrack-Maze/
• Size: 46.6 MB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# `BackTrack Maze`

https://github.com/user-attachments/assets/2865060f-5c1d-4554-ab22-23093e55dc15

To create a maze with only one unique path from the initial corner to the diagonally opposite corner, you can use a maze generation algorithm like Depth-First Search (DFS) to ensure there is only one path.

### Key Changes:

1. **Maze Generation**: A DFS-based algorithm is used to create a perfect maze with a single unique path from the starting position to the ending position.

2. **Adjusted Maze Dimensions**: The maze dimensions have been slightly adjusted to ensure proper display and functionality.

3. **Drawing Function**: The `draw_maze` function now correctly visualizes the maze based on the generated grid.

This implementation ensures that the player must navigate through a unique path from the initial corner to the diagonally opposite corner.