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

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

did bro call gigabyte jigabyte

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)

Wait a second this isn’t code bullet

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

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

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.

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.

2:54 "jiggabyte" 💀💀

5:19 this only works with these specifc types of mazes whete all of the walls are connected to the edges of the board

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.

8:40 you can generate a world map by this

roblox click to move

How is A* or Dijkstra not faster? Are you using a priority heap or just tossing everything into an array ?

if i was stuck in a maze twice the size of paris i would want to solve the maze as fast as possible rather than develop the fastest path then get out

"How to solve the worlds most dificult maze?" One words: Water. I can think of 3 methods. Method 1: Water presure Assuming the world of the maze only has two dimensions and no gravity (or gravity but into the thrid dimensions direction means it wouldn't really matter here), just connect a water pipe to one end and pump water through it. The only path it can take is the path (or paths) to the other end, since all other routs are dead ends and due to water presure it can't go in there. Method 2: flowing water Just connect a (large enough, or invinite for a simulation) water source to one end and let it fill the maze. The water will flow into all paths but stop at ends. So it if water comes out the other end, you can follow the path like its a river. Method 3: Water and gravity Just hang the maze on the wall, connect a (again, large enought) water source to the top and let it run through the maze. Since the only way to diplace the air in the maze is by pusing it hrough the other end it can only fully take the routes towards the other end since all other paths will get clogged by the water. I don't know how good fluid physics engines are though. Maybe all methods might work in simulations, maybe just one, maybe non at all.

Dijkstra is not specifically made for mazes, it works much better on complex graphs with weights on the edges.

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

“One fricking jigabyte!” - Green Code

the thumbnail alone made me know that this video would be good. Subscribed :D

who needs a robot when you can stick to the right side of the wall

underrated channel

Was excited to see this after seeing that clip of a maze-generation algorithm in the end of the year video!

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

1:20 bro said i dont fking care in 1942750301264920202 different langauges

Next video: I solved the worlds hardest maze in 0.00072748826254284921 seconds with code

A good way to measure efficiency in maze solvers is by the number of steps they took to find a solution. Wall followers are quick to process, but they take way more steps to find a path than A*. The dead end filling algorithm is neat, but it needs to explore so much of the map. I'm disappointed you didn't give the random mouse a chance. You should always give random algorithms a chance just in case it solves it first try; you want that shit to be on camera.

sad you didn't implement the human algorithm: - just try to follow the direction toward the exit, - if it doesn't work out, just backtrack until you have another way that seems to lead towards that direction. - Repeat until you get to the exit.

Google doesnt use that algorithm, its not computable on a global scale road network, google uses a variation of the heat method, and yes the heat method can solve this problem a lot faster

"THE FINAL RACE"😂

8:31 lmao it looks like fantasy world’s map

How do you do such animated videos? I really want to know how to build things like your character, the maze generation, and pretty much everything. I love them so much!

0:12 he meant dumb as in not the mainframe

*a mobile maze game player that reached lvl 300*: too small

3:00 There is NO WAY that is a separate OBJECT PER CELL of the maze- Python takes 24 bytes per integer (not even objects, just integers) so 192 bits, possibly even more than that (I've heard of 200+ bits), when you only need 2 bits per maze cell under optimal circumstances. You have 2 bits of useful memory for every 192 bits that you spend. No wonder you ran out of memory XD A decent way to compress this is to use Python's bytearray() so you can create and manipulate individual bytes. Then, using bitwise operations, you can store 4 cells per byte, maximizing your memory.

I don't get why this only has 13k views wtf, this is like code bullet tier, really well done

what library did you use to display the maze? also great video, really enjoyed it!

pretty interesting video, i sure hope there isn't any ai-generated imagery in it!

Such a banger of a first view! 10/10

2:56 Jigabyte

This isn't the biggest maze! considering technically you could consider the earth to be a maze with the streets and turns!

2:56 Giggabyyyyte!

If you do an and gate on the two wall follower paths, I think it would get the optimized solution.

wall followers will give most optimal solution as well if you discard backtracking paths

You should try implementing bidirectional versions of theses algorithms

8:34 MAKE MODERN ART WITH THIS??

Why do he remind me of code bullet

How did you represent the maze in memory? Adjacency matrix or list?

What module do you use to visualize or show the process and of the algo?

2:58 bro really said jiga byte

Definitely close to as much effort as code bullet, which is saying a lot.

2:59 Jiggabyte 💀

4:08 that corner shape is questionable

Just go around the maze!

8:32 am i the only one who sees europe mirrored? +top of africa

4:13 It looks like lightning

bro make your own algorithm which work like water and water is most good maze solver in world

2:55 i can python and understand your traceback... dont fool around XD just say you did ctrl+c ^^ "KEYboardInterrupt" on a 100 seconds time out °-°

Right hand and Left handis my favorite

best ml channel on youtube by far!!!!

nah ignore the mase and walk to end without doing mase

if you combined the L-hand and R-hand algorithms, would they fill every cell of the maze?

underrated ahh youtuber i love code youtubers

He said "Jigabyte" This is not acceptable /j

The mase is easy to solve if its a scuare Just follow a wall and bye bye It must be a circle

You are Code Bullet but worse, but youre not that bad

Bro should do a dub of, I AM PROTO

Oh but that maze is not as big as the maze im building in minecraft

You are the best. Thanks !!!!

The new animations are so cool man

hey no favraite child man no fair!!! i am just messing with ya

Use double sided A*

I'd love to try running these on my computer. Any chance you'll post your code?

wall follower made denmark lol

This watches like a Mr. Beast video

Codebullets long lost twin😱

2:46 its just green

What a nerve killing babble...

I have an idea of better solution solver.

Thumbnail is wrong. I checked and the insides of the red circle shows different part of the maze completely.

dollar store code bullet. still love the content tho

bro tryna be codebullet fr

You drew thunder 4:17

As a small correction, A* doesn't always give the most optimal solution although it does yield something close (most of the time)

If you keep pronouncing gigabyte like that you will never get a jirlfriend.

Feet don't exist in Paris. Feet shouldn't even exist. YOU SHOULDN'T EX- use feet. Use meters. Please.

A-maze-ing!

why did you not try dfs and bfs

I really like your character

i use arch btw

There's a few things you can do differently to optimize this whole thing. I'll start with the obvious, don't use Python xd but now a little more seriously, printing to the terminal slows you down a lot. Also i have the feeling that you didn't implement A* or Dijkstra correctly, especially if you're using the default python list and not a binary heap. And finally 1GB for storing the maze? How? You only need to store 1s and 0s (1 as wall, 0 as not wall). If you did it this way 1GiB would have had a little over 8.5 billion cells

Where can I get this?

Buy 196 Gb of ram and Ryzen Epic, and retry

You’re going to make it big, I’ll claim my ticket 30.9k~.

Bro was not code bullet 🙏🙏🙏🙏

how much ram did your computer have?

CB?

i am going to sub to the channel

code bullets lost brother

you are not using dijsktra .the dijkstra is tells the shortest path in weighted graph. This maze is nőt weighted so it does not make any sense to solve this with dijkstra and dijkstra is good fór finding the best way but in this maze you have only way so it still dont really make sense.