Programming Mazes 

This video is a mazing.

Now the man makes an algorithm to solve your maze in under 1 minute. The everlasting competition of coders.

just discovered your channel today... Don't normally write in comments sections... but.. really enjoying your videos. please continue the good work.

I found a new use for this algorithm! It's really good at generating oceans/continents. Visited cells are water cells, unvisited are land cells. If the algorithm stops after visiting about 60% of the cells you can get smaller and larger islands, continents, even some rivers! Really cool stuff 👍

I dont believe you did that in two minutes.

I absolutely love your coding style! So clean and understandable, without unnecessary complications. I'll try to learn from you, thank you for all your content!

This is the greatest RU-vid channel that I have had the pleasure to stumble upon.

I just discovered your channel, and I must say that you're doing a great job at explaining. I especially love how you always take a simple, effective approach (I especially appreciated the method you used for rotation in Tetris). Keep it up! ^^

Excellent explanation! I like how you went over the algorithm first before dropping into code. I’ve always marveled how the best algorithms are often the most clean and simple.

One of my more favorite videos I have seen. Subscribed a while ago, just a really enjoyable view, everyone of these !

Hey, just want to say thanks! I've learned so much from your videos, and continue to learn more.

This is a amazing video, it has been a while since I was looking for. Thank you for your great work.

great video, just going through you're stuff at random - it's a treasure trove! You have a great sense of humour, and manage to choose the most interesting topics :)

I'm really enjoying your videos, took me a long time to discover this channel, hope you keep making this.

Never ceases to impress me how you can take a advanced concept and break it down to very simple terminology. In just the first five minutes you've broken the method by which the algorithm operates down enough for me to understand how to implement it programmaticly.

This channel deserves more subscribers

using the stack to pop back the path, whilst keeping tracking of total visited cells is a very nice elegant algorithm. thanks for this! 🙏🏻

thanks to this video I learned bitwise operations and better understood hex numbers, thank you!) First two days I only understood the general operation of the code while struggling to figure out what |= and & means in the particular case but on the third day I finally figured out everything Had to spend some time with pen and notebook studying code symbol by symbol. I am very grateful for your videos and the fealing of satisfaction after understanding everything!

This video was so helpful and inspiring. I came here for a maze for my genetic algorithm but also got inspiration for a mining tunnel game. Everytime I think of mazes I will think of this video for the rest of my life

I read an article a while back where someone created a similar maze using only template meta programming, which was randomised each time it was re-compiled. Pretty mind blowing really.

As always, i cant believe this video has "only" 300 views. Keep up the awesome work!

This video is incredible. Thank you.

Good ol' mazes, happy to see ur channel grow :)

Thank you for making such good videos and motivating others to make their own! Keep on :)

I found this channel while I was looking for how a game coder works - not a video with visual impressive graphical presentation, but the "ugly" unspectacular hard part of coding thousends of lines and how it is possible to keep an overview. Then stuck to your channel because the quality of your videos especially the content (programs and explanations) is excellent and I learned much here (for example the use of the modulo operator and many other "tricks") I like how you concentrate on what matters - the ideas and algorithms and how smart you code. Today I finished my own (primitive) maze program with the 15 unicode chars 0x2554, 0x2557 and so on, without using one of your game engines but with parts of your code and ideas. It creates the maze in one tick so it is not as good for visualisation as yours but it shows me that I really understood your code. To repeat all calculations in every single frame (OnUserUpdate function) is very time consuming and only possible in that ultrafast C/C++ language (or maybe assembler if one is capable of coding in this). Greetings from Germany and I wish you many good ideas for more programs to show.

Great video. I wrote a sudoku solver using a backtracking algorithm as well, but instead of using a stack object, I relied on the function stack frames by using a recursive backtracking approach. I like that the solving function looks simpler when using recursion :D

Absolutely beautiful.

A couple of years ago, this video of yours inspired me to writing my first Python/Tkinter application: my idea of coding something useful for practice and keeping my grandchildren quietly entertained. Little did I know that after all this time, a discussion in redditt's r/learnpython thread led me to tell the world about it. The response was amazing, and I have felt compelled to use Github for the first time to make available my first clumsy effort. The code starts with a couple of sentences where I told this story and show my indebtedness to your original presentation; coupled with a proviso that you are not responsible for the 'quality' of the coding. Thank you so much.

Really enjoying these videos. Time to dust of my programming head and have a play.

you are the best!!! Thank you for realeasing such great content

It's a real appreciate video!!! Excellent explanation !!!

This is the greatest channel i have ever seen on youtube! All of your contents are amazing. Can you show us how to make fluid simulation in c++?

This was a very friendly and helpful video, thank you very much ^^

First video I've seen of yours, sub earned!

This is the absolute best channel on the internet

this was our final project for "introduction to computer science 2" in college; we used both a dfs/stack and bfs/queue (and we had to make the stack and queue). we also had to find the shortest path from the entrance to the exit. ours used ncurses in a gnu/linux terminal! if you have been programming for a couple months, i'd strongly recommend trying that out, it taught me a ton about a programming.

you should have more views, I feel lucky to find this channel

Excellent video, loved it!

ah, such fun! I coded something very similar when I was a little kid, and I still like to watch you make algorithms like this. more, we want more! ;-) subscribed.

wow, this video helped me out so much, thank you!

"Two minutes to create a maze that would take one minutes to solve" ? That's a line from Inception !

Thanks! What a precious video!

The way you‘re using bitwise operations has somewhat opened my eyes. I knew about bitwise operations and I also knew about using sums of powers of 2 to store information (e.g. in chmod commands), but I never thought about using it to essentially store several booleans in a single value. Thank you for this video!

Thank you for this wonderful video.

1:57 into this video and im already convinced that this is awesome.

loving these videos

Thanks for the tips :D Great work!

aMAZEing.. I did a similar thing for solving an arbitrary maze.. this inspired me to go look at that again and make it make a maze

This vid was so cool and helpful. Cheers!!

Damm why this channel has so little subs and views. Good work man!

Very useful video implementing this into my game

This guy is the greates teacher I have ever met.

You are a Wizard of C++.

I like your setup. It looks like the Matrix.

What a fun algorithm! Really simple to implement, and it also provides the solution route for the maze, if the goal position is known upfront. I couldn’t find a clever way of multithreading it yet, though.

Your videos are amazing !

Good explained!

Damn ! You explain things really well..

Great video! Thank you!

Your videos are very well made. Keep it up! :-)

I learned this from the same magazine! In italy it was distributed by De Agostini with the name "Input"

Really good explanation. I recently converted the example code on the Wikipedia page from c to C++ to use in my game. I could follow the code alright, but this was a nice explanation of the stack and how that can make it a bit easier to follow. Stack is still there in mine, just implemented differently.

Amazing and well detailed video ! since I found your channel, I start every morning with one of your videos ! Keep up the great work !

that algorithm is pretty ingenious

Thanks. Really good information. I don't understand some of the newer C++ syntax, but that's ok. I understand the algorithm, thanks to your video. I decided to make this algorithm work on the old color computer from Radio Shack in basic with 64k. But only 32k is available. I wanted to make a maze of grid size 127x95 in a resolution of 256x192. I needed a array of 12065 bytes to hold the grid. Then another 24k for the stack. That is roughly 36K. Way over the amount I have to work with. I came up with a different way to save space .So instead of using a stack to hold x and y locations of cell, I decided to use 2 bits in the cell array data to hold a number between 0-3. Those numbers would represent the direction that the cell came from. Now, each byte in cell array has 4 bits for the walls, 1 bit for visited or not.1 bit for backtrack or not and 2 bits for direction cell came from. Some crazy reason, it worked. :) Anyway, I thought I would share my algorithm modification info in case anyone else ran into memory constraints on old retro computers. I was able to cut memory usage from 36K to 12K.

Thank you for your fascinating video, it inspired me. 👍😃

you are fantastic!

Great video

"rarely the programs did actually work" - can confirm this. Good times!

Beautiful

So good and calm explanation! I personally think, that it would be awesome that you break down those long lines of code into separate functions and teach people how not to make a blob! :D But overall, its great man

excellent video!

Very nice!

Clicking on random videos cool to see this one in my recomended the first one you used OLC on

My first maze was done on a RadioShack model 1. I used a string variable as the stack. Back in 1980

I really like the way you explain things. Always clean and simple (from a programmer perspective, should I say). Have you ever consider teaching ? Good work, by the way.

I once made a 4D maze. At every location of the maze, you could go up, down, left, right, backward, or forward, but you could also warp to an alternate maze and continue from there. Very easy to design with this algorithm, but very confusing to solve, especially since the display was only 2D.

Just something small I noticed. You don't need to keep a count of the number of cells visited. If you reach the bottom of the stack and there are no neighbors, then you know the maze is done. Upon further reflection, I think reaching the bottom of the stack will always leave you with no neighbors. Say everywhere in the maze is filled in, except one cell directly neighboring the start cell. As the stack pops, it will encounter a different neighbor of that cell before returning to the start cell, and this different neighbor will generate the path instead. Similarly for any larger empty region, we must fill it in before we can pop the stack to the bottom.

Amazing, love it, Thanks a lot. BTW a Unity version for this will ne great.

W guy, W video. LETS GOOOOOOOOOO

2 mins to create a maze that would take him longer than 1 minute to solve. I see your a Christopher Nolan fan. :) Great video and content. I love how you explain these algorithms. I hope you plan on doing more algorithms.

Excellent video :-)

Saw 8bits of C++ first, ehh, then this one, subbed... might be a good idea to close any unused toolbox and explorer windows, to get more code on screen, as well as roll back the zoom a bit, and hide the main menu... great video, thanks!

This is really awesome. Have you looked a the dungeon room generation algorithm in Diablo? I think a video on this would be popular and fun too.

I remember this algorithm from Sinclair User, and you are correct, it didn't work after 3 pages of typing in the code LOL

Interesting adaptation of depth first search, would think to use it here.

this video was a maze-ing

Super interesting

*Stacks of tiles are fun* because they make generating mazes look like solving mazes, but otherwise I don't see the point of *wasting computation time and energy* using them for maze generation. 1. You could link new tiles to the existing graph in *any fucking (or even non-fucking) arbitrary order,* including random and discontinuous, as long as you *mark each tile's branch* well, which can be done in a single step each time a tile is added. 2. Even if you want to go through the graph in a particular order for whatever reason of controlling the maze's properties (e.g. limiting the length of straight corridors, or the number of consecutive turns on the same side, or the distance between two branches, etc.), backtracking is *extremely quicker from one **_branching_** node to the next, than from any one tile to the next.* Feel free to prove me wrong, or to call me to work together on *amazing* 2D, 3D, nD maze generators and solvers.

I can't tell if you're faking going outside or being a programmer... Whichever it is, you are a good, my friend.

Amazing channel!

This was entertaining

all your stuff is very good and enjoyable to follow ^^. it would be very helpful for this vid if when you use your console drawing lib that you put a link-mark to a short vid of how to structure this draw from std::cout ^^ for those who are just trying to get the alg in ^^ (took me longer than i want to admit to restructure for cout output approach, but didn't want to do draws etc. and wanted it to be something where i could just create a 1d-array for usage and send to another module which then figures out what graphic is needed where etc ^^)

I learned about random number generators from a maze generating game on a DOS computer when I was 5

you are awesome xD

Very cool :-) If I remember correctly I think that you can actually use a queue instead of a stack. Using a queue generates a maze using breath-first traversal, whereas the stack uses depth-first traversal. I would you have liked to see how different the maze looks with a queue instead of a stack :-)

Just realized I have the same exact keyboard!

That console window reminds me of the old maze game xd

this channel will have 70k subscribers by the end of 2018

You are a living GENUIS Pls do Bsp Trees Tutorial