aboutsummaryrefslogtreecommitdiff
path: root/gst/generate.c
blob: 1d8a3402976be28da95969221ffa8b3bd7ea5f91 (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
#include <stdlib.h>
#include <stdio.h>
#include <time.h>
#include <string.h>

#include "generate.h"

void generate_init () {
    srand(time(NULL));
}

float calc_unit_cost (infos *info, info_unit *u) {
    stats_unit base; 
    stats_unit_compute(info, u, &base);
    return stats_compute_cost(&info->cost_weights, &base);
}

int accept_cond (infos *info, info_unit *u, float cost_max) {
    stats_unit base; 
    stats_unit_compute(info, u, &base);
    float cost = stats_compute_cost(&info->cost_weights, &base);
    if (base.frame.weight > base.frame.weight_max) return 0;
    if (cost > cost_max) return 0;
    return 1;
}

// generates randomly a valid unit
void gen_unit_attempt (infos *info, info_unit *u, float cost_max) {
    info_unit_init(u);
    stats_unit base; 
    u->chassis = rand() % info->statslen[STATS_CHASSIS];
    u->battery = rand() % info->statslen[STATS_BATTERY];
    u->brain = rand() % info->statslen[STATS_BRAIN];
    stats_unit_compute(info, u, &base);
    for (int i=0; i<base.frame.slot_weapon; i++) {
        u->weapons[i] = rand() % info->statslen[STATS_WEAPONS];
        if (!accept_cond(info, u, cost_max)) { u->weapons[i] = -1; return; }
    }
    for (int i=0; i<base.frame.slot_armor; i++) {
        u->armor[i] = rand() % info->statslen[STATS_ARMOR];
        if (!accept_cond(info, u, cost_max)) { u->armor[i] = -1; return; }
    }
    for (int i=0; i<base.frame.slot_aug; i++) {
        u->augs[i] = rand() % info->statslen[STATS_AUGS];
        if (!accept_cond(info, u, cost_max)) { u->augs[i] = -1; return; }
    }
}

// selects the max cost generated unit
int generate_unit (infos *info, info_unit *u, float cost_max) {
    info_unit cand = *u;
    info_unit candmax; info_unit_init(&candmax);
    float cost;
    for (int i=0; i<GENERATE_UNIT_MAX_ATTEMPTS; i++) {
        cand = *u;
        gen_unit_attempt(info, &cand, cost_max);
        if (accept_cond(info, &cand, cost_max)) { 
            if (calc_unit_cost(info, &cand) 
            > calc_unit_cost(info, &candmax)) {
                candmax = cand;
                printf("found: %f\n", calc_unit_cost(info, &cand));
            }
        }
    }
    if (candmax.chassis != -1) {
        *u = candmax;
        return 0;
    }
    else return 1;
}