Endless Procedurally Generated World

Woops

Here is the good one.

Capx

Lol ...

Savvy001, I see what you did and it's a clever solution, but not really applicable to my formula/game.

Well done though! I didn't pick it up at all when playing the demo.

Hmm... I might just end up going with a compromise: Pre-generate all the arrays to a specific big world size, and only create the blocks within player distance. Sort of like Terraria.

Ah, well thanx anyway because its was your post on the forum that got me thinking in the first place.

All the best to working out your game mechanics!

Greets.

Savvy001

Savvy001

link to .capx doesent work!

Also, finding candy is fun! :D

edit: Ok, i'm a bit late :D

thanks for sharing!

JohnnySheffield

I did 2 post reply's

On the first the .capx was not working.

On the second it did.

Now i have corrected the first one also.

So thanx for the heads up.

Nice that u liked finding the candy.

In the future im going to make a game out of this simple infinite engine.

Its super basic and opens up lots of possible outcomes.

Kind Regards

Savvy001 <img src="smileys/smiley17.gif" border="0" align="middle" />

sqiddster

A large array shouldn't be too much of a problem as most computers have a lot of memory.

I tried out seeded random using the RandomPlus Plugin and here is the result:

http://dl.dropbox.com/u/5426011/examples16/inf_map.capx

If you're doing a scroller that goes in only on direction you could use the standard random, but store the values until they are no longer needed for interpolating.

—

That's amazing! But what is your generation algorithm? Is it a different version than mine, or just condensed?

EDIT: I see that it's bilinear, but how did you do it with zero arrays? And as I can't use the seeded random, how would I adapt the regular random?

With seeded random I can calculate the same value every time for a square so I don't have to store the random values in an array.

For regular random you would need an array to store the random values to interpolate between. I've yet to work out how it would be implemented exactly.

Hmm. Let me know if you get it figured out!

The solution I had in mind was proving to be too complicated, but here is another solution that doesn't use any third party plugins.

http://dl.dropbox.com/u/5426011/examples16/inf_map3.capx

The idea is save a bunch of random numbers in a big array at the start of the layout. Then using an formula like Array.At((x*23+y*5)%Array.Width) you can get a random number for any position on the layout. The 23 and 5 are arbitrary and can be any value.

The main drawback is this method does create a pattern that is noticeable when the array is small.

R0J0hound, thanks!

I'm trying with a width of 100,000 and there doesn't seem to be any performance problems. Is this array too large?

An array with a width of 100.000 uses 0.762939 MB memory. <img src="smileys/smiley1.gif" border="0" align="middle" />

Astrosus, Thanks, that's interesting. I had no idea how much memory each cell uses in C2 as there are no variable types. Does anyone know how this works? Is C2 'intelligent' in this aspect depending on the data the array is asked to store?