summaryrefslogtreecommitdiff
path: root/src/dna.cpp
blob: 8cef6e093b2bb1a6233ba61da3b7bb1ec8c10c99 (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
#include "dna.hpp"

DNA::DNA(std::string s)
{
        if(s == "creature"){
                type                    = CREATURE_TYPE;
                maxHealth               = CREATURE_MAX_HEALTH;
                bestSense               = CREATURE_BEST_SENSE;
                bite                    = CREATURE_BITE;
                expectedPregnancyTime   = CREATURE_EXP_PREG_TIME;
                expectedAge             = CREATURE_EXP_AGE;
                growAmount              = 0;
                reach                   = CREATURE_REACH;
                speed                   = CREATURE_SPEED;
                mutationPercent         = CREATURE_MUTATION_PERCENT;
                mutationChance          = CREATURE_MUTATION_CHANCE;
        }
        else if(s == "resource"){
                type                    = RESOURCE_TYPE;
                maxHealth               = RESOURCE_MAX_HEALTH;
                bestSense               = 0;
                bite                    = 0;
                expectedPregnancyTime   = 0;
                expectedAge             = 0;
                growAmount              = RESOURCE_GROW_AMOUNT;
                reach                   = 0;
                speed                   = 0;
                mutationPercent         = 0;
                mutationChance          = 0;
        }
}

DNA DNA::combine(DNA D)
{
        DNA N;
        N.type                  = CREATURE_TYPE; 
        N.maxHealth             = (maxHealth                    + D.maxHealth)/2; 
        N.bestSense             = (bestSense                    + D.bestSense)/2; 
        N.bite                  = (bite                         + D.bite)/2; 
        N.expectedPregnancyTime = (expectedPregnancyTime        + D.expectedPregnancyTime)/2; 
        N.expectedAge           = (expectedAge                  + D.expectedAge)/2; 
        N.growAmount            = (growAmount                   + D.growAmount)/2;
        N.reach                 = (reach                        + D.reach)/2; 
        N.speed                 = (speed                        + D.speed)/2; 
        N.mutationPercent       = (mutationPercent              + D.mutationPercent)/2;
        N.mutationChance        = (mutationChance               + D.mutationChance)/2;

        if(roll(mutationChance)){
                float pn;
                if(rand()%2)
                        pn = 1;
                else
                        pn = -1;
                switch(rand()%10){
                        case 0: N.maxHealth             = abs(N.maxHealth               *(N.mutationPercent+pn));       break;
                        case 1: N.bestSense             = abs(N.bestSense               *(N.mutationPercent+pn));       break;
                        case 2: N.bite                  = abs(N.bite                    *(N.mutationPercent+pn));       break;
                        case 3: N.expectedPregnancyTime = abs(N.expectedPregnancyTime   *(N.mutationPercent+pn));       break;
                        case 4: N.expectedAge           = abs(N.expectedAge             *(N.mutationPercent+pn));       break;
                        case 5: N.growAmount            = abs(N.growAmount              *(N.mutationPercent+pn));       break;
                        case 6: N.reach                 = abs(N.reach                   *(N.mutationPercent+pn));       break;
                        case 7: N.speed                 = abs(N.speed                   *(N.mutationPercent+pn));       break;
                        case 8: N.mutationPercent       = abs(N.expectedAge             *(N.mutationPercent+pn));       break;
                        case 9: N.mutationChance        = abs(N.mutationChance          *(N.mutationPercent+pn));       break;
                }
        }
        return N;
}