aboutsummaryrefslogtreecommitdiff
path: root/src/main.c
blob: f291ee53ddf8d45ba97f41ddf124087a98848025 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include "typedef.h"
#include "ppm.h"
#include "tiles.h"
#include "tilemap.h"

size_t TILES;

size_t TILE_WIDTH;
size_t TILE_HEIGHT;

size_t SWIDTH  = 10;
size_t SHEIGHT = 10;

int get_least_entropy_index()
{
    // array of indexes with the least entropy
    int least_entpy[TILEMAP_CAP];
    size_t least_entpy_sz = 0;

    for(size_t i = 0; i < SHEIGHT; i++)
    {
        for (size_t j = 0; j < SWIDTH; j++)
        {
            size_t index = i * SWIDTH + j;

            if(least_entpy_sz == 0) {
                least_entpy[least_entpy_sz++] = index;
                continue;
            }

            size_t b1s = count_entropy(index);
            size_t l1s = count_entropy(least_entpy[least_entpy_sz-1]);

            if(b1s == l1s) {
                least_entpy[least_entpy_sz++] = index;
            } else if(b1s < l1s) {
                least_entpy[0] = index;
                least_entpy_sz = 1;
            }
        }
    }

    return least_entpy[rand() % least_entpy_sz];

}

void collapse_this(int i)
{
    int n = 0;

    if(count_entropy(i) == 0) {
        fprintf(stderr, "ERROR: No possible tiles for this position: %d\n", i);
        exit(EXIT_FAILURE);
    }

    // this bad
    do {
        n = rand() % TILES;
        if(!(is_set(i, n)))
            continue;

        collapse(i, n);
    } while(!(has_collapsed(i)));

    if(i / SWIDTH != 0) // up
        if(!(has_collapsed(i-SWIDTH)))
            mask(i-SWIDTH, n, 0);

    if(i % SWIDTH != (SWIDTH - 1)) // right
        if(!(has_collapsed(i+1)))
            mask(i+1, n, 1);

    if(i % SWIDTH != 0) // left
        if(!(has_collapsed(i-1)))
            mask(i-1, n, 2);

    if(i / SWIDTH != (SHEIGHT - 1)) // down
        if(!(has_collapsed(i+SWIDTH)))
            mask(i+SWIDTH, n, 3);
}

int main(void)
{
    calc_tiles();
    if(TILES > TILES_CAP) {
        printf("ERROR: Too many tiles: %ld\n", TILES);
        exit(EXIT_FAILURE);
    }

    time_t seed = 420;
    srand(seed);
    printf("The Seed is %ld\n", seed);

    generate_tile_masks(load_tile_connections());
    init_tilemap();

    while(1) {
        int lei;
        lei = get_least_entropy_index();

        if(has_collapsed(lei))
            break; // every index is set
        else
            collapse_this(lei);
    }

    load_tiles();

    size_t  img_wdt = TILE_WIDTH  * SWIDTH;
    size_t  img_hgt = TILE_HEIGHT * SHEIGHT;
    small_t *image = malloc(img_wdt * img_hgt * 3);
    memset(image, 0, img_wdt * img_hgt);

    for(size_t i = 0; i < SHEIGHT; i++)
    {
        for(size_t j = 0; j < SWIDTH; j++)
        {
            size_t t = get_collapsed_tile(i * SWIDTH + j);
            if(t == TILES) exit(-124);

            for(size_t y = 0; y < TILE_HEIGHT; y++)
                for(size_t x = 0; x < TILE_WIDTH; x++)
                    for(int k = 0; k < 3; k++)
                        image[((y+(i*TILE_HEIGHT))*img_wdt+(x+(j*TILE_WIDTH)))*3 + k] =
                            get_tile_pixel(t, x, y, k);
        }
    }

    free_tiles();

    char file_name[64] = {0};

    sprintf(file_name, "files/file_%ld.ppm", seed);
    save_as_ppm(file_name, image, img_wdt, img_hgt, 10);
    printf("Saved file with name: %s\n", file_name);

    free(image);
    return 0;
}