[hill generation, perlin, diamond square] … this kind of algorithms seems suitable when dealing with tile maps that also have a height component but this is not my case. But it is your case. Mountains are higher than plains, and plains are higher than water. ___/ ___/ ___ Mountain cutoff ___/ ______/ ____/ ___ Water … Read more
The thing that stands out initially is that your code is highly polymorphic. You should specialize your floating point type uniformly to Double, so GHC (and LLVM) have a chance of applying more aggressive optimizations. Note, for those trying to reproduce, this code imports: import qualified Data.Vector as V import Data.Bits import Data.Time.Clock import System.Random … Read more
If you’re feeling brave, you could do worse than look at how Ian Bell did it for the original version of Elite
The hypothesis suggested by @mbrig and @Leon that the propagation step iterates over a whole stack of cells (instead of being limited to a set of 4 direct neighbors) was correct. The following is an attempt to provide further details while answering my own questions. The problem occured at step 7, while propagating. The original … Read more
You should probably start with a little theory and simple examples such as the midpoint displacement algorithm. You should also learn a little about Perlin Noise if you are interested in generating graphics. I used this to get me started with my final year project on procedural generation. Fractals are closely related to procedural generation. … Read more