I miss my rage

some more examples of what i do:

quick drawing i made today

i had to redo it from scratch but here it is, a working dijkstra algorithm that creates the shortest path between two points on a height map, all this while trying to keep itself at same height (map height goes from black to white, dark to bright color).

dijkstra is an algorithm with the purpose to find the smallest path between two points and it works by dividing the map on analysed and not analysed groups of tiles, with the analysed group initially consisting of only 1 tile - the origin tile - and across many rounds the group expands until it reaches the final destination. each analysed tile possesses a distance to the origin tile and each round the algorithm picks the tile that both has the smallest distance and still has unchecked neighboors. it then analyses those neighboors, adding them to the group

because my map was so large i perform the algorithm twice

in the first wave (red and yellow) the map is divided in 8x8 chunks and the algorithm is applied to these chunks, with red tiles being analysed tiles and the yellow tiles being the chunk path found

int the second wave (green and blue) the algorithm only searches inside the yellow tiles, with green tiles being analysed tiles and blue tiles being the path found

its important to notice that this two wave approach doesnt result in the best path once we consider that the first wave treats each chunk as the average of all 64 tiles that exist within it so some nuance is lost and there is no garantee that the best path is inside the best chunk path

this becomes a trade off between precision and speed as the dijkstra algorithm tends to wander around the map, as we can see with the amount and displacement of red chunks. if i were to only perform the second wave, without the chunk path's restriction, each red chunk would be 64 rounds wasted

everyday my hatred of the computer grows larger

have been working on a dijkstra algorithm that connects two dots on a height map while trying to stay on the same color.

red are areas searched by the algorithm while yellow is the path already found

because the map was so large i had to divide it into chunks that were searched first. next step is to code finding the path inside the yellow chunks

Rate my setup

the work continues :3

city generation + names

sorry for dropping so much crap all at once i dont know how to update people on this 👍

old humidity generation tests (massive failures) + the acceptable success

i also made this cute custom mesh generator. only the mesh generation lol. theres still a lot to do before i can get to the custom part