วีดีโอ

FACT: Perlin noise has been canceled. Use diffusion

:)

Thank you very much for this playlist. I have a lot of fun following this course :)

Great video (:

One thing I noticed, that might be difficult to achieve, is probably deterministic maps. e.g. like in minecraft you can set a seed for the randomizer, and will get the same map for the same seed everytime. With WFC, this will probably work fine if you generate the entire map right from the beginning and just set random.seed(...) at the beginning.. but if you want to dynamically grow the map (again like in minecraft where the world grows in the players walking direction), then you'll likely run into the issue that tiles might result in different outcomes, depending on from what direction you approach them. Addition: So WFC would no longer choose the tile with the lowest entropy *globally*, but limited to the players proximity. In a sense a nice feature, because it adds a source of randomness (player movement), practically guaranteeing that no map is like the other, but it also loses this nice feature of the ability to share a seed. But all the other features you can play around with, that have already been mentioned in the comments, are certainly worth to try it out.

Love it Sir

You could define your for loops more clearly, for i or for j doesn't make sense in reading the code. Still a great video nonetheless

Hi i got two improvements but they are optional. Lets say u have a sprite for the tileMap which is bigger in size than the tileSize than the unit cant´go between lets say a coast north tile which has grass in the north an a forest north tile which has gras in the south cause its too big. So i figured that out with some lines of cde that between every partial grass tile and another partial grass tile always one grass tile is place so theres always enough space for bigger sized sprites to pass between those two partial sprites. And the other thing is, its just a tiny thing, when the connectors in the constrain method are added there dont need to be duplicates in the connectors cause the resulting connectors list only is a comparison list where a value like "0" only needs to be in once.

please make a real tutorial for like navigating in pycharm what is that config thing evrething i know a lil of python coding but i do not know how to order files and all that so if u could make it. In present of this coment i am still trying to find a tutorial.

Thank you for the nice tutorial. I'm currently trying to understand and apply object-oriented programming. When I saw your video I just thought: "Oh damn, this guy is really, really fast...way too fast for me :) After 10 times I was able to implement it. Best regards, Daniel

good

Amazing content as usual

Awesome video my guy

Awesome video my guy

I like your explanation thank you.

holy crap I am glad I am not the only one doing y, x

woah

One really interesting algorithm I saw recently on TH-cam was used for a Minecraft randomly changing maze, but it wasn't generating a NEW maze from scratch, but instead had the ability to convert any EXISTING perfect maze into another one, only by needing to change the properties of two adjacent cells. It worked by representing the maze ad a tree structure with a root node, and having all other nodes have exactly one path to navigate back up the tree towards it. This means there are no loops, and no isolated areas. Starting with a maze of this format, you look at the root node and choose one of its adjacent cells (not diagonals). You go to that cell, and if the tree node representing it has any other nodes pointing TO it, you wall off that connection. Then, you make the OLD root node point to it, and now this node is the new root node. Every time you run this algorithm, one perfect maze becomes a new entirely valid perfect maze, and you get to choose how many times you run it. It could be as fast as O(1) if you choose to only run the algorithm a fixed number of times, but if the maze is significantly bigger than the number of times you run it, your maze might look extremely similar to previous versions, so I believe the creator recommended running it about 10 times for every cell in the maze if I recall? Maybe less than that, but ultimately it's up to the user.

Do you know how to create custom libraries?

Best

Just because a game has a generated world that doesnt make your game more unique or interesting I mean how much does it make a difference if the tile is a grass texture tile or a tree I think indie game developers are still struggling with what makes a game interesting

Nice video. It is really helpful. Is there any option to use Visual Studio to create a dll file with MASM64 ? I am using VS 2022.

At 09:50, sorry, but I don't quite get why we add extra +1 to size_x, size_y. What we have seen before? At what minute I should have seen it.

THANKS A LOT I WILL USE IT IN MY CS PROJECT

I once used wave function collapse for a procedural melody maker about 15 years ago. I didn't even know the algorithm existed. I just set up a system that decides what notes can come next, based on the current note. For example, if it's the 4th note in the scale, it has a higher probability to go to the 1, 5, or 8th note, and a lower probability to go to 2, 3, and 6. And so it just kept plinking along through the endless melodies. Great things happen when you're bored and curious.

Just started watching and I'm already inspired. Putting a limit on how many times a tile can be used would mean only a certain percentage of the map will ever be that tule, and only if the condition to place that tile is correct. So if I want a small building I would only make 4 corner tiles, top tile, bottom tile, left tile, right tile, center tile. It only makes sense for them to connect to each other. And then I'm thinking the algorithm would look beyond just what's next to each square, otherwise i might start a building that cant be finished

Fascinating! Ik ga dit zeker eens proberen gebruiken. Een ander interessant algoritme is met Perlin noise, maar dit lijkt simpeler.

I quite like the hunt and kill algorithm, but it doesn't seem to generate any crossroads. I noticed this with the depth first algorithm too. Both 'carve' corridors so wonder if this method means it never generates a crossroads (that is a cell with 0 walls).

Somehow, looks like an improved version of the Minesweeper game :)

No idea why MSVC doesn't support inline asm64 :/

5:48 wouldn't this be 3d not 2d? X, Y and brightnes?? GREAT video btw thank you 🙏

You did not go through any back tracking. If it cannot find a solution it needs to undo some amount of assumptions

I really like this video and will use the algorithm in godot.

So if you have n tiles and m possible values, that would be m^n possible combinations, but we want to find one that satisfies the rules. I have heard of that. CSP?

can this be used for biomes cus it doesnt seem like it would?

yall make this sound too simple, took me 4 months to make my own implementation. nonetheless, all videos i watched were great, but this one stands out to me because its about wfc and wfc only. 👍

Thanks so much for this video! Greetings from germany :D

Thank you very much

Continue with these great explanation videos!

Is there any way I could contact you directly ?

Is it in python ?

Thank you very much! We need more content in this series!

Great work! We need more of this win32 asm lessons!

Thank you for uploading this video! Now I finally understand how wave function collapse works both in theory and code and managed to port it into my own project.

best explaination so far

Classs!

This is something I would find very interesting to implement using F#. I am developing a simulation program in .NET for a research that I'm conducting, and generating terrains with diverse and realistic environment factors is one of the main problems I have to tackle. This video gave me great insight!

Not a fan of this one, because you don't explain how to actually get those windows/views for debugging the registers and step through on VS2022

Very interesting, thanks !

had to stop watching when you said "implemented in python" because i literally spent 3 months trying to learn that and i just rejected everything about it outright. can you do it again in C??? :)