-
Notifications
You must be signed in to change notification settings - Fork 0
/
gpg.cpp
1689 lines (1583 loc) · 48.9 KB
/
gpg.cpp
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
/*
Copyright (C) 1993 Dunbar Aitken
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
Glass Plate Game DOS Copyright (C) 1993 Dunbar Aitken
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
*/
/* +++++++++++++++++++++++
File: GPG.CPP Version 39 revised August 3, 1993
++++++++++++++++++++++++++ */
#include <stdio.h>
#include <string.h>
#include <conio.h>
#include <assert.h>
#include <ctype.h>
#include <stdlib.h>
/* variable type and variable declarations */
/* =====================================================================
The game uses cubes whose record here contains the roster number of the
player originally placing it. Also in the record: a number indicates the
card on which it was placed; a number notes the chain of thought (color) it
extended; a number notes the face to which it was last turned (state); and a
number shows the cube from which it extended the chain or branched. The
cubes themselves have the lettered sides, "C", "P", and "O", and a blank
side, "void", showing by which side is facing upwards (its current "state)".
There are 24 cubes, numbered for bringing them into use consecutively.
======================================================================== */
#define allowed 1
#define disallowed 0
typedef struct
{
int player;
int card;
int color;
int state;
int from_what_cube;
int player_p_c;
int player_o_v;
char comment1a[81], comment1b[81], comment1c[81];
char comment2a[81], comment2b[81];
char comment3a[81];
} cube_status;
char sure;
char * gifs[41] = {"none", "Ambivalence", "Anthropomorphism",
"Art vs. Nature","fundamental Theorem of Calculus", "City as Artifact",
"Coding", "Contemplation","Creation","Education",
"Emotional Manipulation", "Freedom", "Gestalt", "harmony", "Struggle",
"Hidden Potential", "Intuition", "Joy", "Magic",
"Multiplication of Mechanical Advantage", "metamorphosis","Monetary Value",
"Myth", "Nature Tending Towards Perfection",
"Ontogeny Recapitulating Phylogeny", "Perspective",
"Reaching out / Trying", "Return", "Society as Active / Passive Hierarchy",
"Structural Strength", "Structured Improvisation", "Struggle", "Synergy",
"syntax", "Unwanted Relationships", "Wavicle", "...", "...", "...", "..."};
char * gifs2[41] = {"Ambivalenz","Anthropomorphismus","Kunst und Natur",
"Unerwnschte Verbindungen","Die Stadt als Kunstwerk","Coding",
"Kontemplation","Sch\"pfung","Ausbildung","Gefhlmanipulation",
"Freiheit","Gestalt","Harmonie","Kampf","Versteckte M\"glichkeiten",
"Intuition","Freude","Magik","Multiplikation des mechanishen Vorteils",
"Metamorphose","Geldwert","Mythen","Natur entwickelt sich zur Perfektion",
"Ontogenie wiederholt Phylogenie","Perspektive",
"Sich ausstrecken","Rckkehr","...","St„rke der Struktur",
"Strukturelle Improvisation","...","Synergetik","Syntax","...",
"Welle-Teilchen Dualismus"};
int i, j, k, l, m, players, disk_choice, keep_playing;
int stats = 1;
int cube_of_move = 1;
int previous_player = 0;
int ruling, move_request;
int request_cnt = 0;
char line_response[10],
previous_of_color[5] = {0, 0, 0, 0, 0};
typedef cube_status cubes_status[25];
cubes_status cubes, cubes2, moves;
const char side[6] = {'#','p','c','o',' '};
const char hue[6] = {'r','b','g','y','o'};
const char action[8] = {'-','s','x','b','p','c','o','v'};
char * gif_e;
char * gif_g;
char moves_screen[80*24*2];
char card_list[80*24*2];
char * filenames[3] = {"A:REPLAY", "B:REPLAY.TXT", "C:REPLAY.TXT"};
char str_response[10];
char comment[260];
char language;
int is_replay = 0;
int replay_cube = 1;
int turnings_for_cube = 0;
int next_turning = 0;
int get_Move();
int rule_on_move(int, int, int, int, int, int, int);
void update(int, int, int, int, int, int);
int get1char( char *);
int get1int(char *);
void store_transcript( cubes_status &moves, char * filename);
void get_transcript( cubes_status &moves, char * filename);
void print_cards(char language);
void menue_or_not(char * response, int language_mnot);
void get_comment(int, int);
void clrscr();
int
gettext (int left, int top, int right, int bottom,
char *str);
void
puttext (int left, int top, int right, int bottom, char *str);
/* end of global declarations; beginning of function bodies */
int main()
{
char response_mn = 'z';
clrscr();
do {
response_mn = get1char("Which language? German or English (G/E)");
sure = get1char("Are you sure? ");
}
while ((response_mn != 'g') && (response_mn != 'e') &&
(response_mn !='G') && (response_mn != 'E') &&
(sure != 'Y') && (sure != 'y'));
language = response_mn;
clrscr();
if(language == 'E')
language = 'e';
if(language == 'G')
language = 'g';
if(language == 'e')
{
printf(" GLASS PLATE GAME(R) Copyright (C), 1993, by Dunbar");
printf(" Aitkens\n\n");
printf("This program is for study of rules to The Glass Plate");
printf(" Game\n");
printf("(R), a board game, and to test the program as an idea");
printf(" for\n");
printf("developing a a computer assisted version or counterpart");
printf(" of/to \n");
printf("the board game.\n\n");
printf("Minimal hardware is sufficient, an XT or compatable with 360\n");
printf("disk drive and MDA monitor. Input has these bounds: 1 - 8\n;");
printf("color: R, Y, O, B, G; cube: 1-24; cube side: 'P', 'C', 'O'");
printf(" or \n");
printf("'V'; card: 1 - 40\n\n");
printf("copies / updates of this program are available");
printf(" by anonymous \n");
printf("FTP to 128.192.2.13, directory pub/gaming");
printf("/glass-plate-game.\n");
printf("Internet messages about this program or about the");
printf(" Glass Plate\n");
printf("Game / playings should be mailed to [email protected].");
printf("\n\n");
}
if(language == 'g')
{
printf("Glassplattenspiel\n\n");
printf("Dieses Programm ist zum Studieren der Regeln des");
printf(" Glassplattenspiel als\n");
printf("Brettspiel, und zum Test des Programmes als erste Stufe");
printf(" zur\n");
printf("Entwicklung einer computerisierten Version des Brettspieles.\n\n");
printf("Einfachste Hardware ist ausreichend: ein XT (oder Kompatibler)");
printf(" mit 360 KB\n");
printf("Disketten Laufwerk und MDA Monitor. Die Eingabe M\"glichkeiten");
printf(" sind: 1-8\n");
printf("Spieler; Farben: R,B,G,Y,O (wobei 'Y' gelb darstellt); 1-24");
printf(" Wrfel; die\n");
printf("Wrfel Seiten sind: 'B', 'F', 'E','A','G'', 'U'; es gibt 40");
printf(" Karten.\n\n");
printf("Kopieren oder Updates dieses Programmes Sind");
printf(" ber anonymous ftp erh„ltlich\n");
printf("FTP nach 128.193.2.13, Verzeichnis pub/gaming/glass-plate-game.");
printf(" Damit\n");
printf("zusammenhangerde text- und gif-files sind in");
printf(" Unterverzeichnissen davon.\n");
printf("Anmerkungen und Fragen bitte an [email protected].\n\n");
}
do {
if(language == 'e')
{
printf("loading your program from what drive?(A,B,C)\n");
response_mn = get1char("");
sure = get1char("Are you sure? ");
}
if(language == 'g')
{
printf("Von welches Laufwerke laden Sie das Programm? (A.B,C)\n");
response_mn = get1char("");
sure = get1char("Sind Sie sicher? ");
if((sure == 'j') || (sure == 'J'))
sure = 'y';
}
}
while ((response_mn != 'a') && (response_mn != 'b') &&
(response_mn != 'c') || (sure != 'y'));
switch(response_mn)
{
case 'a' :
{
disk_choice = 0; /* File for transcript will be A:REPLAY.TXT. */
break;
}
case 'b' :
{
disk_choice = 1; /* File for transcript will be B:REPLAY.TXT. */
break;
}
case 'c' :
{
disk_choice = 2; /* File for transcript will be C:REPLAY.TXT. */
break;
}
}
do {
if((language == 'e') || (language == 'E'))
{
response_mn = get1char("Want to play, review, or quit? (p,r,q): ");
}
if((language == 'g') || (language == 'G'))
{
printf("Wollen Sie spielen, ein altes Spiel wiederholen oder");
printf(" aufh\"ren? (S,W,E)\n");
response_mn = get1char("");
if((language == 'g') || (language == 'G'))
switch(response_mn)
{
case 's' : ;
case 'S' :
{
response_mn = 'p';
break;
}
case 'w' : ;
case 'W' :
{
response_mn = 'r';
break;
}
case 'e' : ;
case 'E' :
{
response_mn = 'q';
break;
}
}
}
}
while ((response_mn != 'p') && (response_mn != 'q') &&
(response_mn != 'r'));
if (response_mn != 'q')
{
if (response_mn == 'r')
{
is_replay = 1;
// window(1,1,80,24);
clrscr();
printf("Wait ... disk being accessed.");
get_transcript(cubes2, filenames[disk_choice]);
}
else
{
is_replay = 0;
if((language == 'e') || (language == 'G'))
{
players = get1char("More than 3 playing (y, n)");
if((language == 'g') || (language == 'G'))
{
players = get1char("Spieln mehr als drei? (j,n)");
if (players == 'j')
players = 'y';
}
}
while((players != 'y') && (players != 'n'))
{
if((language == 'e') || (language == 'E'))
players = get1char("( y,n )");
if((language == 'g') || (language == 'G'))
{
players = get1char("( j, n)");
if((players == 'j') || (players == 'J'))
players = 'y';
}
}
}
clrscr();
printf(" action cube player card color side from");
stats = 3;
keep_playing = 1;
// window(1,11,80,24);
clrscr();
while (keep_playing)
{
//window(1,11,80,24);
printf("\n");
keep_playing = get_Move();
}
}
//window(1,1,80,25);
clrscr();
printf("wait ... disk being accessed.");
if (is_replay == 0)
{
store_transcript(cubes, filenames[disk_choice]);
}
get_transcript(cubes2, filenames[disk_choice]);
//window(1,1,80,25);
clrscr();
printf("cube player card color side from\n");
for (j = 1; j <= 12; j++)
{
//window(1,j+1,40,24);
printf(" %-2d %d %-2d ",j,cubes2[j].player,cubes2[j].card);
printf("%d %d ", cubes2[j].color, cubes2[j].state);
printf("%-2d \n", cubes2[j].from_what_cube);
} /* Works fine for just raw data from the cubes array */
//window(40,1,80,24);
printf("cube player card color side from\n");
j = 1;
for (k = 13; k <= 24; k++)
{
j++;
//window(40,j,80,24);
printf(" %-2d %d %-2d ",k,cubes2[k].player,cubes2[k].card);
printf("%d %d ", cubes2[k].color, cubes2[k].state);
printf("%-2d \n", cubes2[k].from_what_cube);
} /* Works fine for just raw data from the cubes array */
}
int rule_on_move( int move_type_r, int cube_r, int player_r, int card_r,
int color_r, int state_r, int from_what_cube_r) /* stub at this point */
{
/* printf(" This is rule_On_Move(). Get_Move() called me.\n"); */
/* --------------------------------------------------------------------
A. Rule on moves giving appropriate help message for disallowed moves,
for any move present player could not also have been previous player.
1. start (of a chain of thought)
Check to see if color already used. If so disallow.
2. connection (extending a chain of thought or branching)
Check to see if cube already at end of the chain is turned to P/O.
If so disallow.
3. cube_turning (permit, challeng, O.K., void)
For P, C, O, or blank check to see if cube was on #, #, C, or C,
respectively. In cases of O or P, player can not be same as player
who placed the cube being turned. In case of P, player can not be
player who placed cube being turned or the previous one in that
line of thought (under which that color was placed).
-------------------------------------------------------------- */
assert((card_r >= 0) && (card_r <= 40)); /* 40 cards in the deck */
assert((cube_r >= 0) && (cube_r <= 24)); /* 24 cubes in the box */
assert((color_r >= 0) && (color_r <= 5)); /* 5 colors in the box */
assert((player_r >= 0) && (player_r <= 8)); /* max 8 people play */
assert((state_r >= 0) && (state_r <= 5)); /* 5 cube sides differ */
assert((from_what_cube_r >= 0) &&
(from_what_cube_r < cube_r)); /* cube used in previous turn */
char * error[2][30];
char * chai_r[2];
char * chai_end_r[2];
chai_r[0] = "Chain =";
chai_r[1] = "Kette =";
chai_end_r[0] = "Chain end is ";
chai_end_r[1] = "Ende der Kette ist ";
error[0][1] = "The previous connection must have been permited.\n";
error[1][1] = "Die vorherige Verbindung muss erlaubt werden.\n";
error[0][2] = "The cube needs to use an unused color. Branch perhaps?\n";
error[1][2] =
"Dieser Wrfel benutzt eine andere Farbe. Vieleicht verzweigen?\n";
error[0][3] = "Branching requires a new color?\n";
error[1][3] = "Verzweigen erfordet eine neue Farbe.\n";
error[0][4] = "A cube that starts a chain, can not be turned.\n";
error[1][4] =
"Ein Wrfel der eine Kette startet, kann nicht gedreht werden.\n";
error[0][5] = "That cube is already turned to 'O'\n";
error[1][5] = "Dieser Wrfel ist schon auf 'G' gedreht.\n";
error[0][6] = "After a cube has been turned to 'O','P', or blank may not\n";
error[1][6] =
"Nachdem ein Wrfel zu 'G', 'E' oder 'leer' gedreht wurde, kann er\n";
error[0][7] = "be turned.\n";
error[1][7] = "nicht mehr gedreht werden.\n";
error[0][8] = "You may not permit a connection that you made yourself or\n";
error[1][8] =
"Sie k\"nnen keine Verbindung erlauben, die Sie selbst gemacht haben oder\n";
error[0][9] = "if you set the cube from which the connection was made.\n";
error[1][9] = "bei der sie den Wrfel gesetzt haben von der sie ausging.\n";
error[0][10] ="That cube has already been turned to 'P'.\n";
error[1][10] = "Dieser Wrfel ist schon auf 'E' gedreht.\n";
error[0][11] ="That cube has already been turned to 'C'.\n";
error[1][11] = "Dieser Wrfel ist schon auf 'A' gedreht.\n";
error[0][12] = "That cube has already been turned to blank.\n";
error[1][12] = "Dieser Wrfel ist schon auf 'leer' gedreht.\n";
error[0][13] = "Colors change only for branching.\n";
error[1][13] = "Farben „ndern sich nur bei Verzweigungen.\n";
error[0][14] = "Not a chain end \n";
error[1][14] = "Nicht das Ende einer Kette. \n";
error[0][15] = "From C a cube can be turned to only 'O' or 'blank'.";
error[1][15] = "Von 'A' kann ein Wrfel nur auf 'G' oder 'U' gedreht werden.";
error[0][16] = "Extend a chain only from its end.";
error[1][16] = "Eine Kette kann nur von ihrem Ende fortgefhrt werden.";
error[0][17] = "Branch maybe?";
error[1][17] = "Vielleicht Verzweigen?";
error[0][18] = "Can't permit a connection you've made.";
error[1][18] = "Eine Verbindung die Sie gemacht haben k\"nnen Sie nicht erlauben.";
error[0][19] = "A cube can be O.K.'d only from 'C'";
error[1][19] = "Ein Wrfel kann nur von 'A' aus auf 'G' gedreht werden.";
error[0][20] = "A player can't turn to 'O' a cube he/she placed.";
error[1][20] = "Ein Spieler kann keinen Wrfel auf 'G' drehen, den er/sie gesetzt hat.";
error[0][21] = "That cube is already turned to blank.";
error[1][21] = "Dieser Wrfel ist schon auf 'leer' gedreht.";
error[0][22] = "A cube can be blanked only from 'C'";
error[1][22] = "Ein Wrfel kann nur von 'A' aus auf 'leer' gedreht werden.";
error[0][23] = "If you mean to start a new chain, use an unused color.\n";
error[1][23] = "Benutzen Sie eine unbentzte Farbe, um eine neue Kette zu beginnen.\n";
int language_row_r;
if((language == 'e') || (language == 'E'))
language_row_r = 0;
if((language == 'g') || (language == 'G'))
language_row_r = 1;
//window(1,13,80,24);
ruling = allowed;
if (move_type_r == 0)
ruling = disallowed;
else
switch (move_type_r)
{
case 1 : /*start */
{
if (previous_of_color[color_r] != 0)
{
printf(error[language_row_r][23]);
printf("%s %d \n", chai_r[language_row_r],color_r);
printf("%s",chai_end_r[language_row_r]);
printf(" %d ", previous_of_color[color_r]);
ruling = disallowed;
}
else
ruling = allowed;
break;
}
case 2 : ; /* extend */
{
if (cubes[from_what_cube_r].color == color_r)
{
if(previous_of_color[color_r] == from_what_cube_r)
{
if (cubes[from_what_cube_r].from_what_cube != 0)
{
if ((cubes[from_what_cube_r].state != 2) &&
(cubes[from_what_cube_r].state != 4))
{
printf(error[language_row_r][1]);
ruling = disallowed;
}
else
{
ruling = allowed;
}
}
else
{
ruling = allowed;
}
}
else
{
printf(error[language_row_r][16]);
printf(error[language_row_r][17]);
ruling = disallowed;
}
}
else
{
printf(error[language_row_r][13]);
ruling = disallowed;
}
break;
}
case 3 : /* branch */
{
if(previous_of_color[color_r] == 0)
{
if (cubes[from_what_cube_r].from_what_cube != 0)
{
if ((cubes[from_what_cube_r].state != 2) &&
(cubes[from_what_cube_r].state != 4))
{
printf (error[language_row_r][1]);
ruling = disallowed;
}
}
else
ruling = allowed;
}
else
{
printf(error[language_row_r][3]);
ruling = disallowed;
}
break;
}
case 4 : /* permit */
{
ruling = allowed;
if(cubes[cube_r].from_what_cube == 0)
{
printf(error[language_row_r][4]);
ruling = disallowed;
}
if (cubes[cube_r].state == 3)
{
printf(error[language_row_r][15]);
ruling = disallowed;
}
if (state_r == cubes[cube_r].state)
{
printf(error[language_row_r][10]);
ruling = disallowed;
}
else if ((cubes[cube_r].state == 4) ||
(cubes[cube_r].state == 5))
{
printf (error[language_row_r][6]);
ruling = disallowed;
}
if(players == 'y')
{
if ((cubes[cube_r].player == player_r) ||
(cubes[cubes[cube_r].from_what_cube].player ==
player_r))
{
printf(error[language_row_r][8]);
printf(error[language_row_r][9]);
ruling = disallowed;
}
}
else
{
if (cubes[cube_r].player == player_r)
{
printf(error[language_row_r][18]);
ruling = disallowed;
}
}
break;
}
case 5 : /* challenge */
{
ruling = allowed;
if(cubes[cube_r].from_what_cube == 0)
{
printf(error[language_row_r][4]);
ruling = disallowed;
}
if (cubes[cube_r].state == state_r)
{
printf(error[language_row_r][11]);
ruling = disallowed;
}
if ((cubes[cube_r].state == 2) ||
(cubes[cube_r].state == 4) ||
(cubes[cube_r].state == 5))
{
printf(error[language_row_r][6]);
printf(error[language_row_r][7]);
ruling = disallowed;
}
break;
}
case 6 : /* ok */
{
ruling = allowed;
if(cubes[cube_r].from_what_cube == 0)
{
printf(error[language_row_r][4]);
ruling = disallowed;
}
if (cubes[cube_r].state == state_r)
{
printf(error[language_row_r][5]);
ruling = disallowed;
}
else
if (cubes[cube_r].state != 3)
{
printf(error[language_row_r][19]);
ruling = disallowed;
}
if ((cubes[cube_r].state == 2) ||
(cubes[cube_r].state == 5))
{
printf(error[language_row_r][6]);
printf(error[language_row_r][7]);
ruling = disallowed;
}
if (cubes[cube_r].player == player_r)
{
printf(error[language_row_r][20]);
ruling = disallowed;
}
break;
}
case 7 : /* void */
{
ruling = allowed;
if(cubes[cube_r].from_what_cube == 0)
{
printf(error[language_row_r][4]);
ruling = disallowed;
}
if (cubes[cube_r].state == state_r)
{
printf(error[language_row_r][21]);
ruling = disallowed;
}
else
if (cubes[cube_r].state != 3)
{
printf(error[language_row_r][22]);
ruling = disallowed;
}
if ((cubes[cube_r].state == 2) ||
(cubes[cube_r].state == 4))
{
printf(error[language_row_r][12]);
ruling = disallowed;
}
break;
}
default :
ruling = disallowed;
}
return(ruling);
}
void update( int cube_u, int player_u, int card_u, int color_u, int state_u,
int from_what_cube_u)
{
/* printf(" This is update(). get_Move() called me.\n"); */
assert((card_u >= 0) && (card_u <= 40)); /* 40 cards in the deck */
assert((cube_u >= 0) && (cube_u <= 24)); /* 24 cubes in the box */
assert((color_u >= 0) && (color_u <= 5)); /* 5 colors in the box */
assert((player_u >= 0) && (player_u <= 8)); /* max 8 people play */
assert((state_u >= 0) && (state_u <= 5)); /* 5 cube sides differ */
assert((from_what_cube_u >= 0) &&
(from_what_cube_u < cube_u)); /* cube used in previous
turn */
/* Upate cube record with any new data reflecting the move. */
if (state_u != 0)
cubes[cube_u].state = state_u;
if (card_u != 0)
cubes[cube_u].card = card_u;
if ((player_u != 0) && (card_u != 0))
cubes[cube_u].player = player_u;
if (color_u != 0)
cubes[cube_u].color = color_u;
if (from_what_cube_u != 0)
cubes[cube_u].from_what_cube = from_what_cube_u;
if ((state_u == 2) || (state_u == 3))
cubes[cube_u].player_p_c = player_u;
if ((state_u == 4) || (state_u == 5))
cubes[cube_u].player_o_v = player_u;
/* Make whoever is current_player the previous_player. */
previous_player = player_u;
}
int get_Move()
{
int player_m = 0;
char response_m;
int move_type_m = 0;
int color_m = 0;
int card_m = 0;
int state_m = 0;
int from_what_cube_m = 0;
int cube_m;
int language_row_m;
if((language == 'e') || (language == 'E'))
language_row_m = 0;
if((language == 'g') || (language == 'G'))
language_row_m = 1;
char * types_menue[2][10];
char * rtrn_m[2];
char * y_n_m[2];
char y_n_j_n_m[2][2];
char * h_any_m[2];
char * relatn[2];
char * ch[2];
char * ch_response[2];
char * reject_m[2];
char move_choice_m[2][10] =
{'s','x','b','p','c','o','v','z','z','z','b','f','v','e','a','g','u'};
char side[2][6] =
{'#','p','c','o','- ',' ','# ','e ','a ','g ','u ',' '};
// check the "side" letters for german version
char hue[2][6] = {'r','b','g','y','o',' ','r','b','g','y','o',' '};
// needs german "hue" choices
char action[2][8] =
{'-','s','x','b','p','c','o','v','-','b','f','v','e','a','g','u'};
types_menue[0][1] = "S - Start\n";
types_menue[1][1] = "B - Begin\n";
types_menue[0][2] = "X - Extend\n";
types_menue[1][2] = "F - Fortfhren\n";
types_menue[0][3] = "B - Branch\n";
types_menue[1][3] = "V - Verzweigen\n";
types_menue[0][4] = "P - Permit\n";
types_menue[1][4] = "E - Erlauben\n";
types_menue[0][5] = "C - Challenge\n";
types_menue[1][5] = "A - Anzweifeln\n";
types_menue[0][6] = "O - O.K.\n";
types_menue[1][6] = "G - Gltig\n";
types_menue[0][7] = "V - Void\n";
types_menue[1][7] = "U - Ungltig\n";
char * prompt[2][30];
rtrn_m[0] = "\nPress return.";
rtrn_m[1] = "\nReturn Taste";
y_n_m[0] = "\nAre you sure? (y,n)";
y_n_m[1] = "\nSind Sie sicher? (j,n)";
h_any_m[0] = "Hit any key.";
h_any_m[1] = "Eine beliebige Taste";
relatn[0] = "Relation";
relatn[1] = "Verbindung:";
ch[0] = "Challenge";
ch[1] = "Anzweifeln.";
ch_response[0] = "Response to challenge";
ch_response[1] = "Antwort";
y_n_j_n_m[0][0] = 'y';
y_n_j_n_m[1][0] = 'j';
y_n_j_n_m[0][1] = 'n';
y_n_j_n_m[1][1] = 'n';
reject_m[0] = "rejected";
reject_m[1] = "abgelehnt";
prompt[0][1] = "Only one to eight may play. Continue game?\n";
prompt[1][1] = "Nur ein bis acht Spieler sind m\"glich. Weiterspielen?\n";
prompt[0][2] = "Two consecutive moves not allowed. Continue game?\n";
prompt[1][2] =
"Zwei aufeinanderfolgende Zge sind nicht erlaubt. Weiterspielen?\n";
prompt[0][3] = "Your move?(s,x,b,p,c,o,v) ";
prompt[1][3] = "Ihr Zug? (b,f,v,e,a,g,u) ";
prompt[0][4] = "-> You have chosen to start a chain of thought.\n";
prompt[1][4] = "-> Sie m\"chten eine Gedankenkette starten.\n";
prompt[0][5] = "What is the color for the chain?(R,B,G,Y,O)\n";
prompt[1][5] = "Wie ist die Farbe der Kette? (R,B,G,Y,O)\n";
prompt[0][6] = "That color is not one provided.\n";
prompt[1][6] = "Diese Farbe gibt es nicht. Weiterspielen?\n";
prompt[0][7] = "What card?";
prompt[1][7] = "Welche Karte?";
prompt[0][8] = "On what card should the cube be set? (1 - 40)\n";
prompt[1][8] = "Auf welche Karte soll der Wrfel gesetzt werden? (1 - 40)\n";
prompt[0][9] = "That card is not on the board. Continue game?";
prompt[1][9] = "Diese Karte gibt es nicht. Weiterspielen?\n";
prompt[0][10] = "You have chosen to continue a chain.\n";
prompt[1][10] = "-> Sie m\"chten eine Kette fortfhren.\n";
prompt[0][11] = "-> You have chosen to branch to another chain.\n";
prompt[1][11] = "-> Sie m\"chten von einer Kette verzweigen.\n";
prompt[0][12] = "-> You have requested to permit a relation.\n";
prompt[1][12] = "-> Sie m\"chten eine Verbindung erlauben.\n";
prompt[0][13] = "Which cube chould be turned to 'P'\n";
prompt[1][13] = "Welcher Wrfel soll auf 'E' gedreht werden?\n";
prompt[0][14] = "You have requested a connection be challenged.\n";
prompt[1][14] = "Sie m\"chten eine Verbindung anzweifeln.\n";
prompt[0][15] = "Which cube should be turned to 'C'\n";
prompt[1][15] = "Welcher Wrfel soll auf 'A' gedreht werden?\n";
prompt[0][16] = "-> You have requested a connection to be O.K.'d.\n";
prompt[1][16] = "-> Sie m\"chten eine Verbindung fr gltig erkl„ren.\n";
prompt[0][17] = "Which cube should be turned to 'O'?\n";
prompt[1][17] = "Welcher Wrfel soll auf 'G' gedreht werden?\n";
prompt[0][18] = "-> You have requested a connection be voided\n";
prompt[1][18] = "-> Sie m\"chten eine Verbindung fr ungltig erklaren.\n",
prompt[0][19] = "Which cube should be turned to blank (v)?\n";
prompt[1][19] = "Welcher Wrfel soll auf 'leer' ('U') gedreht werden?\n";
prompt[0][21] = "From what cube is the connection?\n";
prompt[1][21] = "Von welchem Wrfel aus soll die Verbindung gemacht werden?\n";
prompt[0][22] = "player(roster position) or q to quit ( # / q)? ";
prompt[1][22] = "Spieler Nummer oder 'q' zum beenden? ( # / q) ";
if(is_replay == 0)
{
cube_m = cube_of_move;
}
else
{
cube_m = replay_cube;
if (cubes2[replay_cube].state == 1)
{
turnings_for_cube = 0;
}
if((cubes2[replay_cube].state == 2) || (cubes2[replay_cube].state == 3))
{
turnings_for_cube = 1;
}
if((cubes2[replay_cube].state == 4) || (cubes[replay_cube].state == 5))
{
turnings_for_cube = 2;
}
}
move_request = allowed;
//window(1,11,80,25);
if (is_replay == 0)
{
player_m = get1char(prompt[language_row_m][22]);
clrscr();
printf("\n\n");
if((player_m == 'q') || (player_m == 'Q'))
{
clrscr();
return 0;
}
player_m = player_m - '0';
}
else
{
get1char(rtrn_m[language_row_m]);
printf("\n\n");
clrscr();
switch(next_turning)
{
case 0 : /* Replay will be of the placing of the cube */
{
player_m = cubes2[replay_cube].player;
if(player_m == 0)
{
clrscr();
return 0;
}
break;
}
case 1 : /* Replay will be of 1st time the cube is turned */
{ /* If it was turned */
player_m = cubes2[replay_cube].player_p_c;
if (player_m == 0)
{
clrscr();
return 0;
}
break;
}
case 2 : /* Replay will be of the 2nd time the cube is turned */
{ /* if it was turned a 2nd time */
player_m = cubes2[replay_cube].player_o_v;
if(player_m == 0)
{
clrscr();
return 0;
}
break;
}
}
}
if ((player_m <= 0) || (player_m > 8))
{
move_type_m = 0;
printf("%s",prompt[language_row_m][1]);
get1char(rtrn_m[language_row_m]);
clrscr();
return 1; /* max 8 people play */
}
if((player_m == previous_player) && (players == 'y'))
{
if(players == 'y')
{
move_type_m = 0;
printf("%s\n",prompt[language_row_m][2]);
get1char(rtrn_m[language_row_m]);
clrscr();
return 1; /* No player may make two consecutive moves. */
}
}
else
{
if (is_replay == 0) /* Intake current move .. 1st the type of move */
{
do
{
clrscr();
response_m = get1char(prompt[language_row_m][3]);
if(response_m == '?')
{
clrscr();
printf("%s",types_menue[language_row_m][1]);
printf("%s",types_menue[language_row_m][2]);
printf("%s",types_menue[language_row_m][3]);
printf("%s",types_menue[language_row_m][4]);
printf("%s",types_menue[language_row_m][5]);
printf("%s",types_menue[language_row_m][6]);
printf("%s",types_menue[language_row_m][7]);
printf("\n\n %s",rtrn_m[language_row_m]);
get1char("");
clrscr();
}
printf("\n");
}
while((response_m != move_choice_m[language_row_m][0])&&
(response_m != move_choice_m[language_row_m][1])&&
(response_m != move_choice_m[language_row_m][2])&&
(response_m != move_choice_m[language_row_m][3])&&
(response_m != move_choice_m[language_row_m][4])&&
(response_m != move_choice_m[language_row_m][5])&&
(response_m != move_choice_m[language_row_m][6]));
}
else
/* *****************************************************************
Replay. Determine type of move being replayed.
***************************************************************** */
{
if(cubes2[replay_cube].from_what_cube == 0)
{
response_m = move_choice_m[language_row_m][0];
}
else
switch(next_turning)
{
case 0 : /* cube has been placed */
{
if(previous_of_color[cubes2[replay_cube].color] != 0)
{
response_m = move_choice_m[language_row_m][1];
}
else
{
response_m = move_choice_m[language_row_m][2];
}
break;
}
case 1 : /* 1st time cube is turned */
{
if(cubes2[replay_cube].state == 2)
response_m = move_choice_m[language_row_m][3];
else
{
response_m = move_choice_m[language_row_m][4];
}
break;
}
case 2 : /* 2nd time cube was turned, if turned a 2nd time */