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)

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

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

Wait a second this isn’t code bullet

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.

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.

2:54 "jiggabyte" 💀💀

"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

4:27 BOGO SORT OF MAZE SOLVING LET'S GOOOOOOOOOOOO

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

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

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

"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.

why don't use just run... bfs... it will always find the best solution... and dijkstra is useless because its only useful when edges have weihgts. if the weights are all 1, bfs gets the job done

8:40 you can generate a world map by this

underrated channel

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

“One fricking jigabyte!” - Green Code

"just go right bro" also the maze i have to go though hugging the wall:

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

If you're in an image-editing program, the flood-fill (paint bucket) tool will highlight the solution.

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

roblox click to move

You were printing every step while running the algos? That probably significantly slowed the algos down right?

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

Very cool! 🔥 keep up the consisting uploads

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

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

it would cool to calculate how much time a human would take to finish this maze, considering that they would always go for the right and need to stop to eat and sleep

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.

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!

I wonder if the maze creation algorithm has some kind of creation bias that allows the wall follower algorithm to perform more efficiently than the other algorithms

I hadn't come across anyone creating content like yours before, so I started following you a year ago, and I absolutely love your entertaining content. However, if you stop posting videos for a long time (again), I'll be come to your house and kick your ass. 😅

Dijkstra in computer class was such a pain

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

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

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.

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

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

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

"THE FINAL RACE"😂

WallFollower L and R always move one tile. A* cheats by teleporting anywhere in the whole maze

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.

dont add print statements if you want code to run fast learnt that the hard way when making a 3d renderer

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

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

2:56 Giggabyyyyte!

Right hand and Left hand is my favorite because it looks like a country border, and i like maps oh yea and also that's (i think one of but i forgot) the first tips i got to solve a maze (i didnt use it tho)

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

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

im currently studying maze generation, and im seeking for algorithms that are really flexible and that can be added troug a lot of different render variations, shapes, or wall width and height, and i wonder what is the best architecture, i thought about doing it with one class that represent the cell, and one that represent the wall, each cells are in an array and reference their walls, the walls would just serve as "link" between two cells and say if they are pathable or not, is this the structure you made ? or did i miss something here ?

What if Because the wall followers were pretty quick, but non optimized. What if you ran a code that only looked at where both wall followers went on the same path, which only should be the optimized path unless there are multiple ways to the end...

a whole jiggabite 🥶🥶🥶

Hey! Just a question, Do you use hackintosh? (Please answer honestly)

Such a banger of a first view! 10/10

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

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

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

You should try implementing bidirectional versions of theses algorithms

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

I invented my own solver, it starts at the end qnd it creates arrow tiles which point at where u need to go

I thought A* is going to dominate

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

How long did it take to generate that maze, python is not a fast language.

2:56 Jigabyte

8:34 MAKE MODERN ART WITH THIS??

4:13 Ngl it looks like a lightning bolt

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

POV: Your dad's screensaver

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

The new animations are so cool man

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 °-°

A noob question but what framwork do you use to visualize these mazes and solving of them...... like for example in cpp we can use SFML for that purpose....??

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

Why do he remind me of code bullet

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

underrated ahh youtuber i love code youtubers

best ml channel on youtube by far!!!!

Just go around the maze!

2:58 bro really said jiga byte

3:40 he became lightning

A-maze-ing!

You are the best. Thanks !!!!

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

I was cheering for algs that i know myself, they weren't so effective ngl😕. Why only 15k subs?! I thought at least 250k, content quality is so high!

4:08 that corner shape is questionable

2:59 Jiggabyte 💀

1:20 well i do even if i've heard it before

Right hand and Left handis my favorite

Is and operation of right wall and left wall algorithm makes path and makes best path?

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

u really remind me of code bullet

nah ignore the mase and walk to end without doing mase

0:12 he meant dumb as in not the mainframe

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

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