1 /* -*- Mode: C; tab-width: 4 -*- */
3 * ant --- Chris Langton's generalized turing machine ants (also known
4 * as Greg Turk's turmites) whose tape is the screen
8 static const char sccsid[] = "@(#)ant.c 5.00 2000/11/01 xlockmore";
12 * Copyright (c) 1995 by David Bagley.
14 * Permission to use, copy, modify, and distribute this software and its
15 * documentation for any purpose and without fee is hereby granted,
16 * provided that the above copyright notice appear in all copies and that
17 * both that copyright notice and this permission notice appear in
18 * supporting documentation.
20 * This file is provided AS IS with no warranties of any kind. The author
21 * shall have no liability with respect to the infringement of copyrights,
22 * trade secrets or any patents by this file or any part thereof. In no
23 * event will the author be liable for any lost revenue or profits or
24 * other special, indirect and consequential damages.
27 * 01-Nov-2000: Allocation checks
28 * 10-May-1997: Compatible with xscreensaver
29 * 16-Apr-1997: -neighbors 3 and 8 added
30 * 01-Jan-1997: Updated ant.c to handle more kinds of ants. Thanks to
31 * J Austin David <Austin.David@tlogic.com>. Check it out in
32 * java at http://havoc.gtf.gatech.edu/austin He thought up the
34 * 04-Apr-1996: -neighbors 6 runtime-time option added for hexagonal ants
35 * (bees), coded from an idea of Jim Propp's in Science News,
36 * Oct 28, 1995 VOL. 148 page 287
37 * 20-Sep-1995: Memory leak in ant fixed. Now random colors.
38 * 05-Sep-1995: Coded from A.K. Dewdney's "Computer Recreations", Scientific
39 * American Magazine" Sep 1989 pp 180-183, Mar 1990 p 121
40 * Also used Ian Stewart's Mathematical Recreations, Scientific
41 * American Jul 1994 pp 104-107
42 * also used demon.c and life.c as a guide.
46 Species Grid Number of Neighbors
47 ------- ---- ------------------
50 Bees Triangle 3 (or 9, 12)
52 Neighbors 6 and neighbors 3 produce the same Turk ants.
56 /*# define DO_STIPPLE*/
61 # define DEFAULTS "*delay: 20000 \n" \
66 "*fpsSolid: true \n" \
68 # define reshape_ant 0
69 # define release_ant 0
70 # define ant_handle_event 0
71 # include "xlockmore.h" /* in xscreensaver distribution */
72 #else /* STANDALONE */
73 # include "xlock.h" /* in xlockmore distribution */
74 #endif /* STANDALONE */
80 * neighbors of 0 randomizes it for 3, 4, 6, 8, 12 (last 2 are less likely)
83 #define DEF_NEIGHBORS "0" /* choose random value */
84 #define DEF_TRUCHET "False"
85 #define DEF_EYES "False"
86 #define DEF_SHARPTURN "False"
91 static Bool sharpturn;
93 static XrmOptionDescRec opts[] =
95 {"-neighbors", ".ant.neighbors", XrmoptionSepArg, 0},
96 {"-truchet", ".ant.truchet", XrmoptionNoArg, "on"},
97 {"+truchet", ".ant.truchet", XrmoptionNoArg, "off"},
98 {"-eyes", ".ant.eyes", XrmoptionNoArg, "on"},
99 {"+eyes", ".ant.eyes", XrmoptionNoArg, "off"},
100 {"-sharpturn", ".ant.sharpturn", XrmoptionNoArg, "on"},
101 {"+sharpturn", ".ant.sharpturn", XrmoptionNoArg, "off"},
103 static argtype vars[] =
105 {&neighbors, "neighbors", "Neighbors", DEF_NEIGHBORS, t_Int},
106 {&truchet, "truchet", "Truchet", DEF_TRUCHET, t_Bool},
107 {&eyes, "eyes", "Eyes", DEF_EYES, t_Bool},
108 {&sharpturn, "sharpturn", "SharpTurn", DEF_SHARPTURN, t_Bool},
110 static OptionStruct desc[] =
112 {"-neighbors num", "squares 4 or 8, hexagons 6, triangles 3 or 12"},
113 {"-/+truchet", "turn on/off Truchet lines"},
114 {"-/+eyes", "turn on/off eyes"},
115 {"-/+sharpturn", "turn on/off sharp turns (6, 8 or 12 neighbors only)"}
118 ENTRYPOINT ModeSpecOpt ant_opts =
119 {sizeof opts / sizeof opts[0], opts, sizeof vars / sizeof vars[0], vars, desc};
122 const ModStruct ant_description =
124 "init_ant", "draw_ant", (char *) NULL,
125 "refresh_ant", "init_ant", "free_ant", &ant_opts,
126 1000, -3, 40000, -12, 64, 1.0, "",
127 "Shows Langton's and Turk's generalized ants", 0, NULL};
131 #define ANTBITS(n,w,h)\
132 if ((ap->pixmaps[ap->init_bits]=\
133 XCreatePixmapFromBitmapData(display,window,(char *)n,w,h,1,0,1))==None){\
134 free_ant(mi); return;} else {ap->init_bits++;}
136 /* If you change the table you may have to change the following 2 constants */
139 #define REDRAWSTEP 2000 /* How much tape to draw per cycle */
140 #define MINGRIDSIZE 24
142 #define MINRANDOMSIZE 5
166 unsigned char ncolors, nstates;
168 int redrawing, redrawpos;
169 int truchet; /* Only for Turk modes */
172 statestruct machine[NUMSTIPPLES * STATES];
174 unsigned char *truchet_state;
177 unsigned char colors[NUMSTIPPLES - 1];
180 # endif /* DO_STIPPLE */
181 Pixmap pixmaps[NUMSTIPPLES - 1];
183 XPoint hexagon[7]; /* Need more than 6 for truchet */
184 XPoint triangle[2][4]; /* Need more than 3 for truchet */
188 static char plots[] =
195 #define NEIGHBORKINDS ((long) (sizeof plots / sizeof *plots))
196 #define GOODNEIGHBORKINDS 3
198 /* Relative ant moves */
199 #define FS 0 /* Step */
200 #define TRS 1 /* Turn right, then step */
201 #define THRS 2 /* Turn hard right, then step */
202 #define TBS 3 /* Turn back, then step */
203 #define THLS 4 /* Turn hard left, then step */
204 #define TLS 5 /* Turn left, then step */
205 #define SF 6 /* Step */
206 #define STR 7 /* Step then turn right */
207 #define STHR 8 /* Step then turn hard right */
208 #define STB 9 /* Step then turn back */
209 #define STHL 10 /* Step then turn hard left */
210 #define STL 11 /* Step then turn left */
212 static antfarmstruct *antfarms = (antfarmstruct *) NULL;
214 /* LANGTON'S ANT (10) Chaotic after 500, Builder after 10,000 (104p) */
215 /* TURK'S 100 ANT Always chaotic?, tested past 150,000,000 */
216 /* TURK'S 101 ANT Always chaotic? */
217 /* TURK'S 110 ANT Builder at 150 (18p) */
218 /* TURK'S 1000 ANT Always chaotic? */
219 /* TURK'S 1100 SYMMETRIC ANT all even run 1's and 0's are symmetric */
220 /* other examples 1001, 110011, 110000, 1001101 */
221 /* TURK'S 1101 ANT Builder after 250,000 (388p) */
222 /* Once saw a chess horse type builder (i.e. non-45 degree builder) */
225 /* All alternating 10 appear symmetric, no proof (i.e. 10, 1010, etc) */
226 /* Even runs of 0's and 1's are also symmetric */
227 /* I have seen Hexagonal builders but they are more rare. */
229 static unsigned char tables[][3 * NUMSTIPPLES * STATES + 2] =
232 /* Here just so you can figure out notation */
233 { /* Langton's ant */
238 /* First 2 numbers are the size (ncolors, nstates) */
239 { /* LADDER BUILDER */
241 1, STR, 0, 2, STL, 0, 3, TRS, 0, 0, TLS, 0
243 { /* SPIRALING PATTERN */
248 { /* SQUARE (HEXAGON) BUILDER */
256 #define NTABLES (sizeof tables / sizeof tables[0])
259 position_of_neighbor(antfarmstruct * ap, int dir, int *pcol, int *prow)
261 int col = *pcol, row = *prow;
263 if (ap->neighbors == 6) {
266 col = (col + 1 == ap->ncols) ? 0 : col + 1;
270 col = (col + 1 == ap->ncols) ? 0 : col + 1;
271 row = (!row) ? ap->nrows - 1 : row - 1;
275 col = (!col) ? ap->ncols - 1 : col - 1;
276 row = (!row) ? ap->nrows - 1 : row - 1;
279 col = (!col) ? ap->ncols - 1 : col - 1;
283 col = (!col) ? ap->ncols - 1 : col - 1;
284 row = (row + 1 == ap->nrows) ? 0 : row + 1;
288 col = (col + 1 == ap->ncols) ? 0 : col + 1;
289 row = (row + 1 == ap->nrows) ? 0 : row + 1;
292 (void) fprintf(stderr, "wrong direction %d\n", dir);
294 } else if (ap->neighbors == 4 || ap->neighbors == 8) {
297 col = (col + 1 == ap->ncols) ? 0 : col + 1;
300 col = (col + 1 == ap->ncols) ? 0 : col + 1;
301 row = (!row) ? ap->nrows - 1 : row - 1;
304 row = (!row) ? ap->nrows - 1 : row - 1;
307 col = (!col) ? ap->ncols - 1 : col - 1;
308 row = (!row) ? ap->nrows - 1 : row - 1;
311 col = (!col) ? ap->ncols - 1 : col - 1;
314 col = (!col) ? ap->ncols - 1 : col - 1;
315 row = (row + 1 == ap->nrows) ? 0 : row + 1;
318 row = (row + 1 == ap->nrows) ? 0 : row + 1;
321 col = (col + 1 == ap->ncols) ? 0 : col + 1;
322 row = (row + 1 == ap->nrows) ? 0 : row + 1;
325 (void) fprintf(stderr, "wrong direction %d\n", dir);
328 if ((col + row) % 2) { /* right */
331 col = (!col) ? ap->ncols - 1 : col - 1;
335 col = (!col) ? ap->ncols - 1 : col - 1;
336 row = (!row) ? ap->nrows - 1 : row - 1;
339 col = (!col) ? ap->ncols - 1 : col - 1;
357 row = (!row) ? ap->nrows - 1 : row - 1;
361 col = (col + 1 == ap->ncols) ? 0 : col + 1;
362 row = (!row) ? ap->nrows - 1 : row - 1;
365 col = (col + 1 == ap->ncols) ? 0 : col + 1;
369 col = (col + 1 == ap->ncols) ? 0 : col + 1;
370 row = (row + 1 == ap->nrows) ? 0 : row + 1;
373 row = (row + 1 == ap->nrows) ? 0 : row + 1;
377 if (row + 1 == ap->nrows)
379 else if (row + 2 == ap->nrows)
385 col = (!col) ? ap->ncols - 1 : col - 1;
386 if (row + 1 == ap->nrows)
388 else if (row + 2 == ap->nrows)
395 col = (!col) ? ap->ncols - 1 : col - 1;
396 row = (row + 1 == ap->nrows) ? 0 : row + 1;
399 (void) fprintf(stderr, "wrong direction %d\n", dir);
404 col = (col + 1 == ap->ncols) ? 0 : col + 1;
408 col = (col + 1 == ap->ncols) ? 0 : col + 1;
409 row = (row + 1 == ap->nrows) ? 0 : row + 1;
412 col = (col + 1 == ap->ncols) ? 0 : col + 1;
413 if (row + 1 == ap->nrows)
415 else if (row + 2 == ap->nrows)
422 if (row + 1 == ap->nrows)
424 else if (row + 2 == ap->nrows)
430 row = (row + 1 == ap->nrows) ? 0 : row + 1;
434 col = (!col) ? ap->ncols - 1 : col - 1;
435 row = (row + 1 == ap->nrows) ? 0 : row + 1;
438 col = (!col) ? ap->ncols - 1 : col - 1;
442 col = (!col) ? ap->ncols - 1 : col - 1;
443 row = (!row) ? ap->nrows - 1 : row - 1;
446 row = (!row) ? ap->nrows - 1 : row - 1;
458 col = (col + 1 == ap->ncols) ? 0 : col + 1;
468 col = (col + 1 == ap->ncols) ? 0 : col + 1;
469 row = (!row) ? ap->nrows - 1 : row - 1;
472 (void) fprintf(stderr, "wrong direction %d\n", dir);
481 fillcell(ModeInfo * mi, GC gc, int col, int row)
483 antfarmstruct *ap = &antfarms[MI_SCREEN(mi)];
485 if (ap->neighbors == 6) {
486 int ccol = 2 * col + !(row & 1), crow = 2 * row;
488 ap->shape.hexagon[0].x = ap->xb + ccol * ap->xs;
489 ap->shape.hexagon[0].y = ap->yb + crow * ap->ys;
490 if (ap->xs == 1 && ap->ys == 1)
491 XDrawPoint(MI_DISPLAY(mi), MI_WINDOW(mi), gc,
492 ap->shape.hexagon[0].x, ap->shape.hexagon[0].y);
494 XFillPolygon(MI_DISPLAY(mi), MI_WINDOW(mi), gc,
495 ap->shape.hexagon, 6, Convex, CoordModePrevious);
496 } else if (ap->neighbors == 4 || ap->neighbors == 8) {
497 XFillRectangle(MI_DISPLAY(mi), MI_WINDOW(mi), gc,
498 ap->xb + ap->xs * col, ap->yb + ap->ys * row,
499 ap->xs - (ap->xs > 3), ap->ys - (ap->ys > 3));
501 int orient = (col + row) % 2; /* O left 1 right */
503 ap->shape.triangle[orient][0].x = ap->xb + col * ap->xs;
504 ap->shape.triangle[orient][0].y = ap->yb + row * ap->ys;
505 if (ap->xs <= 3 || ap->ys <= 3)
506 XDrawPoint(MI_DISPLAY(mi), MI_WINDOW(mi), gc,
507 ((orient) ? -1 : 1) + ap->shape.triangle[orient][0].x,
508 ap->shape.triangle[orient][0].y);
511 ap->shape.triangle[orient][0].x += (ap->xs / 2 - 1);
513 ap->shape.triangle[orient][0].x -= (ap->xs / 2 - 1);
514 XFillPolygon(MI_DISPLAY(mi), MI_WINDOW(mi), gc,
515 ap->shape.triangle[orient], 3, Convex, CoordModePrevious);
521 truchetcell(ModeInfo * mi, int col, int row, int truchetstate)
523 antfarmstruct *ap = &antfarms[MI_SCREEN(mi)];
525 if (ap->neighbors == 6) {
527 int ccol = 2 * col + !(row & 1), crow = 2 * row;
529 int fudge = 7; /* fudge because the hexagons are not exact */
533 hex.x = ap->xb + ccol * ap->xs - (int) ((double) ap->xs / 2.0) - 1;
534 hex.y = ap->yb + crow * ap->ys - (int) ((double) ap->ys / 2.0) - 1;
535 for (side = 0; side < 6; side++) {
537 hex.x += ap->shape.hexagon[side].x;
538 hex.y += ap->shape.hexagon[side].y;
540 if (truchetstate == side % 2)
541 XDrawArc(MI_DISPLAY(mi), MI_WINDOW(mi), MI_GC(mi),
542 hex.x, hex.y, ap->xs, ap->ys,
543 ((570 - (side * 60) + fudge) % 360) * 64, (120 - 2 * fudge) * 64);
546 /* Very crude approx of Sqrt 3, so it will not cause drawing errors. */
547 hex.x = ap->xb + ccol * ap->xs - (int) ((double) ap->xs * 1.6 / 2.0) - 1;
548 hex.y = ap->yb + crow * ap->ys - (int) ((double) ap->ys * 1.6 / 2.0) - 1;
549 for (side = 0; side < 6; side++) {
551 hex.x += ap->shape.hexagon[side].x;
552 hex.y += ap->shape.hexagon[side].y;
554 hex2.x = hex.x + ap->shape.hexagon[side + 1].x / 2;
555 hex2.y = hex.y + ap->shape.hexagon[side + 1].y / 2 + 1;
556 /* Lots of fudging here */
558 hex2.x += (short) (ap->xs * 0.1 + 1);
559 hex2.y += (short) (ap->ys * 0.1 - ((ap->ys > 5) ? 1 : 0));
560 } else if (side == 2) {
561 hex2.x += (short) (ap->xs * 0.1);
562 } else if (side == 4) {
563 hex2.x += (short) (ap->xs * 0.1);
564 hex2.y += (short) (ap->ys * 0.1 - 1);
565 } else if (side == 5) {
566 hex2.x += (short) (ap->xs * 0.5);
567 hex2.y += (short) (-ap->ys * 0.3 + 1);
569 if (truchetstate == side % 3)
570 /* Crude approx of 120 deg, so it will not cause drawing errors. */
571 XDrawArc(MI_DISPLAY(mi), MI_WINDOW(mi), MI_GC(mi),
573 (int) ((double) ap->xs * 1.5), (int) ((double) ap->ys * 1.5),
574 ((555 - (side * 60)) % 360) * 64, 90 * 64);
577 } else if (ap->neighbors == 4) {
579 XDrawArc(MI_DISPLAY(mi), MI_WINDOW(mi), MI_GC(mi),
580 ap->xb + ap->xs * col - ap->xs / 2 + 1,
581 ap->yb + ap->ys * row + ap->ys / 2 - 1,
582 ap->xs - 2, ap->ys - 2,
584 XDrawArc(MI_DISPLAY(mi), MI_WINDOW(mi), MI_GC(mi),
585 ap->xb + ap->xs * col + ap->xs / 2 - 1,
586 ap->yb + ap->ys * row - ap->ys / 2 + 1,
587 ap->xs - 2, ap->ys - 2,
590 XDrawArc(MI_DISPLAY(mi), MI_WINDOW(mi), MI_GC(mi),
591 ap->xb + ap->xs * col - ap->xs / 2 + 1,
592 ap->yb + ap->ys * row - ap->ys / 2 + 1,
593 ap->xs - 2, ap->ys - 2,
595 XDrawArc(MI_DISPLAY(mi), MI_WINDOW(mi), MI_GC(mi),
596 ap->xb + ap->xs * col + ap->xs / 2 - 1,
597 ap->yb + ap->ys * row + ap->ys / 2 - 1,
598 ap->xs - 2, ap->ys - 2,
601 } else if (ap->neighbors == 3) {
602 int orient = (col + row) % 2; /* O left 1 right */
604 int fudge = 7; /* fudge because the triangles are not exact */
605 double fudge2 = 1.18;
608 tri.x = ap->xb + col * ap->xs;
609 tri.y = ap->yb + row * ap->ys;
611 tri.x += (ap->xs / 2 - 1);
613 tri.x -= (ap->xs / 2 - 1);
615 for (side = 0; side < 3; side++) {
617 tri.x += ap->shape.triangle[orient][side].x;
618 tri.y += ap->shape.triangle[orient][side].y;
620 if (truchetstate == side) {
622 ang = (510 - side * 120) % 360; /* Right */
624 ang = (690 - side * 120) % 360; /* Left */
625 XDrawArc(MI_DISPLAY(mi), MI_WINDOW(mi), MI_GC(mi),
626 (int) (tri.x - ap->xs * fudge2 / 2),
627 (int) (tri.y - 3 * ap->ys * fudge2 / 4),
628 (unsigned int) (ap->xs * fudge2),
629 (unsigned int) (3 * ap->ys * fudge2 / 2),
630 (ang + fudge) * 64, (60 - 2 * fudge) * 64);
637 drawcell(ModeInfo * mi, int col, int row, unsigned char color)
639 antfarmstruct *ap = &antfarms[MI_SCREEN(mi)];
643 XSetForeground(MI_DISPLAY(mi), MI_GC(mi), MI_BLACK_PIXEL(mi));
646 } else if (MI_NPIXELS(mi) <= 2) {
648 gcv.foreground = MI_WHITE_PIXEL(mi);
649 gcv.background = MI_BLACK_PIXEL(mi);
650 gcv.stipple = ap->pixmaps[color - 1];
651 XChangeGC(MI_DISPLAY(mi), ap->stippledGC,
652 GCStipple | GCForeground | GCBackground, &gcv);
654 # endif /* !DO_STIPPLE */
656 XSetForeground(MI_DISPLAY(mi), MI_GC(mi),
657 MI_PIXEL(mi, ap->colors[color - 1]));
660 fillcell(mi, gc, col, row);
664 drawtruchet(ModeInfo * mi, int col, int row,
665 unsigned char color, unsigned char truchetstate)
667 antfarmstruct *ap = &antfarms[MI_SCREEN(mi)];
670 XSetForeground(MI_DISPLAY(mi), MI_GC(mi), MI_WHITE_PIXEL(mi));
671 else if (MI_NPIXELS(mi) > 2 || color > ap->ncolors / 2)
672 XSetForeground(MI_DISPLAY(mi), MI_GC(mi), MI_BLACK_PIXEL(mi));
674 XSetForeground(MI_DISPLAY(mi), MI_GC(mi), MI_WHITE_PIXEL(mi));
675 truchetcell(mi, col, row, truchetstate);
679 draw_anant(ModeInfo * mi, int direction, int col, int row)
681 antfarmstruct *ap = &antfarms[MI_SCREEN(mi)];
682 Display *display = MI_DISPLAY(mi);
683 Window window = MI_WINDOW(mi);
685 XSetForeground(display, MI_GC(mi), MI_WHITE_PIXEL(mi));
686 fillcell(mi, MI_GC(mi), col, row);
687 if (ap->eyes) { /* Draw Eyes */
688 XSetForeground(display, MI_GC(mi), MI_BLACK_PIXEL(mi));
689 if (ap->neighbors == 6) {
690 int ccol = 2 * col + !(row & 1), crow = 2 * row;
694 if (!(ap->xs > 3 && ap->ys > 3))
696 hex.x = ap->xb + ccol * ap->xs;
697 hex.y = ap->yb + crow * ap->ys + ap->ys / 2;
698 ang = direction * ap->neighbors / ANGLES;
699 for (side = 0; side < ap->neighbors; side++) {
701 hex.x -= ap->shape.hexagon[side].x / 2;
702 hex.y += ap->shape.hexagon[side].y / 2;
704 if (side == (ap->neighbors + ang - 2) % ap->neighbors)
705 XDrawPoint(display, window, MI_GC(mi), hex.x, hex.y);
706 if (side == (ap->neighbors + ang - 1) % ap->neighbors)
707 XDrawPoint(display, window, MI_GC(mi), hex.x, hex.y);
709 } else if (ap->neighbors == 4 || ap->neighbors == 8) {
710 if (!(ap->xs > 3 && ap->ys > 3))
714 XDrawPoint(display, window, MI_GC(mi),
715 ap->xb + ap->xs * (col + 1) - 3,
716 ap->yb + ap->ys * row + ap->ys / 2 - 2);
717 XDrawPoint(display, window, MI_GC(mi),
718 ap->xb + ap->xs * (col + 1) - 3,
719 ap->yb + ap->ys * row + ap->ys / 2);
722 XDrawPoint(display, window, MI_GC(mi),
723 ap->xb + ap->xs * (col + 1) - 4,
724 ap->yb + ap->ys * row + 1);
725 XDrawPoint(display, window, MI_GC(mi),
726 ap->xb + ap->xs * (col + 1) - 3,
727 ap->yb + ap->ys * row + 2);
730 XDrawPoint(display, window, MI_GC(mi),
731 ap->xb + ap->xs * col + ap->xs / 2 - 2,
732 ap->yb + ap->ys * row + 1);
733 XDrawPoint(display, window, MI_GC(mi),
734 ap->xb + ap->xs * col + ap->xs / 2,
735 ap->yb + ap->ys * row + 1);
738 XDrawPoint(display, window, MI_GC(mi),
739 ap->xb + ap->xs * col + 2,
740 ap->yb + ap->ys * row + 1);
741 XDrawPoint(display, window, MI_GC(mi),
742 ap->xb + ap->xs * col + 1,
743 ap->yb + ap->ys * row + 2);
746 XDrawPoint(display, window, MI_GC(mi),
747 ap->xb + ap->xs * col + 1,
748 ap->yb + ap->ys * row + ap->ys / 2 - 2);
749 XDrawPoint(display, window, MI_GC(mi),
750 ap->xb + ap->xs * col + 1,
751 ap->yb + ap->ys * row + ap->ys / 2);
754 XDrawPoint(display, window, MI_GC(mi),
755 ap->xb + ap->xs * col + 2,
756 ap->yb + ap->ys * (row + 1) - 3);
757 XDrawPoint(display, window, MI_GC(mi),
758 ap->xb + ap->xs * col + 1,
759 ap->yb + ap->ys * (row + 1) - 4);
762 XDrawPoint(display, window, MI_GC(mi),
763 ap->xb + ap->xs * col + ap->xs / 2 - 2,
764 ap->yb + ap->ys * (row + 1) - 3);
765 XDrawPoint(display, window, MI_GC(mi),
766 ap->xb + ap->xs * col + ap->xs / 2,
767 ap->yb + ap->ys * (row + 1) - 3);
770 XDrawPoint(display, window, MI_GC(mi),
771 ap->xb + ap->xs * (col + 1) - 4,
772 ap->yb + ap->ys * (row + 1) - 3);
773 XDrawPoint(display, window, MI_GC(mi),
774 ap->xb + ap->xs * (col + 1) - 3,
775 ap->yb + ap->ys * (row + 1) - 4);
778 (void) fprintf(stderr, "wrong eyes direction %d for ant eyes\n", direction);
781 int orient = (col + row) % 2; /* O left 1 right */
785 if (!(ap->xs > 6 && ap->ys > 6))
787 tri.x = ap->xb + col * ap->xs;
788 tri.y = ap->yb + row * ap->ys;
790 tri.x += (ap->xs / 6 - 1);
792 tri.x -= (ap->xs / 6 - 1);
793 ang = direction * ap->neighbors / ANGLES;
794 /* approx... does not work that well for even numbers */
797 ap->neighbors == 9 ||
799 ap->neighbors == 12) {
800 #ifdef UNDER_CONSTRUCTION
801 /* Not sure why this does not work */
802 ang = ((ang + ap->neighbors / 6) / (ap->neighbors / 3)) % 3;
807 for (side = 0; side < 3; side++) {
809 tri.x += ap->shape.triangle[orient][side].x / 3;
810 tri.y += ap->shape.triangle[orient][side].y / 3;
812 /* Either you have the eyes in back or one eye in front */
815 XDrawPoint(display, window, MI_GC(mi), tri.x, tri.y);
817 if (side == (ang + 2) % 3)
818 XDrawPoint(display, window, MI_GC(mi), tri.x, tri.y);
819 if (side == (ang + 1) % 3)
820 XDrawPoint(display, window, MI_GC(mi), tri.x, tri.y);
832 antfarmstruct *ap = &antfarms[MI_SCREEN(mi)];
833 int row, col, mrow = 0;
835 for (row = 0; row < ap->nrows; ++row) {
836 for (col = 0; col < ap->ncols; ++col) {
837 ap->old[col + mrow] = (unsigned char) NRAND((int) ap->ncolors);
838 drawcell(mi, col, row, ap->old[col + mrow]);
847 fromTableDirection(unsigned char dir, int local_neighbors)
849 /* Crafted to work for odd number of neighbors */
854 return (ANGLES / local_neighbors);
856 return (2 * ANGLES / local_neighbors);
858 return ((local_neighbors / 2) * ANGLES / local_neighbors);
860 return (ANGLES - 2 * ANGLES / local_neighbors);
862 return (ANGLES - ANGLES / local_neighbors);
866 return (ANGLES + ANGLES / local_neighbors);
868 return (ANGLES + 2 * ANGLES / local_neighbors);
870 return (ANGLES + (local_neighbors / 2) * ANGLES / local_neighbors);
872 return (2 * ANGLES - 2 * ANGLES / local_neighbors);
874 return (2 * ANGLES - ANGLES / local_neighbors);
876 (void) fprintf(stderr, "wrong direction %d from table\n", dir);
882 getTable(ModeInfo * mi, int i)
884 antfarmstruct *ap = &antfarms[MI_SCREEN(mi)];
886 unsigned char *patptr;
888 patptr = &tables[i][0];
889 ap->ncolors = *patptr++;
890 ap->nstates = *patptr++;
891 total = ap->ncolors * ap->nstates;
892 if (MI_IS_VERBOSE(mi))
893 (void) fprintf(stdout,
894 "ants %d, neighbors %d, table number %d, colors %d, states %d\n",
895 ap->n, ap->neighbors, i, ap->ncolors, ap->nstates);
896 for (j = 0; j < total; j++) {
897 ap->machine[j].color = *patptr++;
898 if (ap->sharpturn && ap->neighbors > 4) {
929 ap->machine[j].direction = fromTableDirection(k, ap->neighbors);
931 ap->machine[j].direction = fromTableDirection(*patptr++, ap->neighbors);
933 ap->machine[j].next = *patptr++;
939 getTurk(ModeInfo * mi, int i)
941 antfarmstruct *ap = &antfarms[MI_SCREEN(mi)];
942 int power2, j, number, total;
944 /* To force a number, say <i = 2;> has i + 2 (or 4) binary digits */
945 power2 = 1 << (i + 1);
946 /* Do not want numbers which in binary are all 1's. */
947 number = NRAND(power2 - 1) + power2;
948 /* To force a particular number, say <number = 10;> */
952 total = ap->ncolors * ap->nstates;
953 for (j = 0; j < total; j++) {
954 ap->machine[j].color = (j + 1) % total;
955 if (ap->sharpturn && ap->neighbors > 4) {
956 ap->machine[j].direction = (power2 & number) ?
957 fromTableDirection(THRS, ap->neighbors) :
958 fromTableDirection(THLS, ap->neighbors);
960 ap->machine[j].direction = (power2 & number) ?
961 fromTableDirection(TRS, ap->neighbors) :
962 fromTableDirection(TLS, ap->neighbors);
964 ap->machine[j].next = 0;
967 ap->truchet = (ap->truchet && ap->xs > 2 && ap->ys > 2 &&
968 (ap->neighbors == 3 || ap->neighbors == 4 || ap->neighbors == 6));
969 if (MI_IS_VERBOSE(mi))
970 (void) fprintf(stdout,
971 "ants %d, neighbors %d, Turk's number %d, colors %d\n",
972 ap->n, ap->neighbors, number, ap->ncolors);
976 free_ant(ModeInfo * mi)
978 Display *display = MI_DISPLAY(mi);
979 antfarmstruct *ap = &antfarms[MI_SCREEN(mi)];
983 if (ap->stippledGC != None) {
984 XFreeGC(display, ap->stippledGC);
985 ap->stippledGC = None;
987 #endif /* DO_STIPPLE */
988 for (shade = 0; shade < ap->init_bits; shade++) {
989 XFreePixmap(display, ap->pixmaps[shade]);
992 if (ap->tape != NULL) {
993 (void) free((void *) ap->tape);
994 ap->tape = (unsigned char *) NULL;
996 if (ap->ants != NULL) {
997 (void) free((void *) ap->ants);
998 ap->ants = (antstruct *) NULL;
1000 if (ap->truchet_state != NULL) {
1001 (void) free((void *) ap->truchet_state);
1002 ap->truchet_state = (unsigned char *) NULL;
1007 init_ant(ModeInfo * mi)
1009 Display *display = MI_DISPLAY(mi);
1010 int size = MI_SIZE(mi);
1015 MI_INIT(mi, antfarms);
1016 /*if (antfarms == NULL) {
1017 if ((antfarms = (antfarmstruct *) calloc(MI_NUM_SCREENS(mi),
1018 sizeof (antfarmstruct))) == NULL)
1021 ap = &antfarms[MI_SCREEN(mi)];
1025 if (MI_NPIXELS(mi) <= 2) {
1026 Window window = MI_WINDOW(mi);
1027 if (ap->stippledGC == None) {
1030 gcv.fill_style = FillOpaqueStippled;
1031 if ((ap->stippledGC = XCreateGC(display, window,
1038 if (ap->init_bits == 0) {
1039 for (i = 1; i < NUMSTIPPLES; i++) {
1040 ANTBITS(stipples[i], STIPPLESIZE, STIPPLESIZE);
1044 #endif /* DO_STIPPLE */
1046 ap->n = MI_COUNT(mi);
1047 if (ap->n < -MINANTS) {
1048 /* if ap->n is random ... the size can change */
1049 if (ap->ants != NULL) {
1050 (void) free((void *) ap->ants);
1051 ap->ants = (antstruct *) NULL;
1053 ap->n = NRAND(-ap->n - MINANTS + 1) + MINANTS;
1054 } else if (ap->n < MINANTS)
1057 ap->width = MI_WIDTH(mi);
1058 ap->height = MI_HEIGHT(mi);
1060 for (i = 0; i < NEIGHBORKINDS; i++) {
1061 if (neighbors == plots[i]) {
1062 ap->neighbors = plots[i];
1065 if (i == NEIGHBORKINDS - 1) {
1067 /* Make above 6 rare */
1068 ap->neighbors = plots[NRAND(NEIGHBORKINDS)];
1070 ap->neighbors = plots[NRAND(GOODNEIGHBORKINDS)];
1076 if (ap->neighbors == 6) {
1083 if (size < -MINSIZE) {
1084 ap->ys = NRAND(MIN(-size, MAX(MINSIZE, MIN(ap->width, ap->height) /
1085 MINGRIDSIZE)) - MINSIZE + 1) + MINSIZE;
1086 if (ap->ys < MINRANDOMSIZE)
1087 ap->ys = MIN(MINRANDOMSIZE,
1088 MAX(MINSIZE, MIN(ap->width, ap->height) / MINGRIDSIZE));
1089 } else if (size < MINSIZE) {
1091 ap->ys = MAX(MINSIZE, MIN(ap->width, ap->height) / MINGRIDSIZE);
1095 ap->ys = MIN(size, MAX(MINSIZE, MIN(ap->width, ap->height) /
1098 nccols = MAX(ap->width / ap->xs - 2, 2);
1099 ncrows = MAX(ap->height / ap->ys - 1, 4);
1100 ap->ncols = nccols / 2;
1101 ap->nrows = 2 * (ncrows / 4);
1102 ap->xb = (ap->width - ap->xs * nccols) / 2 + ap->xs / 2;
1103 ap->yb = (ap->height - ap->ys * (ncrows / 2) * 2) / 2 + ap->ys - 2;
1104 for (i = 0; i < 6; i++) {
1105 ap->shape.hexagon[i].x = (ap->xs - 1) * hexagonUnit[i].x;
1106 ap->shape.hexagon[i].y = ((ap->ys - 1) * hexagonUnit[i].y / 2) * 4 / 3;
1108 /* Avoid array bounds read of hexagonUnit */
1109 ap->shape.hexagon[6].x = 0;
1110 ap->shape.hexagon[6].y = 0;
1111 } else if (ap->neighbors == 4 || ap->neighbors == 8) {
1112 if (size < -MINSIZE) {
1113 ap->ys = NRAND(MIN(-size, MAX(MINSIZE, MIN(ap->width, ap->height) /
1114 MINGRIDSIZE)) - MINSIZE + 1) + MINSIZE;
1115 if (ap->ys < MINRANDOMSIZE)
1116 ap->ys = MIN(MINRANDOMSIZE,
1117 MAX(MINSIZE, MIN(ap->width, ap->height) / MINGRIDSIZE));
1118 } else if (size < MINSIZE) {
1120 ap->ys = MAX(MINSIZE, MIN(ap->width, ap->height) / MINGRIDSIZE);
1124 ap->ys = MIN(size, MAX(MINSIZE, MIN(ap->width, ap->height) /
1127 ap->ncols = MAX(ap->width / ap->xs, 2);
1128 ap->nrows = MAX(ap->height / ap->ys, 2);
1129 ap->xb = (ap->width - ap->xs * ap->ncols) / 2;
1130 ap->yb = (ap->height - ap->ys * ap->nrows) / 2;
1138 if (size < -MINSIZE) {
1139 ap->ys = NRAND(MIN(-size, MAX(MINSIZE, MIN(ap->width, ap->height) /
1140 MINGRIDSIZE)) - MINSIZE + 1) + MINSIZE;
1141 if (ap->ys < MINRANDOMSIZE)
1142 ap->ys = MIN(MINRANDOMSIZE,
1143 MAX(MINSIZE, MIN(ap->width, ap->height) / MINGRIDSIZE));
1144 } else if (size < MINSIZE) {
1146 ap->ys = MAX(MINSIZE, MIN(ap->width, ap->height) / MINGRIDSIZE);
1150 ap->ys = MIN(size, MAX(MINSIZE, MIN(ap->width, ap->height) /
1152 ap->xs = (int) (1.52 * ap->ys);
1153 ap->ncols = (MAX(ap->width / ap->xs - 1, 2) / 2) * 2;
1154 ap->nrows = (MAX(ap->height / ap->ys - 1, 2) / 2) * 2;
1155 ap->xb = (ap->width - ap->xs * ap->ncols) / 2 + ap->xs / 2;
1156 ap->yb = (ap->height - ap->ys * ap->nrows) / 2 + ap->ys;
1157 for (orient = 0; orient < 2; orient++) {
1158 for (i = 0; i < 3; i++) {
1159 ap->shape.triangle[orient][i].x =
1160 (ap->xs - 2) * triangleUnit[orient][i].x;
1161 ap->shape.triangle[orient][i].y =
1162 (ap->ys - 2) * triangleUnit[orient][i].y;
1164 /* Avoid array bounds read of triangleUnit */
1165 ap->shape.triangle[orient][3].x = 0;
1166 ap->shape.triangle[orient][3].y = 0;
1170 XSetLineAttributes(display, MI_GC(mi), 1, LineSolid, CapNotLast, JoinMiter);
1172 ap->painted = False;
1174 if (MI_IS_FULLRANDOM(mi)) {
1175 ap->truchet = (Bool) (LRAND() & 1);
1176 ap->eyes = (Bool) (LRAND() & 1);
1177 ap->sharpturn = (Bool) (LRAND() & 1);
1179 ap->truchet = truchet;
1181 ap->sharpturn = sharpturn;
1183 if (!NRAND(NUMSTIPPLES)) {
1184 getTable(mi, (int) (NRAND(NTABLES)));
1186 getTurk(mi, (int) (NRAND(NUMSTIPPLES - 1)));
1187 if (MI_NPIXELS(mi) > 2)
1188 for (i = 0; i < (int) ap->ncolors - 1; i++)
1189 ap->colors[i] = (unsigned char) (NRAND(MI_NPIXELS(mi)) +
1190 i * MI_NPIXELS(mi)) / ((int) (ap->ncolors - 1));
1191 if (ap->ants == NULL) {
1192 if ((ap->ants = (antstruct *) malloc(ap->n * sizeof (antstruct))) ==
1198 if (ap->tape != NULL)
1199 (void) free((void *) ap->tape);
1200 if ((ap->tape = (unsigned char *) calloc(ap->ncols * ap->nrows,
1201 sizeof (unsigned char))) == NULL) {
1205 if (ap->truchet_state != NULL)
1206 (void) free((void *) ap->truchet_state);
1207 if ((ap->truchet_state = (unsigned char *) calloc(ap->ncols * ap->nrows,
1208 sizeof (unsigned char))) == NULL) {
1213 row = ap->nrows / 2;
1214 col = ap->ncols / 2;
1215 if (col > 0 && ((ap->neighbors % 2) || ap->neighbors == 12) && (LRAND() & 1))
1217 dir = NRAND(ap->neighbors) * ANGLES / ap->neighbors;
1220 if (ap->neighbors == 9 && !((col + row) & 1))
1221 dir = (dir + ANGLES - ANGLES / (ap->neighbors * 2)) % ANGLES;
1223 /* Have them all start in the same spot, why not? */
1224 for (i = 0; i < ap->n; i++) {
1225 ap->ants[i].col = col;
1226 ap->ants[i].row = row;
1227 ap->ants[i].direction = dir;
1228 ap->ants[i].state = 0;
1230 draw_anant(mi, dir, col, row);
1234 draw_ant(ModeInfo * mi)
1237 statestruct *status;
1238 int i, state_pos, tape_pos;
1239 unsigned char color;
1240 short chg_dir, old_dir;
1243 if (antfarms == NULL)
1245 ap = &antfarms[MI_SCREEN(mi)];
1246 if (ap->ants == NULL)
1249 MI_IS_DRAWN(mi) = True;
1251 for (i = 0; i < ap->n; i++) {
1252 anant = &ap->ants[i];
1253 tape_pos = anant->col + anant->row * ap->ncols;
1254 color = ap->tape[tape_pos]; /* read tape */
1255 state_pos = color + anant->state * ap->ncolors;
1256 status = &(ap->machine[state_pos]);
1257 drawcell(mi, anant->col, anant->row, status->color);
1258 ap->tape[tape_pos] = status->color; /* write on tape */
1260 /* Find direction of Bees or Ants. */
1261 /* Translate relative direction to actual direction */
1262 old_dir = anant->direction;
1263 chg_dir = (2 * ANGLES - status->direction) % ANGLES;
1264 anant->direction = (chg_dir + old_dir) % ANGLES;
1268 if (ap->neighbors == 6) {
1269 if (ap->sharpturn) {
1270 a = (((ANGLES + anant->direction - old_dir) % ANGLES) == 240);
1271 /* should be some way of getting rid of the init_dir dependency... */
1272 b = !(ap->init_dir % 120);
1273 a = ((a && !b) || (b && !a));
1274 drawtruchet(mi, anant->col, anant->row, status->color, a);
1276 a = (old_dir / 60) % 3;
1277 b = (anant->direction / 60) % 3;
1278 a = (a + b + 1) % 3;
1279 drawtruchet(mi, anant->col, anant->row, status->color, a);
1281 } else if (ap->neighbors == 4) {
1283 b = anant->direction / 180;
1284 a = ((a && !b) || (b && !a));
1285 drawtruchet(mi, anant->col, anant->row, status->color, a);
1286 } else if (ap->neighbors == 3) {
1288 a = (2 + anant->direction / 120) % 3;
1290 a = (1 + anant->direction / 120) % 3;
1291 drawtruchet(mi, anant->col, anant->row, status->color, a);
1293 ap->truchet_state[tape_pos] = a + 1;
1295 anant->state = status->next;
1297 /* Allow step first and turn */
1298 old_dir = ((status->direction < ANGLES) ? anant->direction : old_dir);
1300 (void) printf("old_dir %d, col %d, row %d", old_dir, anant->col, anant->row);
1302 position_of_neighbor(ap, old_dir, &(anant->col), &(anant->row));
1304 (void) printf(", ncol %d, nrow %d\n", anant->col, anant->row);
1306 draw_anant(mi, anant->direction, anant->col, anant->row);
1308 if (++ap->generation > MI_CYCLES(mi)) {
1311 if (ap->redrawing) {
1312 for (i = 0; i < REDRAWSTEP; i++) {
1313 if (ap->tape[ap->redrawpos] ||
1314 (ap->truchet && ap->truchet_state[ap->redrawpos])) {
1315 drawcell(mi, ap->redrawpos % ap->ncols, ap->redrawpos / ap->ncols,
1316 ap->tape[ap->redrawpos]);
1318 drawtruchet(mi, ap->redrawpos % ap->ncols, ap->redrawpos / ap->ncols,
1319 ap->tape[ap->redrawpos],
1320 ap->truchet_state[ap->redrawpos] - 1);
1322 if (++(ap->redrawpos) >= ap->ncols * ap->nrows) {
1332 refresh_ant(ModeInfo * mi)
1336 if (antfarms == NULL)
1338 ap = &antfarms[MI_SCREEN(mi)];
1348 XSCREENSAVER_MODULE ("Ant", ant)
1350 #endif /* MODE_ant */