-
Notifications
You must be signed in to change notification settings - Fork 0
/
AGCODE.c
249 lines (206 loc) · 4.43 KB
/
AGCODE.c
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
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
// Inspired by rheide/Hello-genetic-algorithm
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <unistd.h>
#define O_SPARTA 0x01
#define CHARMAP "abcdefghijklmnopqrstuvwxyz"\
"ABCDEFGHIJKLMNOPQRSTUVWXYZ"\
"0123456789"\
"!@#$%%^&*(_-)+=[]{}<>|\\;:'\",./?~` "
#define RANDBETWEEN(A,B) A + rand()/(RAND_MAX/(B - A))
#define CHANCE(A) rand() < A * RAND_MAX
static char* target = "Hello, world!";
static size_t el_sz;
static size_t total_sz;
static char options = 0;
static unsigned int pop_size = 2048;
static unsigned int challengers = 3;
static float elitism = .1;
static float mutation = .25;
static char
rndchr(char* map)
{
return *(map+RANDBETWEEN(0, strlen(map)));
}
static char
randchar()
{
return rndchr(CHARMAP);
}
static char*
rndstr(char* map, size_t strsize)
{
char *result = malloc(strsize);
size_t i;
for (i = 0; i < strsize; i++) {
*(result+i) = rndchr(map);
};
return result;
}
static int
fitness(char* str, char* gauge, size_t n)
{
int i;
int result = 0;
for (i = n-1; i >= 0; i--) {
result += abs(str[i]-gauge[i]);
}
return result;
}
static int
_fitness(char* str)
{
return fitness(str, target, el_sz);
}
static int
fit_cmp(const void *el1, const void *el2)
{
int a = _fitness((char*)el1);
int b = _fitness((char*)el2);
if (a > b) return 1;
if (a < b) return -1;
return 0;
}
static void
mutate(char *p)
{
*(p + RANDBETWEEN(0, el_sz)) = randchar();
}
static char*
rnd_el(char *p)
{
unsigned int top = pop_size;
if ((options & O_SPARTA) == O_SPARTA) {
top = pop_size * elitism;
}
return p + el_sz * (int)(RANDBETWEEN(0, top));
}
static char*
trnmnt(char *p)
{
size_t i;
char* winner = rnd_el(p);
char* challenger;
int f1 = _fitness(winner);
int f2;
for (i = challengers; i > 0; i--) {
challenger = rnd_el(p);
f2 = _fitness(challenger);
if (f2 < f1) {
f1 = f2;
winner = challenger;
}
}
return winner;
}
static void
mate(char *p, char *buffer)
{
char *a, *b;
size_t i, pivot;
size_t skip = (size_t)(elitism * pop_size) * el_sz;
memcpy(buffer, p, total_sz);
for (i = skip; i <= total_sz-el_sz; i += el_sz) {
a = trnmnt(p);
b = trnmnt(p);
pivot = RANDBETWEEN(0, el_sz);
strncpy(buffer + i, a, el_sz);
strncpy(buffer + i, b, pivot);
if (CHANCE(mutation)) { mutate(buffer + i); }
if (i < total_sz - el_sz) {
i += el_sz;
strncpy(buffer + i, b, el_sz);
strncpy(buffer + i, a, pivot);
if (CHANCE(mutation)) { mutate(buffer + i); }
}
}
memcpy(p, buffer, total_sz);
}
static void
run_tests(void)
{
assert(000 == fitness("Hello, world!", "Hello, world!", 13));
assert(399 == fitness("H5p&J;!l<X\\7l", "Hello, world!", 13));
assert(297 == fitness("Vc;fx#QRP8V\\$", "Hello, world!", 13));
assert(415 == fitness("t\\O`E_Jx$n=NF", "Hello, world!", 13));
printf("Tests passed.\n\n");
}
static void
print_usage(char *self)
{
printf("Usage: %s [-t] [-s] [-h] [-p SIZE] [-c COUNT] [-e RATIO] [-m RATIO] [-i STRING]\n", self);
printf(" -t: run tests\n");
printf(" -s: Sparta! mode (Only elite can mate)\n");
printf(" -h: Show this help\n");
printf(" -p SIZE: Population size\n");
printf(" -c COUNT: Challengers count for mate tournament\n");
printf(" -e RATIO: Elitism ratio\n");
printf(" -m RATIO: Mutation ratio\n");
printf(" -i STRING: search this instead of \"Hello, World!\"\n");
}
static void
check_params()
{
if ((options & O_SPARTA) == O_SPARTA
&& ((int)(pop_size * elitism) == 0)) {
printf("You have not enough spartans.\n");
exit(1);
}
}
int main(int argc, char **argv)
{
int i = 0;
int bestfit = RAND_MAX;
int opt;
srand((unsigned int)time(NULL));
while((opt = getopt(argc, argv, "tshi:p:e:m:c:")) != -1) {
switch (opt) {
case 't':
run_tests();
break;
case 's':
options |= O_SPARTA;
break;
case 'i':
target = optarg;
break;
case 'p':
pop_size = atoi(optarg);
break;
case 'c':
challengers = atoi(optarg);
break;
case 'e':
elitism = atof(optarg);
break;
case 'm':
mutation = atof(optarg);
break;
case 'h':
default:
print_usage(argv[0]);
exit(1);
}
}
check_params();
el_sz = strlen(target);
total_sz = pop_size * el_sz;
char *p = rndstr(CHARMAP, total_sz);
char *b = malloc(total_sz);
while (bestfit) {
qsort(p, pop_size, el_sz, fit_cmp);
i += 1;
if (bestfit != _fitness(p)) {
bestfit = _fitness(p);
printf("[%03d] Best: (%04d)\t%.*s\n", i,
bestfit, (int)el_sz, p);
}
mate(p, b);
}
free(p);
free(b);
return 0;
}