I Solved The World's Hardest Maze (with Code)

Показать описание

P.S. Sorry for my upload being late :)

⭐ Other Social Media Links:

✨ Subscriber count: 11,534 subscribers 💚

I had a lot of fun making this video. Mazes are such a cool way to visualize how algorithms like A* and Dijkstra work. I hope you enjoyed it as much as I did. Let me know what you think in the comments.

Рекомендации по теме

Комментарии

i love how the wall followers just made maps of europe, i can just imagine using the path as land and non paths as water for a fantasy setting

DotboT

To test djikstra on the large maze, use uniform cost search. Same algorithm, same results, but it doesn't load the entirety of the maze in memory at the start which is why your implementation wouldn't work for the large maze. Similar concept to how A* has a limited search frontier (the set possible choices for the algorithm to explore next)

tiileaf

When you showed that your maze file was >1GB I was so enraged that I decided to reimplement the maze generator and rewrite the part that exports to a file so that it would be smaller and I managed to get it down to about 5.29MB

Roaxial

The dead-end filling algorithm is fun because it can be set up as a cellular automata. Make the walls thicker so they're the same size as the passages, then define the the maze so that passages are "living" cells and walls are "dead" cells. The automata only really needs one rule - if a living cell has fewer than 2 living neighbors, it dies. If you set it up with a loop of living cells around the outside of the maze (to keep the entrance and exit always alive), eventually all of cells that make up the dead ends will "die, " leaving you with just the solution alive.

DqwertyC

I think if you want your video to have high quality available right when it comes out, you can just upload it, but schedule it to release sometime in the future. That way youtube will have time to process higher quality.

leggyjorington

A neat thing i noticed is that the wallfollower algorithms create whats essentially a negative of each others routes. This is pretty neat!

WHKHero

I believe legt and right wall followers can be changed to give you the most optimal path, if the cells (when the algorithm backtracks) are removed from the path

alexandratsankova

Me: I want Code Bullet!
Mom: We have Code Bullet at home.
Code Bullet at home:

BrandonMakesGames_

This channel needs at least 1 million subs. Great content!

ViolentCabbage-ymko

"even thought a* completed 2nd rank and not aat all faster than RH WF, i declare that A* wins the race because it is one of my favourites"
worst scam of all time

whyshouldntiGD

2:34 As soon as he said ''What's happening'', 0.001 seconds later, I got an ad

AavyanTiwari

Your video is well produced, but 4600x4600 worth of cells can fit into about 5.4MB of memory if you only use 1 bit of information to store if a wall exists or not.

MrRaveYard