-
Notifications
You must be signed in to change notification settings - Fork 0
/
sudoku.c
1018 lines (848 loc) · 23 KB
/
sudoku.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
/****************************************************************************
* sudoku.c
*
* Computer Science 50
* Problem Set 4
*
* Implements the game of Sudoku.
* (Hacker edition.)
***************************************************************************/
#include "sudoku.h"
#include <ctype.h>
#include <ncurses.h>
#include <signal.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
// macro for processing control characters
#define CTRL(x) ((x) & ~0140)
// size of each int (in bytes) in *.bin files
#define INTSIZE 4
// wrapper for our game's globals
struct
{
// the current level
char *level;
// the game's board
int board[9][9];
// a table indicating witch cells are blocked for change
bool blocked[9][9];
// a table indicating witch cells are invalid in the board
bool valid[9][9];
// the board's number
int number;
// the board's top-left coordinates
int top, left;
// the cursor's current location between (0,0) and (8,8)
int y, x;
// indicate wether the game has been won
bool is_won;
// if user has made changes
bool has_undo;
// position of last change and it's value;
int undo_value, undo_y, undo_x;
// time game has started
time_t start_time;
time_t end_time;
bool show_time;
} g;
// prototypes
void draw_grid(void);
void draw_borders(void);
void draw_logo(void);
void draw_numbers(void);
void hide_banner(void);
bool load_board(void);
void handle_signal(int signum);
void log_move(int ch);
void redraw_all(void);
bool restart_game(void);
void show_banner(char *b);
void show_cursor(void);
void shutdown(void);
bool startup(void);
void change_number(int n);
void clear_number(void);
void check_win(void);
void check_valid(int n);
void undo_last(void);
void show_time(void);
void hint(void);
/*
* Main driver for the game.
*/
int
main(int argc, char *argv[])
{
// define usage
const char *usage = "Usage: sudoku n00b|l33t [#]\n";
// ensure that number of arguments is as expected
if (argc != 2 && argc != 3)
{
fprintf(stderr, usage);
return 1;
}
// ensure that level is valid
if (strcmp(argv[1], "debug") == 0)
g.level = "debug";
else if (strcmp(argv[1], "n00b") == 0)
g.level = "n00b";
else if (strcmp(argv[1], "l33t") == 0)
g.level = "l33t";
else
{
fprintf(stderr, usage);
return 2;
}
// n00b and l33t levels have 1024 boards; debug level has 9
int max = (strcmp(g.level, "debug") == 0) ? 9 : 1024;
// ensure that #, if provided, is in [1, max]
if (argc == 3)
{
// ensure n is integral
char c;
if (sscanf(argv[2], " %d %c", &g.number, &c) != 1)
{
fprintf(stderr, usage);
return 3;
}
// ensure n is in [1, max]
if (g.number < 1 || g.number > max)
{
fprintf(stderr, "That board # does not exist!\n");
return 4;
}
// seed PRNG with # so that we get same sequence of boards
srand(g.number);
}
else
{
// seed PRNG with current time so that we get any sequence of boards
srand(time(NULL));
// choose a random n in [1, max]
g.number = rand() % max + 1;
}
// start up ncurses
if (!startup())
{
fprintf(stderr, "Error starting up ncurses!\n");
return 5;
}
// register handler for SIGWINCH (SIGnal WINdow CHanged)
signal(SIGWINCH, (void (*)(int)) handle_signal);
// start the first game
if (!restart_game())
{
shutdown();
fprintf(stderr, "Could not load board from disk!\n");
return 6;
}
redraw_all();
g.show_time = false;
// let the user play!
int ch;
do
{
// refresh the screen
refresh();
// get user's input
ch = getch();
// capitalize input to simplify cases
ch = toupper(ch);
show_time();
show_cursor();
// process user's input
switch (ch)
{
// start a new game
case 'N':
g.number = rand() % max + 1;
if (!restart_game())
{
shutdown();
fprintf(stderr, "Could not load board from disk!\n");
return 6;
}
break;
// restart current game
case 'R':
if (!restart_game())
{
shutdown();
fprintf(stderr, "Could not load board from disk!\n");
return 6;
}
break;
// let user manually redraw screen with ctrl-L
case CTRL('l'):
redraw_all();
break;
case KEY_DOWN:
g.y = (g.y + 1 + 9) % 9;
show_cursor();
break;
case KEY_UP:
g.y = (g.y - 1 + 9) % 9;
show_cursor();
break;
case KEY_LEFT:
g.x = (g.x - 1 + 9) % 9;
show_cursor();
break;
case KEY_RIGHT:
g.x = (g.x + 1 + 9) % 9;
show_cursor();
break;
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
case '8':
case '9':
change_number(ch - '0');
break;
case '0':
case '.':
case KEY_DC:
case KEY_BACKSPACE:
clear_number();
break;
case 'U':
case CTRL('z'):
undo_last();
break;
case 'T':
g.show_time = !g.show_time;
show_time();
show_cursor();
break;
case 'H':
hint();
break;
}
// log input (and board's state) if any was received this iteration
if (ch != ERR)
log_move(ch);
}
while (ch != 'Q');
// shut down ncurses
shutdown();
// tidy up the screen (using ANSI escape sequences)
printf("\033[2J");
printf("\033[%d;%dH", 0, 0);
// that's all folks
printf("\nkthxbai!\n\n");
return 0;
}
/*
* Insert the given number in the board at the cursor's position.
*/
void change_number(int n)
{
if (g.is_won)
return;
if (!g.blocked[g.y][g.x]) {
//set undo data before change
g.has_undo = true;
g.undo_value = g.board[g.y][g.x];
g.undo_y = g.y;
g.undo_x = g.x;
// change board according to user input
g.board[g.y][g.x] = n;
check_valid(n);
check_win();
draw_numbers();
} else {
show_banner("You cannot change this number.");
}
show_cursor();
}
/*
* Clear the number at the cursor's position;
*/
void clear_number(void)
{
if (g.is_won)
return;
if (!g.blocked[g.y][g.x]) {
// set undo data before change
g.has_undo = true;
g.undo_value = g.board[g.y][g.x];
g.undo_y = g.y;
g.undo_x = g.x;
// clear value and make cell valid
g.board[g.y][g.x] = 0;
g.valid[g.y][g.x] = true;
hide_banner();
draw_numbers();
} else {
show_banner("You cannot erase this number.");
}
show_cursor();
}
/*
* Check if the user has won the game
*/
void check_win(void)
{
// start assuming the game is won, if not,
g.is_won = true;
// check if there are unfilled cells
for (int y = 0; y < 9; y++) {
for (int x = 0; x < 9; x++) {
if (g.board[y][x] == 0) {
g.is_won = false;
return;
}
}
}
// check for repeats in a row
for (int y = 0; y < 9; y++) {
for (int x1 = 0; x1 < 9; x1++) {
for (int x2 = x1 + 1; x2 < 9; x2++) {
if (g.board[y][x1] == g.board[y][x2]) {
g.is_won = false;
return;
}
}
}
}
// check for repeats in a column
for (int x = 0; x < 9; x++) {
for (int y1 = 0; y1 < 9; y1++) {
for (int y2 = y1 + 1; y2 < 9; y2++) {
if (g.board[y1][x] == g.board[y2][x]) {
g.is_won = false;
return;
}
}
}
}
// check for repeats inside a square
for (int cell = 0; cell < 9; cell++) {
// cell is treated as linear [0..8] and converted to y,x coordinates
int cellx = (cell % 3) * 3;
int celly = (cell / 3) * 3;
for (int pos1 = 0; pos1 < 9; pos1++) {
// do the same for pos1 and pos2 (below) and add cell coordinates
int pos1x = pos1 % 3 + cellx;
int pos1y = pos1 / 3 + celly;
for (int pos2 = pos1 + 1; pos2 < 9; pos2++) {
int pos2x = pos2 % 3 + cellx;
int pos2y = pos2 / 3 + celly;
if (g.board[pos1y][pos1x] == g.board[pos2y][pos2x]) {
g.is_won = false;
return;
}
}
}
}
// if code hasn't returned, game is won: congratulate the user
show_banner("CONGRATULATIONS! You have won!");
g.end_time = time(NULL);
show_cursor();
}
/*
* Verifies if number entered is valid, i.e.,
* it's not repeated in the column, row or square.
*/
void check_valid(int n)
{
//TODO: Implement check for valid number change
bool is_valid = true;
// check if n is repeated in cursor row
for (int x = 0; x < 9; x++) {
if (x != g.x && g.board[g.y][x] == n) { // skip cursor position
is_valid = false;
//g.valid[g.y][x] = false;
}
}
// check if n is repeated in cursor column
for (int y = 0; y < 9; y++) {
if (y != g.y && g.board[y][g.x] == n) { // skip cursor position
is_valid = false;
//g.valid[y][g.x] = false;
}
}
// check for repeats inside a square
// cell is treated as linear [0..8] and converted to y,x coordinates
int celly = (g.y / 3) * 3;
int cellx = (g.x / 3) * 3;
for (int pos = 0; pos < 9; pos++) {
// convert pos to coordinate inside square
int posx = pos % 3 + cellx;
int posy = pos / 3 + celly;
if (posy != g.y && posx != g.x && g.board[posy][posx] == n) {
is_valid = false;
//g.valid[posy][posx] = false;
}
}
if (is_valid) {
hide_banner();
g.valid[g.y][g.x] = true;
} else {
g.valid[g.y][g.x] = false;
show_banner("Invalid entry. Repeated number");
}
show_cursor();
//TODO: Remake check so that all row, column or square turns red and is cleared accordingly
}
/*
* Undo last user's change
*/
void undo_last(void)
{
if (g.has_undo && !g.is_won) {
g.y = g.undo_y;
g.x = g.undo_x;
g.has_undo = false;
if (g.undo_value == 0)
clear_number();
else
change_number(g.undo_value);
}
}
/*
* Display a clock with time elapsed since current game started
*/
void show_time(void)
{
if (g.show_time) {
char s[20];
if (!g.is_won)
g.end_time = time(NULL);
int elapsed = g.end_time - g.start_time;
int seconds = elapsed % 60;
elapsed /= 60;
int minutes = elapsed % 60;
elapsed /= 60;
int hours = elapsed;
sprintf(s, "%d:%02d:%02d", hours, minutes, seconds);
mvaddstr(g.top - 2, g.left, s);
} else {
mvaddstr(g.top - 2, g.left, " ");
}
}
/*
* Try to fill a position in the game for the user
*/
void hint(void)
{
// create a table for possible numbers for each position
bool possible[9][9][9];
// fill table with true for empty positions and false for taken positions
for (int y = 0; y < 9; y++) {
for (int x = 0; x < 9; x++) {
for (int n = 0; n < 9; n++) {
possible[y][x][n] = (g.board[y][x] == 0);
}
}
}
// check filled positions and mark not possible on empty ones
for (int y = 0; y < 9; y++) {
for (int x = 0; x < 9; x++) {
int num = g.board[y][x] - 1; //adjust for matrix index
if (num >= 0) {
// mark as not possible for column
for (int y2 = 0; y2 < 9; y2++) {
possible[y2][x][num] = false;
}
// mark as not possible for row
for (int x2 = 0; x2 < 9; x2++) {
possible[y][x2][num] = false;
}
// mark as not possible for square
for (int pos = 0; pos < 9; pos++) {
int posy = (y / 3) * 3 + (pos / 3);
int posx = (x / 3) * 3 + (pos % 3);
possible[posy][posx][num] = false;
}
}
}
}
// try to fill a position
for (int y = 0; y < 9; y++) {
for (int x = 0; x < 9; x++) {
int count_possibles = 0, num = -1;
for (int n = 0; n < 9; n++) { // count how many possible numbers in this position
if (possible[y][x][n]) {
count_possibles++;
num = n;
}
}
if (count_possibles == 1) { // if only one is possible, fill it
g.y = y;
g.x = x;
change_number(num+1);
draw_numbers();
show_cursor();
return;
}
}
}
//TODO: Current version can only find solutions for simples puzzles
}
/*
* Draw's the game's board.
*/
void
draw_grid(void)
{
// get window's dimensions
int maxy, maxx;
getmaxyx(stdscr, maxy, maxx);
// determine where top-left corner of board belongs
g.top = maxy/2 - 7;
g.left = maxx/2 - 30;
// enable color if possible
if (has_colors())
attron(COLOR_PAIR(PAIR_GRID));
// print grid
for (int i = 0 ; i < 3 ; ++i )
{
mvaddstr(g.top + 0 + 4 * i, g.left, "+-------+-------+-------+");
mvaddstr(g.top + 1 + 4 * i, g.left, "| | | |");
mvaddstr(g.top + 2 + 4 * i, g.left, "| | | |");
mvaddstr(g.top + 3 + 4 * i, g.left, "| | | |");
}
mvaddstr(g.top + 4 * 3, g.left, "+-------+-------+-------+" );
// remind user of level and #
char reminder[maxx+1];
sprintf(reminder, " playing %s #%d", g.level, g.number);
mvaddstr(g.top + 14, g.left + 25 - strlen(reminder), reminder);
// disable color if possible
if (has_colors())
attroff(COLOR_PAIR(PAIR_GRID));
}
/*
* Draws game's borders.
*/
void
draw_borders(void)
{
// get window's dimensions
int maxy, maxx;
getmaxyx(stdscr, maxy, maxx);
// enable color if possible (else b&w highlighting)
if (has_colors())
{
attron(A_PROTECT);
attron(COLOR_PAIR(PAIR_BORDER));
}
else
attron(A_REVERSE);
// draw borders
for (int i = 0; i < maxx; i++)
{
mvaddch(0, i, ' ');
mvaddch(maxy-1, i, ' ');
}
// draw header
char header[maxx+1];
sprintf(header, "%s by %s", TITLE, AUTHOR);
mvaddstr(0, (maxx - strlen(header)) / 2, header);
// draw footer
mvaddstr(maxy-1, 1, "[N]ew Game [R]estart Game [H]int");
mvaddstr(maxy-1, maxx-13, "[Q]uit Game");
// disable color if possible (else b&w highlighting)
if (has_colors())
attroff(COLOR_PAIR(PAIR_BORDER));
else
attroff(A_REVERSE);
}
/*
* Draws game's logo. Must be called after draw_grid has been
* called at least once.
*/
void
draw_logo(void)
{
// determine top-left coordinates of logo
int top = g.top + 2;
int left = g.left + 30;
// enable color if possible
if (has_colors())
attron(COLOR_PAIR(PAIR_LOGO));
// draw logo
mvaddstr(top + 0, left, " .___ __ ");
mvaddstr(top + 1, left, " ________ __ __| _/____ | | ____ __ ");
mvaddstr(top + 2, left, " / ___/ | \\/ __ |/ _ \\| |/ / | \\");
mvaddstr(top + 3, left, " \\___ \\| | / /_/ ( <_> ) <| | /");
mvaddstr(top + 4, left, "/____ >____/\\____ |\\____/|__|_ \\____/ ");
mvaddstr(top + 5, left, " \\/ \\/ \\/ ");
// sign logo
char signature[3+strlen(AUTHOR)+1];
sprintf(signature, "by %s", AUTHOR);
mvaddstr(top + 7, left + 35 - strlen(signature) - 1, signature);
// disable color if possible
if (has_colors())
attroff(COLOR_PAIR(PAIR_LOGO));
}
/*
* Draw's game's numbers. Must be called after draw_grid has been
* called at least once.
*/
void
draw_numbers(void)
{
// iterate over board's numbers
for (int i = 0; i < 9; i++)
{
for (int j = 0; j < 9; j++)
{
short attrpair = 0;
if (has_colors()) {
if (g.is_won)
attrpair = COLOR_PAIR(PAIR_NUMBER_WON);
else if (g.valid[i][j] == false)
attrpair = COLOR_PAIR(PAIR_NUMBER_INVALID);
else if (g.blocked[i][j] == false)
attrpair = COLOR_PAIR(PAIR_NUMBER_USER);
else
attrpair = COLOR_PAIR(PAIR_GRID);
attron(attrpair);
}
// determine char
char c = (g.board[i][j] == 0) ? '.' : g.board[i][j] + '0';
mvaddch(g.top + i + 1 + i/3, g.left + 2 + 2*(j + j/3), c);
refresh();
if (has_colors() && attrpair != 0) {
attroff(attrpair);
}
}
}
}
/*
* Designed to handles signals (e.g., SIGWINCH).
*/
void
handle_signal(int signum)
{
// handle a change in the window (i.e., a resizing)
if (signum == SIGWINCH)
redraw_all();
// re-register myself so this signal gets handled in future too
signal(signum, (void (*)(int)) handle_signal);
}
/*
* Hides banner.
*/
void
hide_banner(void)
{
// get window's dimensions
int maxy, maxx;
getmaxyx(stdscr, maxy, maxx);
// overwrite banner with spaces
for (int i = 0; i < maxx; i++)
mvaddch(g.top + 16, i, ' ');
}
/*
* Loads current board from disk, returning true iff successful.
*/
bool
load_board(void)
{
// open file with boards of specified level
char filename[strlen(g.level) + 5];
sprintf(filename, "%s.bin", g.level);
FILE *fp = fopen(filename, "rb");
if (fp == NULL)
return false;
// determine file's size
fseek(fp, 0, SEEK_END);
int size = ftell(fp);
// ensure file is of expected size
if (size % (81 * INTSIZE) != 0)
{
fclose(fp);
return false;
}
// compute offset of specified board
int offset = ((g.number - 1) * 81 * INTSIZE);
// seek to specified board
fseek(fp, offset, SEEK_SET);
// read board into memory
if (fread(g.board, 81 * INTSIZE, 1, fp) != 1)
{
fclose(fp);
return false;
}
// w00t
fclose(fp);
for (int i = 0; i < 9; i++) {
for (int j = 0; j < 9; j++) {
g.blocked[i][j] = ( g.board[i][j] != 0 );
g.valid[i][j] = true;
}
}
return true;
}
/*
* Logs input and board's state to log.txt to facilitate automated tests.
*/
void
log_move(int ch)
{
// open log
FILE *fp = fopen("log.txt", "a");
if (fp == NULL)
return;
// log input
fprintf(fp, "%d\n", ch);
// log board
for (int i = 0; i < 9; i++)
{
for (int j = 0; j < 9; j++)
fprintf(fp, "%d", g.board[i][j]);
fprintf(fp, "\n");
}
// that's it
fclose(fp);
}
/*
* (Re)draws everything on the screen.
*/
void
redraw_all(void)
{
// reset ncurses
endwin();
refresh();
// clear screen
clear();
// re-draw everything
draw_borders();
draw_grid();
draw_logo();
draw_numbers();
// show cursor
show_cursor();
}
/*
* (Re)starts current game, returning true iff succesful.
*/
bool
restart_game(void)
{
// reload current game
if (!load_board())
return false;
// game has just started, not won
g.is_won = false;
// keep track of the time the game has been started
g.start_time = time(NULL);
// redraw board
draw_grid();
draw_numbers();
show_time();
// get window's dimensions
int maxy, maxx;
getmaxyx(stdscr, maxy, maxx);
// hide preview messages
hide_banner();
// move cursor to board's center
g.y = g.x = 4;
show_cursor();
// remove log, if any
remove("log.txt");
// initialize undo data
g.has_undo = false;
g.undo_value = -1;
g.undo_y = -1;
g.undo_x = -1;
// w00t
return true;
}
/*
* Shows cursor at (g.y, g.x).
*/
void
show_cursor(void)
{
// restore cursor's location
move(g.top + g.y + 1 + g.y/3, g.left + 2 + 2*(g.x + g.x/3));
}
/*
* Shows a banner. Must be called after show_grid has been
* called at least once.
*/
void
show_banner(char *b)
{
// enable color if possible
if (has_colors())
attron(COLOR_PAIR(PAIR_BANNER));
// determine where top-left corner of board belongs
mvaddstr(g.top + 16, g.left + 64 - strlen(b), b);
// disable color if possible
if (has_colors())
attroff(COLOR_PAIR(PAIR_BANNER));
}
/*
* Shuts down ncurses.
*/
void
shutdown(void)
{
endwin();
}
/*
* Starts up ncurses. Returns true iff successful.
*/
bool
startup(void)
{
// initialize ncurses
if (initscr() == NULL)
return false;
// prepare for color if possible
if (has_colors())
{
// enable color
if (start_color() == ERR || attron(A_PROTECT) == ERR)
{
endwin();
return false;
}
// initialize pairs of colors
if (init_pair(PAIR_BANNER, FG_BANNER, BG_BANNER) == ERR ||
init_pair(PAIR_GRID, FG_GRID, BG_GRID) == ERR ||
init_pair(PAIR_BORDER, FG_BORDER, BG_BORDER) == ERR ||
init_pair(PAIR_LOGO, FG_LOGO, BG_LOGO) == ERR ||
init_pair(PAIR_NUMBER_WON, FG_NUMBER_WON, BG_NUMBER_WON) == ERR ||
init_pair(PAIR_NUMBER_INVALID, FG_NUMBER_INVALID, BG_NUMBER_INVALID) == ERR ||
init_pair(PAIR_NUMBER_USER, FG_NUMBER_USER, BG_NUMBER_USER) == ERR)
{
endwin();
return false;
}
}
// don't echo keyboard input
if (noecho() == ERR)
{
endwin();
return false;
}
// disable line buffering and certain signals
if (raw() == ERR)