Felipe Saravia

Пікірлер

@rs9130 3 ай бұрын

How about reinforcement learning

@kevnar 4 ай бұрын

Any algorithm with excessive amounts of hallways a single cell long should not count as a maze. When you can clearly see it's a dead end, it's no longer a puzzle to solve. It's just a bunch of space filler. You might as well just seal those passages off and have a single path through the whole thing. You know you're a nerd when you start gatekeeping what counts as a valid maze algorithm.

@jasontoddchampion 4 ай бұрын

Thank you for this video. It is incredibly useful, and seeing the visualization alongside the description is helpful. If there was a "useful information density" award, you deserve it.

@white_145 5 ай бұрын

1:46 isnt it wave function collapse?

@DropShotPat 5 ай бұрын

how do i git at that repo...

@phat_gunther 9 ай бұрын

Is there a specific algorithm that forms a maze from a selected finnish & end ? (Within a boundry)???

@todo1553 8 ай бұрын

i think the best way would be to generate the maze then carve a path

@phat_gunther 8 ай бұрын

@@todo1553 cheers

@collettearthur1833 9 ай бұрын

Hello, I would like to use your code for an academic project. Can I use it if I site you and youre repository?

@readysetpython 9 ай бұрын

Hi, yeah sure

@RACHOTINANDINIRACHOTINANDINI 10 ай бұрын

where is the github link?

@Tricob1974 11 ай бұрын

My algorithm ("Maze Creator") is closest to the Depth First Search. It stores a number in each cell visited, giving it a 1, 2, 3, or 4 depending on what direction it moves to from there (North, East, South, and West). If a dead end is reached, any square it backtracks from is marked with a "5". These are all "guide numbers". Each cell contains one 8-bit number, and the guide number is stored in the fourth, fifth, and sixth bit of the cell's contents. The seventh and eighth bits contain "path data", where the seventh bit tells if the south path is open, while the eighth bit tells if the east path is open (To see if the west path is open, you have to check the data from the cell to west, while the cell to the north will tell you if the north path is open).

@trombonemunroe Жыл бұрын

This video was so good I immediately subscribed! But where's Wilson's algorithm? It generates an unbiased sample from the uniform distribution over all mazes, using loop-erased random walks, not favouring either long corridors (like DFS) nor many short dead ends (like Kruskal's and Prim's algorithms). It should be included here.

@cakerzpit518 Жыл бұрын

This was very helpful

@black-kv5ly Жыл бұрын

This video is what I want to see. very good!!!💯💯💯

@halihammer Жыл бұрын

Nice work!

@komodo1132 2 жыл бұрын

How did you track how far they have come?

@readysetpython 2 жыл бұрын

Hey, I didn't. Best cars are selected by hand.

@onemoredev4971 2 жыл бұрын

I would like to upload content about the applications I have created with Python, but I don't know how to edit. How do you go about recording your show like that?

@readysetpython 2 жыл бұрын

Hey, this self generated labyrinth was made with pygame. Pygame is a python module used to create game-like applications. It also has an in-built method that allows your to take screenshots of the current application screen. So what you are seeing are actually 30 screenshots per second taken by a pygame module method. You can then use Openshot or Wondershare to concatenate all those images and add music/subtitles/effects. Both programs are really easy to use (click and drag kind of interface) but only openshot is free. In case you need screen recording, OBS studio is the one i recommend, also free

@amazon8549 2 жыл бұрын

Wanted a tutorial.

@FPChris 2 жыл бұрын

Cool stuff

@crayder1100 2 жыл бұрын

I've been playing around with applying randomness to depth-first. During generation steps I simply give chances to do the following instead of normal depth-first'ing; jump to random unvisited cell anywhere near the path and branch from there (many more branches this way, interestingly long ones), randomly backtrack a few spaces and branch from there (again more branches but smaller ones), or randomly allow the depth-first phase then go back to the previous cell (even more branches, but this makes single and double node dead-ends more often which is fantastic for my game). Each of these three values can be adjusted and produce much better results than normal depth first. EDIT: TLDR* normal depth-first normally ends up generating a long path with very few branches to get lost in. Mine eliminates the latter.

@klauspeter2199 Жыл бұрын

I've tried that, too :D I also like to allow some paths to extend longer in a certain direction. To me it makes the paths look more like mazes in real life, where you kind of have long hallways instead of having corners every 1 - 2 cells. It's more refreshing if you walk through the maze. I used that for a minecraft maze generator if that makes more sense.

@crayder1100 Жыл бұрын

@@klauspeter2199 I made it in JS as well so you can test it out here: (link removed because KZbin keeps deleting my comment... not sure how to share it.) You can see what the fields at the top are by clicking on them. But it's Width, Height, Random Branch Chance, and Random Stasis Chance. Branch chance make branches more likely and Stasis makes the map generate around where it is currently more often. These are important for what I was explaining above. Also if you click Calculate then Path it'll show you the longest possible path.

@crayder1100 Жыл бұрын

@@klauspeter2199 (ht$tp @s : / / jsf $iddl@ e$.@net/Cr@ ay $d eh/8$07 n$w 6z $ f/ @ 31/sh o @$ w) (remove spaces, @, and $ symbols, KZbin keeps deleting my comment with the link in it)

@crayder1100 Жыл бұрын

@@klauspeter2199 Yes, all those spaces and symbols were necessary and THAT'S F**KING STUPID, @Google.

@klauspeter2199 Жыл бұрын

@@crayder1100 is it available on your github?

@tushardixit679 2 жыл бұрын

nice

@oamioxmocliox8082 3 жыл бұрын

;)

@skyman255 3 жыл бұрын

---Time Stamps for all Algorithms-- Depth first search 0:16 Randomized Prim's Algorithm 0:33 Eller's Algorithm 0:49 Hunt-and-kill Algorithm 1:06 Binary Tree Algorithm 1:23 Randomized Kruskal's Algorithm 1:39 Sidewinder Algorithm 1:56 Aldous-Broder Algorithm 2:12

@franzrojasayala1401 3 жыл бұрын

But can it generate the path to the maze of your heart?

@hhcdghjjgsdrt235 2 жыл бұрын

single dude

@the_green_snake4187 3 жыл бұрын

This is the best formatted video i've seen

@karlnikolasalcala8208 3 жыл бұрын

Possibly the best enumeration video. No small talks, and goes immediately to the point!

@dubiouscode4802 3 жыл бұрын

Thanks for making this ! I watched this several times while working on a similar self driving car video. I used a racetrack shaped pretty much like yours for my video here kzbin.info/www/bejne/nKG8g4aFmth9ftk I hope you don't mind. (I'm not actually done with the self driving yet, this is just showing off the radar and the human driving) Thanks! Dubious Insights

@madarauchiha3293 3 жыл бұрын

This is something new! be waiting for more!

@everlyjayag8521 3 жыл бұрын

very satisfying!!!!

@subrezz5389 3 жыл бұрын

Awesome 🔥🔥

@pabloyagani 3 жыл бұрын

Cool vid 😁

@ryanmota3280 3 жыл бұрын

This is super interesting i gotta stay tuned.

@TheLazyReviewer 3 жыл бұрын

This is strangely relaxing!! Excellent job

@dennismalone6735 3 жыл бұрын

nice video!

@Fr3shAl3xLp 3 жыл бұрын

nice video :)

@aymanlafaz 3 жыл бұрын

is there an algorithm that would have more than one exit and be able to go out of them

@prashanthbala7368 3 жыл бұрын

Love this

@ezhabebe2904 3 жыл бұрын

This was so satisfying to watch man, keep up the good work!

@daybydaysounds4386 3 жыл бұрын

So interesting! 🧠

@LIFTTOEAT 3 жыл бұрын

This is so memorizing! 👀

@ImXyper 2 жыл бұрын

I think you mean mesmerising

@magnaviator 3 жыл бұрын

so cool, thanks!

@lelsonmclel1207 3 жыл бұрын

nice

@lehase8474 3 жыл бұрын

Nice visual explanation of the algorithms

@jonaslundqvist1724 3 жыл бұрын

Where have I seen this before... Ah. Yes. kzbin.info/www/bejne/rX2apYaditWsbtk

@readysetpython 3 жыл бұрын

Awesome video!

@Lucastales7 3 жыл бұрын

Nice video, i am from reddit

@mariangeladilorenzo7394 4 жыл бұрын

WOW that's wonderful !!! I would try this: - calculate the car which is leading the game (leader) - calculate when another car is overtook by the leader and delete it until only 10 cars will remain running - mix their NN genes (among random couples of these 10) up to replace 50 cars for next round - start a new round when "b" or "n" is pressed or automatically Can anybody help me with Python? Thanks