-
Notifications
You must be signed in to change notification settings - Fork 0
/
guess.c
1570 lines (1339 loc) · 47.2 KB
/
guess.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
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
/*
* guess.c: Mastermind clone.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <ctype.h>
#ifdef NO_TGMATH_H
# include <math.h>
#else
# include <tgmath.h>
#endif
#include "puzzles.h"
#define FLASH_FRAME 0.5F
enum {
COL_BACKGROUND,
COL_FRAME, COL_CURSOR, COL_FLASH, COL_HOLD,
COL_EMPTY, /* must be COL_1 - 1 */
COL_1, COL_2, COL_3, COL_4, COL_5, COL_6, COL_7, COL_8, COL_9, COL_10,
COL_CORRECTPLACE, COL_CORRECTCOLOUR,
NCOLOURS
};
struct game_params {
int ncolours, npegs, nguesses;
bool allow_blank, allow_multiple;
};
#define FEEDBACK_CORRECTPLACE 1
#define FEEDBACK_CORRECTCOLOUR 2
typedef struct pegrow {
int npegs;
int *pegs; /* 0 is 'empty' */
int *feedback; /* may well be unused */
} *pegrow;
/* Pegs can have these flags OR'ed into them. */
#define PEG_CURSOR 0x1000
#define PEG_HOLD 0x2000
#define PEG_LABELLED 0x4000
#define PEG_FLAGS (PEG_CURSOR | PEG_HOLD | PEG_LABELLED)
struct game_state {
game_params params;
pegrow *guesses; /* length params->nguesses */
bool *holds;
pegrow solution;
int next_go; /* from 0 to nguesses-1;
if next_go == nguesses then they've lost. */
int solved; /* +1 = win, -1 = lose, 0 = still playing */
};
static game_params *default_params(void)
{
game_params *ret = snew(game_params);
/* AFAIK this is the canonical Mastermind ruleset. */
ret->ncolours = 6;
ret->npegs = 4;
ret->nguesses = 10;
ret->allow_blank = false;
ret->allow_multiple = true;
return ret;
}
static void free_params(game_params *params)
{
sfree(params);
}
static game_params *dup_params(const game_params *params)
{
game_params *ret = snew(game_params);
*ret = *params; /* structure copy */
return ret;
}
static const struct {
const char *name;
game_params params;
} guess_presets[] = {
{"Standard", {6, 4, 10, false, true}},
{"Super", {8, 5, 12, false, true}},
};
static bool game_fetch_preset(int i, char **name, game_params **params)
{
if (i < 0 || i >= lenof(guess_presets))
return false;
*name = dupstr(guess_presets[i].name);
*params = dup_params(&guess_presets[i].params);
return true;
}
static void decode_params(game_params *params, char const *string)
{
char const *p = string;
game_params *defs = default_params();
*params = *defs; free_params(defs);
while (*p) {
switch (*p++) {
case 'c':
params->ncolours = atoi(p);
while (*p && isdigit((unsigned char)*p)) p++;
break;
case 'p':
params->npegs = atoi(p);
while (*p && isdigit((unsigned char)*p)) p++;
break;
case 'g':
params->nguesses = atoi(p);
while (*p && isdigit((unsigned char)*p)) p++;
break;
case 'b':
params->allow_blank = true;
break;
case 'B':
params->allow_blank = false;
break;
case 'm':
params->allow_multiple = true;
break;
case 'M':
params->allow_multiple = false;
break;
default:
;
}
}
}
static char *encode_params(const game_params *params, bool full)
{
char data[256];
sprintf(data, "c%dp%dg%d%s%s",
params->ncolours, params->npegs, params->nguesses,
params->allow_blank ? "b" : "B", params->allow_multiple ? "m" : "M");
return dupstr(data);
}
static config_item *game_configure(const game_params *params)
{
config_item *ret;
char buf[80];
ret = snewn(6, config_item);
ret[0].name = "Colours";
ret[0].type = C_STRING;
sprintf(buf, "%d", params->ncolours);
ret[0].u.string.sval = dupstr(buf);
ret[1].name = "Pegs per guess";
ret[1].type = C_STRING;
sprintf(buf, "%d", params->npegs);
ret[1].u.string.sval = dupstr(buf);
ret[2].name = "Guesses";
ret[2].type = C_STRING;
sprintf(buf, "%d", params->nguesses);
ret[2].u.string.sval = dupstr(buf);
ret[3].name = "Allow blanks";
ret[3].type = C_BOOLEAN;
ret[3].u.boolean.bval = params->allow_blank;
ret[4].name = "Allow duplicates";
ret[4].type = C_BOOLEAN;
ret[4].u.boolean.bval = params->allow_multiple;
ret[5].name = NULL;
ret[5].type = C_END;
return ret;
}
static game_params *custom_params(const config_item *cfg)
{
game_params *ret = snew(game_params);
ret->ncolours = atoi(cfg[0].u.string.sval);
ret->npegs = atoi(cfg[1].u.string.sval);
ret->nguesses = atoi(cfg[2].u.string.sval);
ret->allow_blank = cfg[3].u.boolean.bval;
ret->allow_multiple = cfg[4].u.boolean.bval;
return ret;
}
static const char *validate_params(const game_params *params, bool full)
{
if (params->ncolours < 2 || params->npegs < 2)
return "Trivial solutions are uninteresting";
/* NB as well as the no. of colours we define, max(ncolours) must
* also fit in an unsigned char; see new_game_desc. */
if (params->ncolours > 10)
return "Too many colours";
if (params->nguesses < 1)
return "Must have at least one guess";
if (!params->allow_multiple && params->ncolours < params->npegs)
return "Disallowing multiple colours requires at least as many colours as pegs";
return NULL;
}
static pegrow new_pegrow(int npegs)
{
pegrow pegs = snew(struct pegrow);
pegs->npegs = npegs;
pegs->pegs = snewn(pegs->npegs, int);
memset(pegs->pegs, 0, pegs->npegs * sizeof(int));
pegs->feedback = snewn(pegs->npegs, int);
memset(pegs->feedback, 0, pegs->npegs * sizeof(int));
return pegs;
}
static pegrow dup_pegrow(pegrow pegs)
{
pegrow newpegs = new_pegrow(pegs->npegs);
memcpy(newpegs->pegs, pegs->pegs, newpegs->npegs * sizeof(int));
memcpy(newpegs->feedback, pegs->feedback, newpegs->npegs * sizeof(int));
return newpegs;
}
static void invalidate_pegrow(pegrow pegs)
{
memset(pegs->pegs, -1, pegs->npegs * sizeof(int));
memset(pegs->feedback, -1, pegs->npegs * sizeof(int));
}
static void free_pegrow(pegrow pegs)
{
sfree(pegs->pegs);
sfree(pegs->feedback);
sfree(pegs);
}
static char *new_game_desc(const game_params *params, random_state *rs,
char **aux, bool interactive)
{
unsigned char *bmp = snewn(params->npegs, unsigned char);
char *ret;
int i, c;
pegrow colcount = new_pegrow(params->ncolours);
for (i = 0; i < params->npegs; i++) {
newcol:
c = random_upto(rs, params->ncolours);
if (!params->allow_multiple && colcount->pegs[c]) goto newcol;
colcount->pegs[c]++;
bmp[i] = (unsigned char)(c+1);
}
obfuscate_bitmap(bmp, params->npegs*8, false);
ret = bin2hex(bmp, params->npegs);
sfree(bmp);
free_pegrow(colcount);
return ret;
}
static const char *validate_desc(const game_params *params, const char *desc)
{
unsigned char *bmp;
int i;
/* desc is just an (obfuscated) bitmap of the solution; check that
* it's the correct length and (when unobfuscated) contains only
* sensible colours. */
if (strlen(desc) != params->npegs * 2)
return "Game description is wrong length";
bmp = hex2bin(desc, params->npegs);
obfuscate_bitmap(bmp, params->npegs*8, true);
for (i = 0; i < params->npegs; i++) {
if (bmp[i] < 1 || bmp[i] > params->ncolours) {
sfree(bmp);
return "Game description is corrupted";
}
}
sfree(bmp);
return NULL;
}
static game_state *new_game(midend *me, const game_params *params,
const char *desc)
{
game_state *state = snew(game_state);
unsigned char *bmp;
int i;
state->params = *params;
state->guesses = snewn(params->nguesses, pegrow);
for (i = 0; i < params->nguesses; i++)
state->guesses[i] = new_pegrow(params->npegs);
state->holds = snewn(params->npegs, bool);
state->solution = new_pegrow(params->npegs);
bmp = hex2bin(desc, params->npegs);
obfuscate_bitmap(bmp, params->npegs*8, true);
for (i = 0; i < params->npegs; i++)
state->solution->pegs[i] = (int)bmp[i];
sfree(bmp);
memset(state->holds, 0, sizeof(bool) * params->npegs);
state->next_go = state->solved = 0;
return state;
}
static game_state *dup_game(const game_state *state)
{
game_state *ret = snew(game_state);
int i;
*ret = *state;
ret->guesses = snewn(state->params.nguesses, pegrow);
for (i = 0; i < state->params.nguesses; i++)
ret->guesses[i] = dup_pegrow(state->guesses[i]);
ret->holds = snewn(state->params.npegs, bool);
memcpy(ret->holds, state->holds, sizeof(bool) * state->params.npegs);
ret->solution = dup_pegrow(state->solution);
return ret;
}
static void free_game(game_state *state)
{
int i;
free_pegrow(state->solution);
for (i = 0; i < state->params.nguesses; i++)
free_pegrow(state->guesses[i]);
sfree(state->holds);
sfree(state->guesses);
sfree(state);
}
static char *solve_game(const game_state *state, const game_state *currstate,
const char *aux, const char **error)
{
return dupstr("S");
}
static bool is_markable(const game_params *params, pegrow pegs)
{
int i, nset = 0, nrequired;
bool ret = false;
pegrow colcount = new_pegrow(params->ncolours);
nrequired = params->allow_blank ? 1 : params->npegs;
for (i = 0; i < params->npegs; i++) {
int c = pegs->pegs[i];
if (c > 0) {
assert(c <= params->ncolours);
colcount->pegs[c-1]++;
nset++;
}
}
if (nset < nrequired) goto done;
if (!params->allow_multiple) {
for (i = 0; i < params->ncolours; i++) {
if (colcount->pegs[i] > 1) goto done;
}
}
ret = true;
done:
free_pegrow(colcount);
return ret;
}
struct game_ui {
game_params params;
pegrow curr_pegs; /* half-finished current move */
bool *holds;
int colour_cur; /* position of up-down colour picker cursor */
int peg_cur; /* position of left-right peg picker cursor */
bool display_cur, markable;
int drag_col, drag_x, drag_y; /* x and y are *center* of peg! */
int drag_opeg; /* peg index, if dragged from a peg (from current guess), otherwise -1 */
bool show_labels; /* label the colours with numbers */
pegrow hint;
};
static game_ui *new_ui(const game_state *state)
{
game_ui *ui = snew(game_ui);
memset(ui, 0, sizeof(game_ui));
if (state != NULL) {
ui->params = state->params; /* structure copy */
ui->curr_pegs = new_pegrow(state->params.npegs);
ui->holds = snewn(state->params.npegs, bool);
memset(ui->holds, 0, sizeof(bool)*state->params.npegs);
}
ui->display_cur = getenv_bool("PUZZLES_SHOW_CURSOR", false);
ui->drag_opeg = -1;
return ui;
}
static config_item *get_prefs(game_ui *ui)
{
config_item *ret;
ret = snewn(2, config_item);
ret[0].name = "Label colours with numbers";
ret[0].kw = "show-labels";
ret[0].type = C_BOOLEAN;
ret[0].u.boolean.bval = ui->show_labels;
ret[1].name = NULL;
ret[1].type = C_END;
return ret;
}
static void set_prefs(game_ui *ui, const config_item *cfg)
{
ui->show_labels = cfg[0].u.boolean.bval;
}
static void free_ui(game_ui *ui)
{
if (ui->hint)
free_pegrow(ui->hint);
if (ui->curr_pegs)
free_pegrow(ui->curr_pegs);
sfree(ui->holds);
sfree(ui);
}
static char *encode_ui(const game_ui *ui)
{
char *ret, *p;
const char *sep;
int i;
/*
* For this game it's worth storing the contents of the current
* guess, and the current set of holds.
*/
ret = snewn(40 * ui->curr_pegs->npegs, char);
p = ret;
sep = "";
for (i = 0; i < ui->curr_pegs->npegs; i++) {
p += sprintf(p, "%s%d%s", sep, ui->curr_pegs->pegs[i],
ui->holds[i] ? "_" : "");
sep = ",";
}
*p++ = '\0';
assert(p - ret < 40 * ui->curr_pegs->npegs);
return sresize(ret, p - ret, char);
}
static void decode_ui(game_ui *ui, const char *encoding,
const game_state *state)
{
int i;
const char *p = encoding;
for (i = 0; i < ui->curr_pegs->npegs; i++) {
ui->curr_pegs->pegs[i] = atoi(p);
if (ui->curr_pegs->pegs[i] < 0 ||
ui->curr_pegs->pegs[i] > ui->params.ncolours)
ui->curr_pegs->pegs[i] = 0; /* Remove invalid pegs. */
while (*p && isdigit((unsigned char)*p)) p++;
if (*p == '_') {
/* NB: old versions didn't store holds */
ui->holds[i] = true;
p++;
} else
ui->holds[i] = false;
if (*p == ',') p++;
}
ui->markable = is_markable(&ui->params, ui->curr_pegs);
}
static void game_changed_state(game_ui *ui, const game_state *oldstate,
const game_state *newstate)
{
int i;
if (newstate->next_go < oldstate->next_go) {
sfree(ui->hint);
ui->hint = NULL;
}
/* Implement holds, clear other pegs.
* This does something that is arguably the Right Thing even
* for undo. */
for (i = 0; i < newstate->solution->npegs; i++) {
if (newstate->solved)
ui->holds[i] = false;
else
ui->holds[i] = newstate->holds[i];
if (newstate->solved || (newstate->next_go == 0) || !ui->holds[i]) {
ui->curr_pegs->pegs[i] = 0;
} else
ui->curr_pegs->pegs[i] =
newstate->guesses[newstate->next_go-1]->pegs[i];
}
ui->markable = is_markable(&newstate->params, ui->curr_pegs);
/* Clean up cursor position */
if (!ui->markable && ui->peg_cur == newstate->solution->npegs)
ui->peg_cur = 0;
}
static const char *current_key_label(const game_ui *ui,
const game_state *state, int button)
{
if (state->solved) return "";
if (button == CURSOR_SELECT) {
if (ui->peg_cur == state->params.npegs) return "Submit";
return "Place";
}
if (button == CURSOR_SELECT2 && ui->peg_cur != state->params.npegs)
return "Hold";
return "";
}
#define PEGSZ (ds->pegsz)
#define PEGOFF (ds->pegsz + ds->gapsz)
#define HINTSZ (ds->hintsz)
#define HINTOFF (ds->hintsz + ds->gapsz)
#define GAP (ds->gapsz)
#define CGAP (ds->gapsz / 2)
#define PEGRAD (ds->pegrad)
#define HINTRAD (ds->hintrad)
#define COL_OX (ds->colx)
#define COL_OY (ds->coly)
#define COL_X(c) (COL_OX)
#define COL_Y(c) (COL_OY + (c)*PEGOFF)
#define COL_W PEGOFF
#define COL_H (ds->colours->npegs*PEGOFF)
#define GUESS_OX (ds->guessx)
#define GUESS_OY (ds->guessy)
#define GUESS_X(g,p) (GUESS_OX + (p)*PEGOFF)
#define GUESS_Y(g,p) (GUESS_OY + (g)*PEGOFF)
#define GUESS_W (ds->solution->npegs*PEGOFF)
#define GUESS_H (ds->nguesses*PEGOFF)
#define HINT_OX (GUESS_OX + GUESS_W + ds->gapsz)
#define HINT_OY (GUESS_OY + (PEGSZ - HINTOFF - HINTSZ) / 2)
#define HINT_X(g) HINT_OX
#define HINT_Y(g) (HINT_OY + (g)*PEGOFF)
#define HINT_W ((ds->hintw*HINTOFF) - GAP)
#define HINT_H GUESS_H
#define SOLN_OX GUESS_OX
#define SOLN_OY (GUESS_OY + GUESS_H + ds->gapsz + 2)
#define SOLN_W GUESS_W
#define SOLN_H PEGOFF
struct game_drawstate {
int nguesses;
pegrow *guesses; /* same size as state->guesses */
pegrow solution; /* only displayed if state->solved */
pegrow colours; /* length ncolours, not npegs */
int pegsz, hintsz, gapsz; /* peg size (diameter), etc. */
int pegrad, hintrad; /* radius of peg, hint */
int border;
int colx, coly; /* origin of colours vertical bar */
int guessx, guessy; /* origin of guesses */
int solnx, solny; /* origin of solution */
int hintw; /* no. of hint tiles we're wide per row */
int w, h;
bool started;
int solved;
int next_go;
blitter *blit_peg;
int drag_col, blit_ox, blit_oy;
};
static void set_peg(const game_params *params, game_ui *ui, int peg, int col)
{
ui->curr_pegs->pegs[peg] = col;
ui->markable = is_markable(params, ui->curr_pegs);
}
static int mark_pegs(pegrow guess, const pegrow solution, int ncols)
{
int nc_place = 0, nc_colour = 0, i, j;
assert(guess && solution && (guess->npegs == solution->npegs));
for (i = 0; i < guess->npegs; i++) {
if (guess->pegs[i] == solution->pegs[i]) nc_place++;
}
/* slight bit of cleverness: we have the following formula, from
* http://mathworld.wolfram.com/Mastermind.html that gives:
*
* nc_colour = sum(colours, min(#solution, #guess)) - nc_place
*
* I think this is due to Knuth.
*/
for (i = 1; i <= ncols; i++) {
int n_guess = 0, n_solution = 0;
for (j = 0; j < guess->npegs; j++) {
if (guess->pegs[j] == i) n_guess++;
if (solution->pegs[j] == i) n_solution++;
}
nc_colour += min(n_guess, n_solution);
}
nc_colour -= nc_place;
debug(("mark_pegs, %d pegs, %d right place, %d right colour",
guess->npegs, nc_place, nc_colour));
assert((nc_colour + nc_place) <= guess->npegs);
memset(guess->feedback, 0, guess->npegs*sizeof(int));
for (i = 0, j = 0; i < nc_place; i++)
guess->feedback[j++] = FEEDBACK_CORRECTPLACE;
for (i = 0; i < nc_colour; i++)
guess->feedback[j++] = FEEDBACK_CORRECTCOLOUR;
return nc_place;
}
static char *encode_move(const game_state *from, game_ui *ui)
{
char *buf, *p;
const char *sep;
int len, i;
len = ui->curr_pegs->npegs * 20 + 2;
buf = snewn(len, char);
p = buf;
*p++ = 'G';
sep = "";
for (i = 0; i < ui->curr_pegs->npegs; i++) {
p += sprintf(p, "%s%d%s", sep, ui->curr_pegs->pegs[i],
ui->holds[i] ? "_" : "");
sep = ",";
}
*p++ = '\0';
assert(p - buf <= len);
buf = sresize(buf, len, char);
return buf;
}
static void compute_hint(const game_state *state, game_ui *ui)
{
/* Suggest the lexicographically first row consistent with all
* previous feedback. This is not only a useful hint, but also
* a reasonable strategy if applied consistently. If the user
* uses hints in every turn, they may be able to intuit this
* strategy, or one similar to it. I (Jonas Kölker) came up
* with something close to it without seeing it in action. */
/* Some performance characteristics: I want to ask for each n,
* how many solutions are guessed in exactly n guesses if you
* use the hint in each turn.
*
* With 4 pegs and 6 colours you get the following histogram:
*
* 1 guesses: 1 solution
* 2 guesses: 4 solutions
* 3 guesses: 25 solutions
* 4 guesses: 108 solutions
* 5 guesses: 305 solutions
* 6 guesses: 602 solutions
* 7 guesses: 196 solutions
* 8 guesses: 49 solutions
* 9 guesses: 6 solutions
* (note: the tenth guess is never necessary.)
*
* With 5 pegs and 8 colours you get the following histogram:
*
* 1 guesses: 1 solution
* 2 guesses: 5 solutions
* 3 guesses: 43 solutions
* 4 guesses: 278 solutions
* 5 guesses: 1240 solutions
* 6 guesses: 3515 solutions
* 7 guesses: 7564 solutions
* 8 guesses: 14086 solutions
* 9 guesses: 4614 solutions
* 10 guesses: 1239 solutions
* 11 guesses: 175 solutions
* 12 guesses: 7 solutions
* 13 guesses: 1 solution
*
* The solution which takes too many guesses is {8, 8, 5, 6, 7}.
* The game ID is c8p5g12Bm:4991e5e41a. */
int mincolour = 1, maxcolour = 0, i, j;
/* For large values of npegs and ncolours, the lexicographically
* next guess make take a while to find. Finding upper and
* lower limits on which colours we have to consider will speed
* this up, as will caching our progress from one invocation to
* the next. The latter strategy works, since if we have ruled
* out a candidate we will never reverse this judgment in the
* light of new information. Removing information, i.e. undo,
* will require us to backtrack somehow. We backtrack by fully
* forgetting our progress (and recomputing it if required). */
for (i = 0; i < state->next_go; ++i)
for (j = 0; j < state->params.npegs; ++j)
if (state->guesses[i]->pegs[j] > maxcolour)
maxcolour = state->guesses[i]->pegs[j];
if (state->params.allow_multiple)
maxcolour = min(maxcolour + 1, state->params.ncolours);
else
maxcolour = min(maxcolour + state->params.npegs,
state->params.ncolours);
increase_mincolour:
for (i = 0; i < state->next_go; ++i) {
if (state->guesses[i]->feedback[0])
goto next_iteration;
for (j = 0; j < state->params.npegs; ++j)
if (state->guesses[i]->pegs[j] != mincolour)
goto next_iteration;
++mincolour;
goto increase_mincolour;
next_iteration:
;
}
if (!ui->hint) {
ui->hint = new_pegrow(state->params.npegs);
for (i = 0; i < state->params.npegs; ++i)
ui->hint->pegs[i] = 1;
}
while (ui->hint->pegs[0] <= state->params.ncolours) {
if (!is_markable(&state->params, ui->hint)) goto increment_pegrow;
for (i = 0; i < state->next_go; ++i) {
mark_pegs(ui->hint, state->guesses[i], maxcolour);
for (j = 0; j < state->params.npegs; ++j)
if (ui->hint->feedback[j] != state->guesses[i]->feedback[j])
goto increment_pegrow;
}
/* a valid guess was found; install it and return */
for (i = 0; i < state->params.npegs; ++i)
ui->curr_pegs->pegs[i] = ui->hint->pegs[i];
ui->markable = true;
ui->peg_cur = state->params.npegs;
ui->display_cur = true;
return;
increment_pegrow:
for (i = ui->hint->npegs;
++ui->hint->pegs[--i], i && ui->hint->pegs[i] > maxcolour;
ui->hint->pegs[i] = mincolour);
}
/* No solution is compatible with the given hints. Impossible! */
/* (hack new_game_desc to create invalid solutions to get here) */
/* For some values of npegs and ncolours, the hinting function takes a
* long time to complete. To visually indicate completion with failure,
* should it ever happen, update the ui in some trivial way. This gives
* the user a sense of broken(ish)ness and futility. */
if (!ui->display_cur) {
ui->display_cur = true;
} else if (state->params.npegs == 1) {
ui->display_cur = false;
} else {
ui->peg_cur = (ui->peg_cur + 1) % state->params.npegs;
}
}
static char *interpret_move(const game_state *from, game_ui *ui,
const game_drawstate *ds,
int x, int y, int button)
{
int over_col = 0; /* one-indexed */
int over_guess = -1; /* zero-indexed */
int over_past_guess_y = -1; /* zero-indexed */
int over_past_guess_x = -1; /* zero-indexed */
bool over_hint = false;
char *ret = NULL;
int guess_ox = GUESS_X(from->next_go, 0);
int guess_oy = GUESS_Y(from->next_go, 0);
/*
* Enable or disable labels on colours.
*/
if (button == 'l' || button == 'L') {
ui->show_labels = !ui->show_labels;
return MOVE_UI_UPDATE;
}
if (from->solved) return NULL;
if (x >= COL_OX && x < (COL_OX + COL_W) &&
y >= COL_OY && y < (COL_OY + COL_H)) {
over_col = ((y - COL_OY) / PEGOFF) + 1;
assert(over_col >= 1 && over_col <= ds->colours->npegs);
} else if (x >= guess_ox &&
y >= guess_oy && y < (guess_oy + GUESS_H)) {
if (x < (guess_ox + GUESS_W)) {
over_guess = (x - guess_ox) / PEGOFF;
assert(over_guess >= 0 && over_guess < ds->solution->npegs);
} else {
over_hint = true;
}
} else if (x >= guess_ox && x < (guess_ox + GUESS_W) &&
y >= GUESS_OY && y < guess_oy) {
over_past_guess_y = (y - GUESS_OY) / PEGOFF;
over_past_guess_x = (x - guess_ox) / PEGOFF;
assert(over_past_guess_y >= 0 && over_past_guess_y < from->next_go);
assert(over_past_guess_x >= 0 && over_past_guess_x < ds->solution->npegs);
}
debug(("make_move: over_col %d, over_guess %d, over_hint %d,"
" over_past_guess (%d,%d)", over_col, over_guess, over_hint,
over_past_guess_x, over_past_guess_y));
assert(ds->blit_peg);
/* mouse input */
if (button == LEFT_BUTTON) {
if (over_col > 0) {
ui->drag_col = over_col;
ui->drag_opeg = -1;
debug(("Start dragging from colours"));
} else if (over_guess > -1) {
int col = ui->curr_pegs->pegs[over_guess];
if (col) {
ui->drag_col = col;
ui->drag_opeg = over_guess;
debug(("Start dragging from a guess"));
}
} else if (over_past_guess_y > -1) {
int col =
from->guesses[over_past_guess_y]->pegs[over_past_guess_x];
if (col) {
ui->drag_col = col;
ui->drag_opeg = -1;
debug(("Start dragging from a past guess"));
}
}
if (ui->drag_col) {
ui->drag_x = x;
ui->drag_y = y;
debug(("Start dragging, col = %d, (%d,%d)",
ui->drag_col, ui->drag_x, ui->drag_y));
ret = MOVE_UI_UPDATE;
}
} else if (button == LEFT_DRAG && ui->drag_col) {
ui->drag_x = x;
ui->drag_y = y;
debug(("Keep dragging, (%d,%d)", ui->drag_x, ui->drag_y));
ret = MOVE_UI_UPDATE;
} else if (button == LEFT_RELEASE && ui->drag_col) {
if (over_guess > -1) {
debug(("Dropping colour %d onto guess peg %d",
ui->drag_col, over_guess));
set_peg(&from->params, ui, over_guess, ui->drag_col);
} else {
if (ui->drag_opeg > -1) {
debug(("Removing colour %d from peg %d",
ui->drag_col, ui->drag_opeg));
set_peg(&from->params, ui, ui->drag_opeg, 0);
}
}
ui->drag_col = 0;
ui->drag_opeg = -1;
ui->display_cur = false;
debug(("Stop dragging."));
ret = MOVE_UI_UPDATE;
} else if (button == RIGHT_BUTTON) {
if (over_guess > -1) {
/* we use ths feedback in the game_ui to signify
* 'carry this peg to the next guess as well'. */
ui->holds[over_guess] ^= 1;
ret = MOVE_UI_UPDATE;
}
} else if (button == LEFT_RELEASE && over_hint && ui->markable) {
/* NB this won't trigger if on the end of a drag; that's on
* purpose, in case you drop by mistake... */
ret = encode_move(from, ui);
}
/* keyboard input */
if (IS_CURSOR_MOVE(button)) {
int maxcur = from->params.npegs;
if (ui->markable) maxcur++;
ret = move_cursor(button, &ui->peg_cur, &ui->colour_cur,
maxcur, from->params.ncolours,
false, &ui->display_cur);
} else if (button == 'h' || button == 'H' || button == '?') {
compute_hint(from, ui);
ret = MOVE_UI_UPDATE;
} else if (button == CURSOR_SELECT) {
ui->display_cur = true;
if (ui->peg_cur == from->params.npegs) {
ret = encode_move(from, ui);
} else {
set_peg(&from->params, ui, ui->peg_cur, ui->colour_cur+1);
ret = MOVE_UI_UPDATE;
}
} else if (((button >= '1' && button <= '0' + from->params.ncolours) ||
(button == '0' && from->params.ncolours == 10)) &&
ui->peg_cur < from->params.npegs) {
ui->display_cur = true;
/* Number keys insert a peg and advance the cursor. */
set_peg(&from->params, ui, ui->peg_cur,
button == '0' ? 10 : button - '0');
if (ui->peg_cur + 1 < from->params.npegs + ui->markable)
ui->peg_cur++;
ret = MOVE_UI_UPDATE;
} else if (button == 'D' || button == 'd' || button == '\b') {
if (!ui->display_cur || ui->curr_pegs->pegs[ui->peg_cur] != 0) {
ui->display_cur = true;
set_peg(&from->params, ui, ui->peg_cur, 0);
ret = MOVE_UI_UPDATE;
} else
ret = MOVE_NO_EFFECT;
} else if (button == CURSOR_SELECT2) {
if (ui->peg_cur == from->params.npegs)
return NULL;
ui->display_cur = true;
ui->holds[ui->peg_cur] ^= 1;
ret = MOVE_UI_UPDATE;
}
return ret;
}
static game_state *execute_move(const game_state *from, const char *move)
{
int i, nc_place;
game_state *ret;
const char *p;
if (!strcmp(move, "S")) {
ret = dup_game(from);
ret->solved = -1;
return ret;
} else if (move[0] == 'G') {
/* No guesses are allowed once the game is solved. */
if (from->solved) return NULL;
p = move+1;
ret = dup_game(from);
for (i = 0; i < from->solution->npegs; i++) {
int val = atoi(p);
int min_colour = from->params.allow_blank? 0 : 1;
if (val < min_colour || val > from->params.ncolours) {
free_game(ret);
return NULL;
}
ret->guesses[from->next_go]->pegs[i] = atoi(p);
while (*p && isdigit((unsigned char)*p)) p++;
if (*p == '_') {
ret->holds[i] = true;
p++;
} else
ret->holds[i] = false;
if (*p == ',') p++;
}
nc_place = mark_pegs(ret->guesses[from->next_go], ret->solution, ret->params.ncolours);
if (nc_place == ret->solution->npegs) {
ret->solved = +1; /* win! */
} else {