Видео

Now I see it, haha. But if you're interested in modeling more realistic lightning, I suggest Patterns in Nature.

Bot jk. Do you have any names for this plugin?

Yes, anything related to infinity is computationally impossible. Or is it 🤔

Haha, you're not wrong. This project was more about how we can bring something as fictional as the Library of Babel to reality using the powers of programming. As others mentioned there's a certain magic to it when you look past just the algorithm. I never claimed anything about creating a new compression algorithm either, I think the ones we have are already quite optimized. If anything the principles here can be used in seeded procedural generation for games like No Man's Sky, Minecraft, etc.

@huseyinustem6667 Hi, currently the system only supports a 6 sided die. I've gotten requests for adding more dice, so in the future I might do so. Thanks!

Hi, yes this footage uses 315x315 (I rounded to 100k for the algorithm 😅). It looks like 1000x1000 since the tile size is 500 so it covers a vast area.

Yes, but more optimizations needed. When I added terrain costs, the algorithm constantly crashes 😆

Hi, thanks! How would a sparse grid be implemented in practice? Will the precalculation take place between Points of Interest specified by the dev? Is this like hierarchies? Where the grid is split into subgrids and dynamic paths are only calculated for its children. Thanks!

@@turingcode Yea that's pretty much it. The dev wouldn't have to manually specify anything though. If you have a 100x100 base grid, you can add a second 10x10 sparse grid (where each sparse cell represents the 10x10 smaller cells in the base grid). Each sparse node could be in the center of the 10x10 base cells, or in one of the corners, or wherever really. Then at world creation time, calculate paths from each sparse node to their neighboring 8 sparse nodes. So each sparse node will be storing up to 8 paths (except for corner and edge nodes). Then, when you need to calculate a dynamic path, check if its longer than 10-20 cells or so, and if it is then do 2 A* searches from your start and points to their nearest sparse nodes, then do a 3rd A* between those sparse nodes, then take all the stored paths from the involved sparse nodes and combine them all together to get your final path. Something along those lines. It is sort of like a hierarchy but its only used for long distance pathfinding. You could add as many levels to the hierarchy as you want, or manually specify where they go, or even generate them as smaller paths are calculated. That depends on your needs though. Hope that helps!

@@turingcode Yea that's pretty much it. The dev wouldn't have to manually specify anything though. If you have a 100x100 base grid, you can add a second 10x10 grid (where each cell represents the 10x10 smaller cells in the base grid). Each sparse node could be in the center of the 10x10 base cells, or in one of the corners, or wherever really. Then at world creation time, calculate paths from each sparse node to their neighboring 8 sparse nodes. So each sparse node will be storing up to 8 paths (except for corner and edge nodes). Then, when you need to calculate a dynamic path, check if its longer than 10-20 cells or so, and if it is then do 2 A* searches from your start and points to their nearest sparse nodes, then do a 3rd A* between those sparse nodes, then take all the stored paths from the involved sparse nodes and combine them all together to get your final path. Something along those lines. It is sort of like a hierarchy but its only used for long distance pathfinding. You could add as many levels to the hierarchy as you want, or manually specify where they go, or even generate them as smaller paths are calculated. That depends on your needs though. Hope that helps!

@@turingcode Yea that's pretty much it. The dev wouldn't have to manually specify anything though. If you have a 100x100 base grid, you can add a second 5x5 grid (where each cell represents the 20x20 smaller cells in the base grid). Each sparse node could be in the center of the 20x20 base cells, or in one of the corners, or wherever really. Then at world creation time, calculate paths from each sparse node to their neighboring 8 sparse nodes. So each sparse node will be storing up to 8 paths (except for corner and edge nodes).

​@@turingcode Then, when you need to calculate a dynamic path, check if its longer than 20 cells or so, and if it is then do 2 A-star searches from your start and end points to their nearest sparse nodes, then do a 3rd A-star search between those sparse nodes over just the sparse grid, then take all the stored paths from the involved sparse nodes and combine them all together to get your final path. Something along those lines.

This is simply a recording bro. Just for saving I uploaded 😌

that's sad to hear.

@SaR0135 I meant my promo

Hi, I was able to reproduce the error. Try adding the path to the .lib file like this: "PublicAdditionalLibraries.Add("D:\\Software\\Python\\libs\\python312.lib");" to your build.cs file.

Thank you, hope you find it useful.

Thanks brutha!

Watching very late, what's this bro

Sorry bro , appreciate your effort…

@@SaR0135 Bruh 😂

Thank you very much!

Hi, that's a neat question. Even I didn't bother to go this far with CPython and I'm not sure how that would work either😅. But my guesses are since CPython and PyBind both use the Python interpreter, the end user will have to have Python installed. But it seems you can embed Python with your application as you ship it (a good example would be how Blender ships with a Python interpreter). As for the installing of libraries, you still have to run it through the console 'pip install' but you can do it all inside the C script: py::module sys = py::module::import("sys"); py::module subprocess = py::module::import("subprocess"); // Execute the pip install command subprocess.attr("run")("pip install numpy", py::arg("shell")=true); --> [opens a console and writes code pretty much. You could technically call an exe with the same code.] The above is from GPT, so do double-check. As I mentioned in the video, what I covered was not even scratching the surface. Embedding stuff is pretty hardcore stuff, haha.

Hi On my side unreal engine gives error that cannaot open python312.lib I have added paths in directories, build.cs and also set environment variables but error still continue to appear even when i run pybind this error appears

U asked for the video, here it is 🙃

Thanks my g!

I created my own particle system and many other experiments 20 years ago in Processing when it was just around and mostly Java based. I'm really happy redescovering p5(.js) and having some fun again. Unbelievable how much the whole ecosystem evolved and the ease of use improved. Anyway, happy coding :)

Hey, thanks! Are you working with Gemini or GPT?

Hey, thanks!