/
ORIGINAL_POST.TXT
1639 lines (1634 loc) · 36.4 KB
/
ORIGINAL_POST.TXT
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
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watmath!clyde!cbosgd!ucbvax!ucbcad!ames!ll-xn!husc6!mit-eddie!uw-beaver!tektronix!tekgen!tekred!games-request
From: games-request@tekred.UUCP
Newsgroups: comp.sources.games
Subject: v01i080: robots2 - Game of robots, version 2
Message-ID: <1380@tekred.TEK.COM>
Date: Wed, 8-Jul-87 17:47:06 EDT
Article-I.D.: tekred.1380
Posted: Wed Jul 8 17:47:06 1987
Date-Received: Sat, 11-Jul-87 14:03:12 EDT
Sender: billr@tekred.TEK.COM
Lines: 1625
Approved: billr@tekred.TEK.COM
Submitted by: Julian Onions <jpo@cs.nott.ac.uk>
Comp.sources.games: Volume 1, Issue 80
Archive-name: robots2
[Compiled and ran OK on our 4.3bsdBeta Vax. -br]
[[An upgraded version of the robots game. Should work on sys5 as well as
4.2/3 although not test rigorously. The README/manual page
describes most of the interesting stuff.
I can be reached as either
jpo@cs.nott.ac.uk
jpo%cs.nott.ac.uk@ucl-cs.arpa
...!seismo!mcvax!ukc!nott-cs!jpo - least preferable.
Julian]]
-----------------------
#! /bin/sh
# This is a shell archive. Remove anything before this line, then unpack
# it by saving it into a file and typing "sh file". To overwrite existing
# files, type "sh file -c". You can also feed this as standard input via
# unshar, or by typing "sh <file", e.g.. If this archive is complete, you
# will see the following message at the end:
# "End of shell archive."
# Contents: READ_ME Makefile good.c main.c makelog opt.c robot.c
# robots.6 robots.h score.c user.c
# Wrapped by billr@tekred on Wed Jul 8 14:40:28 1987
PATH=/bin:/usr/bin:/usr/ucb ; export PATH
if test -f READ_ME -a "${1}" != "-c" ; then
echo shar: Will not over-write existing file \"READ_ME\"
else
echo shar: Extracting \"READ_ME\" \(1371 characters\)
sed "s/^X//" >READ_ME <<'END_OF_READ_ME'
XRobots - version 2
X
XThis version has several features over the original version but is
Xstill very much in the same spirit. Amongst the new features are
X
X- Fast robots, these are robots that move at twice the speed of
X normal robots.
X- Option settings in the style of rogue.
X- movable scrap heaps.
X- random & safe teleports with the ability to choose.
X- antimatter
X
XTo build.
XIt should build on most sane systems,
XYou may want to play with some of the variables in Makefile, there
Xare a couple of version specific things to look for.
XIf you are on a BSD4.2 or better system add -DBSD42 to the CFLAGS
Xin the Makefile.
XSystem 5 may need to remove -ltermcap from the LIBS line in Makefile.
XAlso if BSD42 is not defined, the score directory needs to be
Xwritable to lock the files.
XYou may want to play with the location of the high score files which
Xare #defined near the begining of robots.h.
X
XType make, make install, and enjoy.
X
XBugs, comments, flames, offers of cash, aston martins to those below
X Julian Onions <jpo@cs.nott.ac.uk>
X Graeme Lunt <gal@cs.nott.ac.uk>
X Allan Black <allan@cs.strath.ac.uk>
X
XStop Press:
X Also available from jpo@cs.nott.ac.uk, a version of robomatic
X which does a reasonable job of playing the game of robots.
X Current high scores are -
X
X 1 482538104 Graeme (gal): eaten on level 85.
X 6 8476863 Robomatic II (jpo): eaten on level 23.
END_OF_READ_ME
if test 1371 -ne `wc -c <READ_ME`; then
echo shar: \"READ_ME\" unpacked with wrong size!
fi
# end of overwriting check
fi
if test -f Makefile -a "${1}" != "-c" ; then
echo shar: Will not over-write existing file \"Makefile\"
else
echo shar: Extracting \"Makefile\" \(979 characters\)
sed "s/^X//" >Makefile <<'END_OF_Makefile'
X# just -lcurses for SYS V
XLIBS = -lcurses -ltermcap
X# add -DBSD42 for performance wins on 4.2 or better
XIFDEF = -DBSD42
XCFLAGS = $(IFDEF) #-g
XLINT = lint
XLLFLAGS = -haxbc
XSHAR = shar
XSHFLGS = -v -c
XHEADERS = robots.h
XSRC = good.c main.c opt.c robot.c score.c user.c
XOBJS = good.o main.o opt.o robot.o score.o user.o
XMAN = robots.6
XMISC = READ_ME Makefile
XDIST = $(MISC) $(SRC) $(MAN) $(HEADERS)
XMANUAL = /usr/man/man6/robots.6 # where the manual page goes
XBINARY = /usr/sheriff/jpo/games # Where the binary goes
X
Xrobots: ${OBJS}
X $(CC) $(CFLAGS) -o $@ ${OBJS} $(LIBS)
X
Xinstall: robots robots.6
X install -s robots $(BINARY) # or strip robots && mv robots $(BINARY)
X# install -c robots.6 $(MANUAL) # or cp robots.6 $(MANUAL)
X
Xtidy: clean
Xclean:
X rm -f ${OBJS} core a.out lint.out shar.out
X
Xclobber: clean
X rm -f robots
X
Xlint: ${SRC} $(HEADERS)
X $(LINT) $(LLFLAGS) $(IFDEF) ${SRC} $(LIBS)
X
Xshar: shar.out
Xshar.out: $(DIST)
X $(SHAR) $(SHFLGS) $(DIST) > $@
X
X${OBJS}: ${HEADERS}
END_OF_Makefile
if test 979 -ne `wc -c <Makefile`; then
echo shar: \"Makefile\" unpacked with wrong size!
fi
# end of overwriting check
fi
if test -f good.c -a "${1}" != "-c" ; then
echo shar: Will not over-write existing file \"good.c\"
else
echo shar: Extracting \"good.c\" \(2907 characters\)
sed "s/^X//" >good.c <<'END_OF_good.c'
X# include "robots.h"
X
X/*
X * good.c: Figure out all possible good moves.
X * This piece of code use to be trivial - then fast robots came
X * and moveable heaps and its now an AI expert system in its own right!
X */
X
Xgood_moves ()
X{
X register int test_x, test_y;
X register char *m, *a;
X static char moves[] = "hjklyubn.a";
X static char ans[sizeof (moves)];
X char savebuf[9], savechar;
X int i,j, notsilly;
X
X a = ans;
X for(m = moves; *m != 'a'; m++) {
X test_x = my_x+xinc(*m);
X test_y = my_y+yinc(*m);
X move(test_y,test_x);
X switch(inch()) {
X case ' ':
X case DOT:
X case ME:
X if( isgood(test_y, test_x) )
X *a++ = *m;
X break;
X case SCRAP:
X if (moveable_heaps) {
X int nscrap_x,nscrap_y;
X nscrap_x = test_x +xinc(*m);
X nscrap_y = test_y +yinc(*m);
X move(nscrap_y,nscrap_x);
X if (inch() == ' ') {
X addch(SCRAP);
X if (isgood(test_y,test_x))
X *a++ = *m;
X move(nscrap_y,nscrap_x);
X addch(' ');
X }
X }
X break;
X }
X }
X /* now lets do the antimatter case */
X if (free_teleports) {
X notsilly = 0; /* silly to do it if not get robots */
X for(i= -1;i <= 1; i++)
X for(j= -1; j<= 1; j++) {
X move(my_y+i,my_x+j);
X savechar = inch();
X if (savechar == FROBOT || savechar == ROBOT) {
X savebuf[ (i+1)*3 +j +1] = savechar;
X addch(' ');
X notsilly = 1;
X }
X else
X savebuf[ (i+1)*3 +j +1] = ' ';
X }
X if( notsilly && isgood(my_y,my_x) )
X *a++ = *m;
X
X for(i= -1;i <= 1; i++)
X for(j= -1; j<= 1; j++) {
X move(my_y+i,my_x+j);
X savechar = savebuf[ (i+1)*3 +j +1];
X if (savechar == FROBOT || savechar == ROBOT)
X addch(savechar);
X }
X }
X *a = 0;
X if(ans[0]) {
X a = ans;
X } else {
X a = "Forget it!";
X }
X mvprintw(LINES-1,MSGPOS,"%-*.*s",RVPOS-MSGPOS,RVPOS-MSGPOS,a);
X}
X
Xisgood(ty,tx)
Xregister int tx, ty;
X{
X register int x, y;
X
X for(x = -2; x <= 2; x++) {
X for(y = -2; y <= 2; y++) {
X if ( abs(x) > 1 || abs(y) > 1 ) { /* we are 2 steps out */
X if( blocked(ty, tx, y, x))
X continue;
X move(ty+y,tx+x);
X if ( abs(x) == 2 && abs(y) == 2
X && inch() == FROBOT){
X return FALSE; }
X if ( x == -1 && scan(ty+y, tx+x, 0, 1) )
X return FALSE;
X if ( y == -1 && scan(ty+y, tx+x, 1, 0) )
X return FALSE;
X } /* outer perimeter checked */
X else {
X move(ty+y,tx+x);
X switch(inch()) {
X case FROBOT:
X case ROBOT: /* robot next to you */
X return FALSE;
X }
X }
X }
X }
X return TRUE;
X}
X
Xscan(y, x, yi, xi) /* scan along this line looking for collision conditions */
Xint x, y, xi, yi;
X{
X int rcount = 0;
X register int ctr;
X
X for(ctr = 0;ctr<=2;ctr++) {
X move(y + (ctr*yi), x + (ctr*xi));
X switch(inch()) {
X case FROBOT:
X rcount += 4;
X break;
X case ROBOT:
X rcount ++;
X break;
X }
X }
X return rcount == 4;
X}
X
Xblocked(my, mx, y, x)
Xregister int my, mx, y, x;
X{
X if ( x < 0 ) x++;
X if ( y < 0 ) y++;
X if ( x > 0 ) x--;
X if ( y > 0 ) y--;
X move(my+y, mx+x);
X return inch() == SCRAP;
X}
END_OF_good.c
if test 2907 -ne `wc -c <good.c`; then
echo shar: \"good.c\" unpacked with wrong size!
fi
# end of overwriting check
fi
if test -f main.c -a "${1}" != "-c" ; then
echo shar: Will not over-write existing file \"main.c\"
else
echo shar: Extracting \"main.c\" \(6448 characters\)
sed "s/^X//" >main.c <<'END_OF_main.c'
X/*
X * R O B O T S
X *
X * The game of robots.
X * History:
X * Original Implementation
X * Allan Black <allan@cs.strath.ac.uk>
X * Updated for fast robots, moveable heaps, ROBOTOPTS
X * antimatter, v7/sys5/4.2 portability etc.
X * Graeme Lunt <gal@cs.nott.ac.uk>
X * Julian Onions <jpo@cs.nott.ac.uk>
X *
X * Provided free as long as you don't make money from it!
X */
X
X# include "robots.h"
X
Xchar whoami[MAXSTR];
Xchar my_user_name[MAXSTR];
Xchar cmd_ch;
X
Xbool dead = FALSE;
Xbool last_stand;
Xbool show_highscore = TRUE;
Xbool running, adjacent, first_move, bad_move, waiting;
Xbool moveable_heaps = TRUE;
X
Xint my_x, my_y;
Xint new_x, new_y;
Xint level = 0;
Xint free_teleports = 0;
Xint old_free;
Xint free_per_level = 1;
Xint count;
Xint dots = 0;
Xint robot_value = MIN_VALUE;
Xint max_robots = MIN_ROBOTS;
Xint nrobots_alive;
Xint scrap_heaps = 1; /* to allow for first level */
X
Xlong score = 0;
Xlong seed;
X
X# ifdef TIOCSLTC
Xstruct ltchars ltc;
Xchar dsusp;
X# endif TIOCSLTC
X
Xint interrupt();
X
X# define TERM_UNINIT 00
X# define TERM_CURSES 01
X# define TERM_LTC 02
X
Xint term_state = TERM_UNINIT; /* cuts out some race conditions */
Xchar *getenv();
Xstruct passwd *getpwuid();
Xchar _obuf[BUFSIZ];
X
Xmain(argc,argv)
X int argc;
X char *argv[];
X{
X register struct passwd *pass;
X register char *x;
X int i;
X
X setbuf(stdout, _obuf);
X if(argc > 1) {
X if(argv[1][0] == '-') {
X switch(argv[1][1]) {
X case 's':
X show_highscore = TRUE;
X scoring(FALSE);
X exit(0);
X }
X }
X }
X if((pass = getpwuid(getuid())) == 0) {
X x = "ANON";
X } else {
X x = pass->pw_name;
X }
X (void) strcpy(my_user_name, x);
X (void) strcpy(whoami,x);
X if((x = getenv(ROBOTOPTS)) != NULL && *x != '\0')
X get_robot_opts(x);
X seed = time((time_t *)0)+getuid();
X (void) signal(SIGQUIT,interrupt);
X (void) signal(SIGINT,interrupt);
X if( initscr() == ERR) {
X fprintf(stderr, "Curses won't initialise - seek a guru\n");
X quit(FALSE);
X }
X term_state |= TERM_CURSES;
X crmode();
X noecho();
X# ifdef TIOCSLTC
X (void) ioctl(1,TIOCGLTC,<c);
X dsusp = ltc.t_dsuspc;
X ltc.t_dsuspc = ltc.t_suspc;
X (void) ioctl(1,TIOCSLTC,<c);
X term_state |= TERM_LTC;
X# endif TIOCSLTC
X for(;;) {
X count = 0;
X running = FALSE;
X adjacent = FALSE;
X waiting = FALSE;
X last_stand = FALSE;
X old_free = -1;
X if(rnd(free_per_level) < free_teleports) {
X free_per_level++;
X if(free_per_level > MAX_FREE) free_per_level = MAX_FREE;
X }
X free_teleports += free_per_level;
X leaveok(stdscr,FALSE);
X draw_screen();
X put_robots();
X do {
X my_x = rndx();
X my_y = rndy();
X move(my_y,my_x);
X } while(inch() != ' ');
X addch(ME);
X for(;;) {
X scorer();
X if(nrobots_alive == 0) break;
X command();
X for(i=1;i<=FASTEST;i++)
X robots(i);
X if(dead) munch();
X }
X msg("%d robots are now %d scrap heaps",max_robots, scrap_heaps);
X leaveok(stdscr,FALSE);
X move(my_y,my_x);
X refresh();
X (void) readchar();
X level++;
X }
X}
X
Xdraw_screen()
X{
X register int x, y;
X clear();
X for(y = 1; y < LINES-2; y++) {
X mvaddch(y,0,VERT);
X mvaddch(y,COLS-1,VERT);
X }
X for(x = 0; x < COLS; x++) {
X mvaddch(0,x,HORIZ);
X mvaddch(LINES-2,x,HORIZ);
X }
X}
X
Xreadchar()
X{
X static char buf[1];
X extern int errno;
X
X while(read(0,buf,1) != 1)
X if( errno != EINTR)
X quit(TRUE);
X return(buf[0]);
X}
X
Xput_dots()
X{
X register int x, y;
X for(x = my_x-dots; x <= my_x+dots; x++) {
X for(y = my_y-dots; y <= my_y+dots; y++) {
X move(y,x);
X if(inch() == ' ') addch(DOT);
X }
X }
X}
X
Xerase_dots()
X{
X register int x, y;
X for(x = my_x-dots; x <= my_x+dots; x++) {
X for(y = my_y-dots; y <= my_y+dots; y++) {
X move(y,x);
X if(inch() == DOT) addch(' ');
X }
X }
X}
X
Xxinc(dir)
X char dir;
X{
X switch(dir) {
X case 'h':
X case 'y':
X case 'b':
X return(-1);
X case 'l':
X case 'u':
X case 'n':
X return(1);
X case 'j':
X case 'k':
X default:
X return(0);
X }
X}
X
Xyinc(dir)
X char dir;
X{
X switch(dir) {
X case 'k':
X case 'y':
X case 'u':
X return(-1);
X case 'j':
X case 'b':
X case 'n':
X return(1);
X case 'h':
X case 'l':
X default:
X return(0);
X }
X}
X
Xmunch()
X{
X scorer();
X msg("MUNCH! You're robot food");
X leaveok(stdscr,FALSE);
X mvaddch(my_y,my_x,MUNCH);
X move(my_y,my_x);
X refresh();
X (void) readchar();
X quit(TRUE);
X}
X
Xquit(eaten)
X bool eaten;
X{
X if( term_state & TERM_CURSES ) {
X move(LINES-1,0);
X refresh();
X endwin();
X term_state &= ~ TERM_CURSES;
X }
X putchar('\n');
X# ifdef TIOCSLTC
X if( term_state & TERM_LTC ) {
X ltc.t_dsuspc = dsusp;
X (void) ioctl(1,TIOCSLTC,<c);
X term_state &= ~ TERM_LTC;
X }
X# endif TIOCSLTC
X (void) signal(SIGINT, SIG_DFL);
X scoring(eaten);
X exit(0);
X}
X
Xrndx()
X{
X return(rnd(COLS-2)+1);
X}
X
Xrndy()
X{
X return(rnd(LINES-3)+1);
X}
X
Xrnd(mod)
X int mod;
X{
X if(mod <= 0) return(0);
X return((((seed = seed*11109L+13849L) >> 16) & 0xffffL) % mod);
X}
X
X/* VARARGS 1 */
Xmsg(message,a1, a2, a3, a4, a5, a6, a7)
X char *message;
X unsigned int a1, a2, a3, a4, a5, a6, a7;
X{
X static char msgbuf[1000];
X
X (void) sprintf(msgbuf, message, a1, a2, a3, a4, a5, a6, a7);
X mvaddstr(LINES-1,MSGPOS,msgbuf);
X clrtoeol();
X refresh();
X}
X
Xinterrupt()
X{
X quit(FALSE);
X}
X
X/*
X * file locking routines - much nicer under BSD ...
X */
X
X# ifdef BSD42
Xlk_open(file, mode) /* lock a file using the flock sys call */
Xchar *file;
Xint mode;
X{
X int fd;
X
X if( (fd = open(file, mode)) < 0)
X return -1;
X if( flock(fd, LOCK_EX) < 0)
X {
X (void) close(fd);
X return -1;
X }
X return fd;
X}
X
Xlk_close( fd, file)
Xint fd;
Xchar *file;
X{
X# ifdef lint
X file = file; /* now will you shut up lint???? */
X# endif
X return close(fd);
X}
X# else
X
X# define LOCKTIME (60) /* 1 minute */
X# include <sys/stat.h>
X
Xlk_open(file, mode) /* lock a file by crude means */
Xchar *file;
Xint mode;
X{
X char tfile[128], lfile[128];
X struct stat stbuf;
X time_t now;
X int fd;
X
X (void) sprintf(tfile, "%s.t", file); /* temp file */
X (void) sprintf(lfile, "%s.l", file); /* lock file */
X
X if( close(creat(tfile, 0)) < 0) /* make temp file */
X return -1;
X while( link(tfile, lfile) == -1) /* now attempt the lock file */
X {
X if( stat(lfile, &stbuf) < 0)
X continue; /* uhh? -- try again */
X time(&now);
X /* OK - is this file old? */
X if( stbuf.st_mtime + LOCKTIME < now)
X unlink(lfile); /* ok its old enough - junk it */
X else sleep(1); /* snooze ... */
X }
X unlink(tfile); /* tmp files done its job */
X if((fd = open(file, mode)) < 0) {
X unlink(lfile);
X return -1;
X }
X return fd;
X}
X
Xlk_close(fd, fname)
Xint fd;
Xchar *fname;
X{
X char lfile[128];
X
X (void) sprintf(lfile, "%s.l", fname); /* recreate the lock file name */
X if( unlink(lfile) == -1) /* blow it away */
X perror(lfile);
X return close(fd);
X}
X# endif
X
END_OF_main.c
if test 6448 -ne `wc -c <main.c`; then
echo shar: \"main.c\" unpacked with wrong size!
fi
# end of overwriting check
fi
if test -f makelog -a "${1}" != "-c" ; then
echo shar: Will not over-write existing file \"makelog\"
else
echo shar: Extracting \"makelog\" \(217 characters\)
sed "s/^X//" >makelog <<'END_OF_makelog'
Xcc -DBSD42 -c good.c
Xcc -DBSD42 -c main.c
Xcc -DBSD42 -c opt.c
Xcc -DBSD42 -c robot.c
Xcc -DBSD42 -c score.c
Xcc -DBSD42 -c user.c
Xcc -DBSD42 -o robots good.o main.o opt.o robot.o score.o user.o -lcurses -ltermcap
END_OF_makelog
if test 217 -ne `wc -c <makelog`; then
echo shar: \"makelog\" unpacked with wrong size!
fi
# end of overwriting check
fi
if test -f opt.c -a "${1}" != "-c" ; then
echo shar: Will not over-write existing file \"opt.c\"
else
echo shar: Extracting \"opt.c\" \(1651 characters\)
sed "s/^X//" >opt.c <<'END_OF_opt.c'
X# include "robots.h"
X
X/*
X * opt.c: do a psuedo ROGUEOPTS sort of thing
X */
X
Xtypedef struct Opt {
X char *name;
X int type;
X} Opt;
X
XOpt options[] = {
X# define OPT_NAME 1
X "name", OPT_NAME, /* Who am i boss ? */
X# define OPT_MOVE_HEAP 2
X "moveheaps", OPT_MOVE_HEAP, /* can push heaps */
X# define OPT_NOMOVE_HEAP 3
X "nomoveheaps", OPT_NOMOVE_HEAP,/* can't push heaps */
X# define OPT_SHOW_HSCORE 4
X "showhscore", OPT_SHOW_HSCORE,
X# define OPT_NOSHOW_HSCORE 5
X "noshowhscore", OPT_NOSHOW_HSCORE,
X 0, 0
X};
X
X/* get_robot_opts: Personalise robots to the users tastes. Model after
X * the rogue/urogue type environment stuff.
X */
X
Xget_robot_opts(str)
Xchar *str;
X{
X register char *p;
X Opt *op;
X int len, len2;
X
X p = str;
X while(*p)
X {
X while(*p && !isalpha(*p)) p++; /* skip non-alphas */
X str = p;
X
X while(isalpha(*p)) p ++; /* match longest word */
X len = p - str;
X
X for(op = options; op->name; op ++) /* see if defined */
X if( strncmp(str, op->name, len) == 0)
X break;
X if( op->name == NULL)
X continue;
X switch(op->type) /* OK, now do something */
X {
X case OPT_NAME:
X while(*p == '=') p++; /* skip ='s */
X str = p; /* OK, now look for name */
X while(*p && *p != ',') p++;
X len2 = (MAXSTR - 1) -
X (strlen(my_user_name) + 4);
X len = p - str;
X len = len < len2 ? len : len2;
X (void) sprintf(whoami, "%.*s (%s)", len,
X str, my_user_name);
X break;
X case OPT_MOVE_HEAP:
X moveable_heaps = TRUE;
X break;
X case OPT_NOMOVE_HEAP:
X moveable_heaps = FALSE;
X break;
X case OPT_SHOW_HSCORE:
X show_highscore = TRUE;
X break;
X case OPT_NOSHOW_HSCORE:
X show_highscore = FALSE;
X break;
X }
X }
X}
X
END_OF_opt.c
if test 1651 -ne `wc -c <opt.c`; then
echo shar: \"opt.c\" unpacked with wrong size!
fi
# end of overwriting check
fi
if test -f robot.c -a "${1}" != "-c" ; then
echo shar: Will not over-write existing file \"robot.c\"
else
echo shar: Extracting \"robot.c\" \(3145 characters\)
sed "s/^X//" >robot.c <<'END_OF_robot.c'
X# include "robots.h"
X
X/*
X * robot.c: most of the robot oriented stuff
X */
X
Xstruct robot {
X bool alive; /* is this suker still kicking */
X int x;
X int y;
X int speed; /* speed of robot 1 or 2 for now */
X} rbt_list[MAX_ROBOTS+1];
X
Xput_robots() /* place some robots */
X{
X register struct robot *r, *end;
X register int x, y;
X
X robot_value += level*(5 + (max_robots/scrap_heaps));
X max_robots += level*3+rnd(level*5);
X if(max_robots > MAX_ROBOTS) max_robots = MAX_ROBOTS;
X nrobots_alive = max_robots;
X scrap_heaps = 0; /* number of scrap heaps created */
X end = &rbt_list[max_robots];
X for(r = rbt_list; r < end; r++) {
X for(;;) {
X x = rndx();
X y = rndy();
X move(y,x);
X if(inch() == ' ') break;
X }
X r->x = x;
X r->y = y;
X r->alive = TRUE;
X r->speed = 1 + ( rnd(10) > 6 );
X if (r->speed == 2) addch(FROBOT);
X else addch(ROBOT);
X }
X}
X
Xrobots(speed) /* Troops, Troooooops advance! */
Xint speed;
X{
X register struct robot *r, *end;
X
X end = &rbt_list[max_robots];
X for(r = rbt_list; r < end; r++) {
X if(r->alive && r->speed >= speed ) {
X mvaddch(r->y,r->x,' ');
X }
X }
X for(r = rbt_list; r < end; r++) {
X if (r->alive && r->speed >= speed )
X {
X r->x += sign(my_x-r->x);
X r->y += sign(my_y-r->y);
X move(r->y,r->x);
X switch(inch()) {
X case ME: /* robot eat me */
X addch(MUNCH);
X dead = TRUE;
X break;
X case SCRAP: /* robot walks into scrap heap */
X r->alive = FALSE;
X if(r->speed == 2)
X score += (MULT * robot_value);
X else score += robot_value;
X nrobots_alive--;
X break;
X case FROBOT:
X case ROBOT: /* two robots form scrap heap */
X collision(r, end);
X r->alive = FALSE;
X addch(SCRAP);
X if (r->speed == 2)
X score += (MULT * robot_value);
X else score += robot_value;
X nrobots_alive -= 2;
X scrap_heaps++ ;
X break;
X case MUNCH:
X break;
X default:
X if(r->speed == 2) addch(FROBOT);
X else addch(ROBOT);
X }
X }
X }
X}
X
X/* do two robots collide - if so - which two */
Xcollision(r, end)
Xregister struct robot *r, *end;
X{
X register struct robot *find;
X
X for(find = rbt_list; find < end; find++) {
X if(find->alive && r != find) {
X if(r->x == find->x && r->y == find->y) {
X find->alive = FALSE;
X if (find->speed == 2)
X score += (MULT * robot_value);
X else score += robot_value;
X return;
X } /* end of if */
X }
X }
X}
X
Xscrewdriver() /* dismantle those robots ... */
X{
X register int test_x, test_y;
X register char *m ;
X register struct robot *end,*find;
X static char moves[] = "hjklyubn.";
X
X end = &rbt_list[max_robots];
X
X for(m = moves; *m; m++) { /* let's see if there is a robot */
X test_x = my_x+xinc(*m);
X test_y = my_y+yinc(*m);
X move(test_y,test_x);
X switch(inch()) {
X case FROBOT:
X case ROBOT: /* OK so there is now let's look for it */
X for(find = rbt_list; find < end; find++) {
X if(find->alive) {
X if(test_x == find->x && test_y == find->y) {
X find->alive = FALSE;
X if (find->speed == 2) score += (MULT * robot_value);
X else score += robot_value;
X } /* end of if */
X } /* end of if */
X } /* end of for */
X addch(' ');
X nrobots_alive--;
X break;
X } /* end of case */
X }
X free_teleports--;
X}
END_OF_robot.c
if test 3145 -ne `wc -c <robot.c`; then
echo shar: \"robot.c\" unpacked with wrong size!
fi
# end of overwriting check
fi
if test -f robots.6 -a "${1}" != "-c" ; then
echo shar: Will not over-write existing file \"robots.6\"
else
echo shar: Extracting \"robots.6\" \(3170 characters\)
sed "s/^X//" >robots.6 <<'END_OF_robots.6'
X.TH ROBOTS 6 "2 November 1984"
X.SH NAME
Xrobots \- a game of logic
X.SH SYNOPSIS
X.B /usr/games/robots [-s]
X.SH DESCRIPTION
X.B Robots
Xis a display-based game which must be played on a CRT terminal
Xfrom among those supported by vi(1).
XThe object of the game is to avoid the robots:
Xcausing them to collide with each other, creating a
X.IR scrap\ heap .
XRobots are also destroyed if they run into a
X.IR scrap\ heap .
X.PP
XYou are represented on the screen by an I.
XThe robots are represented by `=' and `#' signs.
XScrap heaps are represented by `@' signs.
XAfter each move, all robots move one step towards you except for
Xthe `#' robots which move at twice the speed of normal robots.
X.PP
XThe following commands are recognized:
X.IP h
XMove left.
X.IP l
XMove right.
X.IP j
XMove down.
X.IP k
XMove up.
X.IP y
XMove up and left.
X.IP u
XMove up and right.
X.IP b
XMove down and left.
X.IP n
XMove down and right.
X.IP .
X.IP w
XDo nothing.
X.IP t
XTeleport to a safe square if possible (limited in number).
X.IP r
XTeleport to a random position.
X.IP a
XAntimatter, all robots one square away from you vanish.
X.IP s
X.IP W
XSit and watch.
X.IP d
XDisplay dots.