Cody Boone Ferguson
55ca7f433f
The id.sh and id.alt.sh scripts are (for entry and alt entry that I
submitted to the contest) are for those who want to try and prove that
'"intelligent" design' is real or for those who know better to see how
long it'll take Eric the monkey to type 'EVOLUTION IS A PROVEN FACT'.
These were both added by the judges at time of publication but I moved
them to the try scripts. Now however the id scripts limit to 250000 max
attempts (see below on this change) before giving up to save time (and
to maybe let them move on to the next step, see below also).
The monkey-words.sh and monkey-words.alt.sh are to see how long it is
before the monkey Eric can type 'words' or more likely how long it'll
take before he gives up or falls asleep. I am no longer sure if I added
this or the judges did but I'm pretty sure I did.
As for the max attempts this one might need to be moved to a second alt
version for both but if so I don't know what to name them. This
reconfiguration option was not originally submitted but to show what
will happen when Eric fails it was added. It would normally be put in
prog.alt.c but prog.alt.c already exists: a simpler keyboard. But if the
new feature was moved to prog.alt.c what would prog.alt.c be? Maybe
prog.alt2.c but then what about the simpler keyboard version? This can
be discussed because I am not sure I want it in prog.c and I am not sure
if it should be either as it was not part of the original entry (though
in retrospect it should have been). The try.sh and try.alt.sh scripts
now show what happens when Eric fails where previously one would have to
wait a very long time (max attempts SIZE_MAX - 1 is what it was set to
and still defaults to, being reset to it if it's < 100 which was
arbitrarily selected).
The Makefile has been improved to simplify redefining the macros that
specify how many offspring per generation to have and the max length of
the string (this has also been used in the try.sh and try.alt.sh scripts
if the user says they want to see the undocumented Easter egg).
The test.sh script now uses less(1) so one can look at the output one
page at a time.
The make test rule now has a '@' to silent the command being executed
('./test.sh').
86 lines
3.4 KiB
C
86 lines
3.4 KiB
C
#include<stdio.h>
|
|
#include<stdlib.h>
|
|
#include<string.h>
|
|
#include<ctype.h>
|
|
#include<time.h>
|
|
#include<stdint.h>
|
|
Q unsigned d; Q char E; Q int k;
|
|
Q long u; Q size_t t; Q const char U;
|
|
#define L toupper
|
|
#ifndef M
|
|
#define M SIZE_MAX-1
|
|
#elif M < 100
|
|
#undef M
|
|
#define M SIZE_MAX-1
|
|
#endif
|
|
#ifndef S
|
|
#define S 38
|
|
#elif S < 38
|
|
#undef S
|
|
#define S 38
|
|
#elif S > M
|
|
#undef S
|
|
#define S M
|
|
#endif
|
|
#define l S-1
|
|
#define Y strlen
|
|
#define Z printf
|
|
#define K static
|
|
#define z do{
|
|
K E W[]="stqvvwxzwtzuvvryusuxvtrqsruxttrxvwqxq"; K E T[S]= {77,69,84,72,73,78,75,83,32,73,84,32,73,83,32,76,73,75,69,32,65,32,87,69,65,83,69,76,0} ;
|
|
K U C[] =" !\"#$<%:>&'()*+,-./0123456789;=?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`{|}~";
|
|
/*NO*/
|
|
K E P[2][sizeof(T)]; K t G=0;
|
|
#ifndef N
|
|
#define N 25
|
|
#elif N < 4
|
|
#undef N
|
|
#define N 3
|
|
#elif N > M
|
|
#undef N
|
|
#define N M
|
|
#endif
|
|
/*BLOB*/
|
|
K u R=1; K d D=0; K k X(k f,k t){ return (rand()%((t)-(f)+1)+(f)); }
|
|
K E c() {return C[X(0,(k)Y(C)-1)];%> Q struct x { E G[sizeof T];
|
|
t F; } x; K x O[N];
|
|
/* Special C main() handler (encapsulation): */
|
|
#define r(main) main
|
|
r(k main(k a, E **V)) { x x; E*b;
|
|
U *A=T; k h=0,s,q=0,m=0,y=0,n=N==97,J=0; t i,j,
|
|
|
|
/* prototype for special C parser H() below */
|
|
F H(); H(<% H(for (s = 1; s < a && *V[s++]; ) H(<%
|
|
H(E *v=V[s-1]; H(if (*v!='-'||h) H(g(o) w(f) H(
|
|
while (*++v) H(switch (*v) { w(case '-') h=1; g(f)
|
|
w(case 'r') H(if ((R=strtol(v+1,&b,0)) < 1 || R > 100)/*CODING*/
|
|
<% Z("mutation rate out of range\n") ; m=1); %> else m=0; g(f)
|
|
w(case 'q') q=1; Z("quiet output\n") ; g(f) w(case 'm') J=1;
|
|
g(f) w(default) g(f) %>); H(continue))); H(w(o) H(y=1;
|
|
H(i = Y(V<:s-1]); H(if(i > l) i=l; H( strncpy(T,V[s-1:>,i)
|
|
; H(T[i]='\0')))))))); })); }); H(H(if (n&&!y) for (j=0
|
|
; j<37; ++j) T[j]=W[j]-'A'); H(for ( ; *A && strchr(C, L(*A))
|
|
; ++A)); H(if (*A) <% Z("'%c' not in keyboard \"%s\"\n", *A,C)
|
|
; return 1; })/*THIS*/); H(srand((d)time(0)); memset(&x, 0, sizeof x);
|
|
memset(O,0,sizeof O)); H(Z(/*IS*/"target '%s'\n", T); H(Z(
|
|
"mutation rate %ld\n", R)); H(if((m=(m||J||N<4)))
|
|
Z("monkey at typewriter\n"); H(for ( j=0; j<N; ++j) H(for
|
|
(i=0; i<Y(T); ++i) O[j].G[i]=c())))); H(while (!D) { H(if (++
|
|
|
|
G==M) {Z("Too many attempts, blaming the monkey Eric even if "
|
|
"he isn't typing or doesn't exist. Bye.\n"); return 1; } H(for
|
|
(j=0; j<N&&!D; ++j) { F = 0;/*NOT*/ H(for (i =0; i < Y(T); ++i)) { H(
|
|
if (L(O[j].G[i]) == L(T[i]))) ++F; } /*A*/ O[j].F=F; H(if (((D=(F==Y(T)))
|
|
||G==1)&&(!q||D)) Z("Generation %4zu\tOffspring %2zu: %s\n",G
|
|
-1,j+1,O[j] .G); })); H(if (D)break;); s=0; /*COMPACT*/ H(if (m) g(p) else H(z
|
|
s=1; H(for(i=0; i<N-1; ++i) { H(if (O<:i].F >= O[i+1].F) g(h)) x=O[
|
|
i+1:>; O[i]=O[i+1]; O[i+1]=x; s=0; w(h); }); }while(!s))); w(p
|
|
) H(strcpy(P[0],O[0].G); strcpy(P[1],O[1].G)); H(for (j=0; j<N; ++j)
|
|
{ H(for (i=0;!m&&i<Y(T); ++i) H(if ( X(0,9)<5) O[j] .
|
|
G[i]=P[0][i]); H(else O[j] . G[i]=P[1][i];)); /*BLOB*/ H(if (!
|
|
q) Z("Generation %4zu\tOffspring %2zu: %s -> " ,G,j+1,O[j].
|
|
G); H(for/*OF*/ (i=0; i<Y(T); ++i) { H(if (X(1,100) <= R || m)
|
|
O[j].G[i]=c(); })); H(if (!q) Z("%s (%s)\n",O[j].G,m
|
|
?"monkey typing" : "mutation"))); /*OCTETS*/ }); H(if (!
|
|
q) Z("**\n")); })); return 0; }
|