aboutsummaryrefslogtreecommitdiff
path: root/contrib/ncurses/test/knight.c
blob: ad923b42b1de37a08ac68ee026f4afef8d442519 (plain) (blame)
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
/*
 * Knight's Tour - a brain game
 *
 * The original of this game was anonymous.  It had an unbelievably bogus
 * interface, you actually had to enter square coordinates!  Redesign by
 * Eric S. Raymond <esr@snark.thyrsus.com> July 22 1995.  Mouse support
 * added September 20th 1995.
 *
 * $Id: knight.c,v 1.15 1999/11/13 23:39:10 tom Exp $
 */

#include <test.priv.h>

#include <ctype.h>
#include <signal.h>
#include <string.h>

/* board size */
#define BDEPTH	8
#define BWIDTH	8

/* where to start the instructions */
#define INSTRY	2
#define INSTRX	35

/* corner of board */
#define BOARDY	2
#define BOARDX	0

/* notification line */
#define NOTIFYY	21

/* virtual color values */
#define TRAIL_COLOR	1
#define PLUS_COLOR	2
#define MINUS_COLOR	3

#define CX(x)	(2 + 4 * (x))
#define CY(y)	(1 + 2 * (y))
#define cellmove(y, x)	wmove(boardwin, CY(y), CX(x))
#define CXINV(x)	(((x) - 1) / 4)
#define CYINV(y)	(((y) - 2) / 2)

typedef struct
{
    short	x, y;
}
cell;

static short	board[BDEPTH][BWIDTH];	/* the squares */
static int	rw,col;			/* current row and column */
static int	lastrow,lastcol;   	/* last location visited */
static cell	history[BDEPTH*BWIDTH];	/* choice history */
static int	movecount;		/* count of moves so far */
static WINDOW	*boardwin;		/* the board window */
static WINDOW	*helpwin;		/* the help window */
static WINDOW	*msgwin;		/* the message window */
static chtype	trail = '#';		/* trail character */
static chtype	plus = '+';		/* cursor hot-spot character */
static chtype	minus = '-';		/* possible-move character */
static chtype	oldch;

static void init(void);
static void play(void);
static void dosquares(void);
static void drawmove(char, int, int, int, int);
static bool evalmove(int, int);
static bool chkmoves(void);
static bool chksqr(int, int);
static int  iabs(int);

int main(
	int argc GCC_UNUSED,
	char *argv[] GCC_UNUSED)
{
    init();

    play();

    endwin();
    return EXIT_SUCCESS;
}

static void init (void)
{
    srand ((unsigned)getpid());
    initscr ();
    cbreak ();			/* immediate char return */
    noecho ();			/* no immediate echo */
    boardwin = newwin(BDEPTH * 2 + 1, BWIDTH * 4 + 1, BOARDY, BOARDX);
    helpwin = newwin(0, 0, INSTRY, INSTRX);
    msgwin = newwin(1, INSTRX-1, NOTIFYY, 0);
    scrollok(msgwin, TRUE);
    keypad(boardwin, TRUE);

    if (has_colors())
    {
	int bg = COLOR_BLACK;

	start_color();
#ifdef HAVE_USE_DEFAULT_COLORS
	if (use_default_colors() == OK)
	    bg = -1;
#endif

	(void) init_pair(TRAIL_COLOR, COLOR_CYAN,  bg);
	(void) init_pair(PLUS_COLOR,  COLOR_RED,   bg);
	(void) init_pair(MINUS_COLOR, COLOR_GREEN, bg);

	trail |= COLOR_PAIR(TRAIL_COLOR);
	plus  |= COLOR_PAIR(PLUS_COLOR);
	minus |= COLOR_PAIR(MINUS_COLOR);
    }

#ifdef NCURSES_MOUSE_VERSION
    (void) mousemask(BUTTON1_CLICKED, (mmask_t *)NULL);
#endif /* NCURSES_MOUSE_VERSION*/

    oldch = minus;
}

static void help1(void)
/* game explanation -- initial help screen */
{
    (void)waddstr(helpwin, "Knight's move is a solitaire puzzle.  Your\n");
    (void)waddstr(helpwin, "objective is to visit each square of the  \n");
    (void)waddstr(helpwin, "chessboard exactly once by making knight's\n");
    (void)waddstr(helpwin, "moves (one square right or left followed  \n");
    (void)waddstr(helpwin, "by two squares up or down, or two squares \n");
    (void)waddstr(helpwin, "right or left followed by one square up or\n");
    (void)waddstr(helpwin, "down).  You may start anywhere.\n\n");

    (void)waddstr(helpwin, "Use arrow keys to move the cursor around.\n");
    (void)waddstr(helpwin, "When you want to move your knight to the \n");
    (void)waddstr(helpwin, "cursor location, press <space> or Enter.\n");
    (void)waddstr(helpwin, "Illegal moves will be rejected with an  \n");
    (void)waddstr(helpwin, "audible beep.\n\n");
    (void)waddstr(helpwin, "The program will detect if you solve the\n");
    (void)waddstr(helpwin, "puzzle; also inform you when you run out\n");
    (void)waddstr(helpwin, "of legal moves.\n\n");

    (void)mvwaddstr(helpwin, NOTIFYY-INSTRY, 0,
		    "Press `?' to go to keystroke help."); 
}

static void help2(void)
/* keystroke help screen */
{
    (void)waddstr(helpwin, "Possible moves are shown with `-'.\n\n");

    (void)waddstr(helpwin, "You can move around with the arrow keys or\n");
    (void)waddstr(helpwin, "with the rogue/hack movement keys.  Other\n");
    (void)waddstr(helpwin, "commands allow you to undo moves or redraw.\n");
    (void)waddstr(helpwin, "Your mouse may work; try left-button to\n");
    (void)waddstr(helpwin, "move to the square under the pointer.\n\n");

    (void)waddstr(helpwin, "x,q -- exit             y k u    7 8 9\n");
    (void)waddstr(helpwin, "r -- redraw screen       \\|/      \\|/ \n");
    (void)waddstr(helpwin, "u -- undo move          h-+-l    4-+-6\n");
    (void)waddstr(helpwin, "                         /|\\      /|\\ \n");
    (void)waddstr(helpwin, "                        b j n    1 2 3\n");

    (void)waddstr(helpwin,"\nYou can place your knight on the selected\n");
    (void)waddstr(helpwin, "square with spacebar, Enter, or the keypad\n");
    (void)waddstr(helpwin, "center key.  You can quit with `x' or `q'.\n");

    (void)mvwaddstr(helpwin, NOTIFYY-INSTRY, 0,
		    "Press `?' to go to game explanation"); 
}

static void play (void)
/* play the game */
{
    bool		keyhelp; /* TRUE if keystroke help is up */
    int	c, ny = 0, nx = 0;
    int i, j, count;

    do {
	   /* clear screen and draw board */
	   werase(boardwin);
	   werase(helpwin);
	   werase(msgwin);
	   dosquares();
	   help1();
	   wnoutrefresh(stdscr);
	   wnoutrefresh(helpwin);
	   wnoutrefresh(msgwin);
	   wnoutrefresh(boardwin);
	   doupdate();

	   for (i = 0; i < BDEPTH; i++)
	       for (j = 0; j < BWIDTH; j++)
	       {
		   board[i][j] = FALSE;
		   cellmove(i, j);
		   waddch(boardwin, minus);
	       }
	   memset(history, '\0', sizeof(history));
	   history[0].y = history[0].x = -1;
	   lastrow = lastcol = -2;
	   movecount = 1;
	   keyhelp = FALSE;

	   for (;;)
	   {
	       if (rw != lastrow || col != lastcol)
	       {
		   if (lastrow >= 0 && lastcol >= 0)
		   {
		       cellmove(lastrow, lastcol);
		       if (board[lastrow][lastcol])
			   waddch(boardwin, trail);
		       else
			   waddch(boardwin, oldch);
		   }

		   cellmove(rw, col);
		   oldch = winch(boardwin);

		   lastrow = rw;
		   lastcol= col;
	       }
	       cellmove(rw, col);
	       waddch(boardwin, plus);
	       cellmove(rw, col);

	       wrefresh(msgwin);

	       c = wgetch(boardwin);

	       werase(msgwin);

	       switch (c)
	       {
	       case 'k': case '8':
	       case KEY_UP:
		   ny = rw+BDEPTH-1; nx = col;
		   break;
	       case 'j': case '2':
	       case KEY_DOWN:
		   ny = rw+1;        nx = col;
		   break;
	       case 'h': case '4':
	       case KEY_LEFT:
		   ny = rw;          nx = col+BWIDTH-1;
		   break;
	       case 'l': case '6':
	       case KEY_RIGHT:
		   ny = rw;          nx = col+1;
		   break;
	       case 'y': case '7':
	       case KEY_A1:
		   ny = rw+BDEPTH-1; nx = col+BWIDTH-1;
		   break;
	       case 'b': case '1':
	       case KEY_C1:
		   ny = rw+1;        nx = col+BWIDTH-1;
		   break;
	       case 'u': case '9':
	       case KEY_A3:
		   ny = rw+BDEPTH-1; nx = col+1;
		   break;
	       case 'n': case '3':
	       case KEY_C3:
		   ny = rw+1;        nx = col+1;
		   break;

#ifdef NCURSES_MOUSE_VERSION
	       case KEY_MOUSE:
		   {
		       MEVENT	myevent;

		       getmouse(&myevent);
		       if (myevent.y >= CY(0) && myevent.y <= CY(BDEPTH)
			   && myevent.x >= CX(0) && myevent.x <= CX(BWIDTH))
		       {
			   nx = CXINV(myevent.x);
			   ny = CYINV(myevent.y);
			   ungetch('\n');
			   break;
		       }
		       else
		       {
			   beep();
			   continue;
		       }
		   }
#endif /* NCURSES_MOUSE_VERSION */

	       case KEY_B2:
	       case '\n':
	       case ' ':
		   if (evalmove(rw, col))
		   {
		       drawmove(trail,
				history[movecount-1].y, history[movecount-1].x,
				rw, col);
		       history[movecount].y = rw; 
		       history[movecount].x = col; 
		       movecount++;

		       if (!chkmoves()) 
			   goto dropout;
		   }
		   else
		       beep();
		   break;

	       case KEY_REDO:
	       case '\f':
	       case 'r':
		   clearok(curscr, TRUE);
		   wnoutrefresh(stdscr);
		   wnoutrefresh(boardwin);
		   wnoutrefresh(msgwin);
		   wnoutrefresh(helpwin);
		   doupdate();
		   break;

	       case KEY_UNDO:
	       case KEY_BACKSPACE:
	       case '\b':
		   if (movecount == 1)
		   {
		       ny = lastrow;
		       nx = lastcol;
		       waddstr(msgwin, "\nNo previous move.");
		       beep();
		   }
		   else
		   {
		       int oldy = history[movecount-1].y;
		       int oldx = history[movecount-1].x;

		       board[oldy][oldx] = FALSE;
		       --movecount;
		       ny = history[movecount-1].y;
		       nx = history[movecount-1].x;
		       drawmove(' ', oldy, oldx, ny, nx);

		       /* avoid problems if we just changed the current cell */
		       cellmove(lastrow, lastcol);
		       oldch = winch(boardwin);
		   }
		   break;

	       case 'q':
	       case 'x':
		   goto dropout;

	       case '?':
		   werase(helpwin);
		   if (keyhelp)
		   {
		       help1();
		       keyhelp = FALSE;
		   }
		   else
		   {
		       help2();
		       keyhelp = TRUE;
		   }
		   wrefresh(helpwin);
		   break;

	       default:
		   beep();
		   break;
	       }

	       col = nx % BWIDTH;
	       rw = ny % BDEPTH;
	   }

       dropout:
	   count = 0;
	   for (i = 0; i < BDEPTH; i++)
	       for (j = 0; j < BWIDTH; j++)
		   if (board[i][j] != 0)
		       count += 1;
	   if (count == (BWIDTH * BDEPTH))
	       wprintw(msgwin, "\nYou won.  Care to try again? ");
	   else
	       wprintw(msgwin, "\n%d squares filled.  Try again? ", count);
       } while
	   (tolower(wgetch(msgwin)) == 'y');
}

static void dosquares (void)
{
    int i, j;

    mvaddstr(0, 20, "KNIGHT'S MOVE -- a logical solitaire");

    move(BOARDY,BOARDX);
    waddch(boardwin, ACS_ULCORNER);
    for (j = 0; j < 7; j++)
    {
	waddch(boardwin, ACS_HLINE);
	waddch(boardwin, ACS_HLINE);
	waddch(boardwin, ACS_HLINE);
	waddch(boardwin, ACS_TTEE);
    }
    waddch(boardwin, ACS_HLINE);
    waddch(boardwin, ACS_HLINE);
    waddch(boardwin, ACS_HLINE);
    waddch(boardwin, ACS_URCORNER);

    for (i = 1; i < BDEPTH; i++)
    {
	move(BOARDY + i * 2 - 1, BOARDX);
	waddch(boardwin, ACS_VLINE); 
	for (j = 0; j < BWIDTH; j++)
	{
	    waddch(boardwin, ' ');
	    waddch(boardwin, ' ');
	    waddch(boardwin, ' ');
	    waddch(boardwin, ACS_VLINE);
	}
	move(BOARDY + i * 2, BOARDX);
	waddch(boardwin, ACS_LTEE); 
	for (j = 0; j < BWIDTH - 1; j++)
	{
	    waddch(boardwin, ACS_HLINE);
	    waddch(boardwin, ACS_HLINE);
	    waddch(boardwin, ACS_HLINE);
	    waddch(boardwin, ACS_PLUS);
	}
	waddch(boardwin, ACS_HLINE);
	waddch(boardwin, ACS_HLINE);
	waddch(boardwin, ACS_HLINE);
	waddch(boardwin, ACS_RTEE);
    }

    move(BOARDY + i * 2 - 1, BOARDX);
    waddch(boardwin, ACS_VLINE);
    for (j = 0; j < BWIDTH; j++)
    {
	waddch(boardwin, ' ');
	waddch(boardwin, ' ');
	waddch(boardwin, ' ');
	waddch(boardwin, ACS_VLINE);
    }

    move(BOARDY + i * 2, BOARDX);
    waddch(boardwin, ACS_LLCORNER);
    for (j = 0; j < BWIDTH - 1; j++)
    {
	waddch(boardwin, ACS_HLINE);
	waddch(boardwin, ACS_HLINE);
	waddch(boardwin, ACS_HLINE);
	waddch(boardwin, ACS_BTEE);
    }
    waddch(boardwin, ACS_HLINE);
    waddch(boardwin, ACS_HLINE);
    waddch(boardwin, ACS_HLINE);
    waddch(boardwin, ACS_LRCORNER);
}

static void mark_possibles(int prow, int pcol, chtype mark)
{
    if (chksqr(prow+2,pcol+1)){cellmove(prow+2,pcol+1);waddch(boardwin,mark);};
    if (chksqr(prow+2,pcol-1)){cellmove(prow+2,pcol-1);waddch(boardwin,mark);};
    if (chksqr(prow-2,pcol+1)){cellmove(prow-2,pcol+1);waddch(boardwin,mark);};
    if (chksqr(prow-2,pcol-1)){cellmove(prow-2,pcol-1);waddch(boardwin,mark);};
    if (chksqr(prow+1,pcol+2)){cellmove(prow+1,pcol+2);waddch(boardwin,mark);};
    if (chksqr(prow+1,pcol-2)){cellmove(prow+1,pcol-2);waddch(boardwin,mark);};
    if (chksqr(prow-1,pcol+2)){cellmove(prow-1,pcol+2);waddch(boardwin,mark);};
    if (chksqr(prow-1,pcol-2)){cellmove(prow-1,pcol-2);waddch(boardwin,mark);};
}

static void drawmove(char tchar, int oldy, int oldx, int row, int column)
/* place the stars, update board & currents */
{
    if (movecount <= 1)
    {
	int i, j;

	for (i = 0; i < BDEPTH; i++)
	    for (j = 0; j < BWIDTH; j++)
	    {
		cellmove(i, j);
		if (winch(boardwin) == minus)
		    waddch(boardwin, movecount ? ' ' : minus);
	    }
    }
    else
    {
	cellmove(oldy, oldx);
	waddch(boardwin, '\b');
	waddch(boardwin, tchar);
	waddch(boardwin, tchar);
	waddch(boardwin, tchar);
	mark_possibles(oldy, oldx, ' ');
    }

    if (row != -1 && column != -1)
    {
	cellmove(row, column);
	waddch(boardwin, '\b');
	waddch(boardwin, trail);
	waddch(boardwin, trail);
	waddch(boardwin, trail);
	mark_possibles(row, column, minus);
	board[row][column] = TRUE;
    }

    wprintw(msgwin, "\nMove %d", movecount);
}

static bool evalmove(int row, int column)
/* evaluate move */
{
    if (movecount == 1)
	return(TRUE);
    else if (board[row][column] == TRUE)
    {
	waddstr(msgwin, "\nYou've already been there.");
	return(FALSE);
    }
    else
    {
	int	rdif = iabs(row  - history[movecount-1].y);
	int	cdif = iabs(column - history[movecount-1].x);

	if (!((rdif == 1) && (cdif == 2)) && !((rdif == 2) && (cdif == 1)))
	{
	    waddstr(msgwin, "\nThat's not a legal knight's move.");
	    return(FALSE);
	}
    }

    return(TRUE);
}

static bool chkmoves (void)
/* check to see if valid moves are available */
{
    if (chksqr(rw+2,col+1)) return(TRUE);
    if (chksqr(rw+2,col-1)) return(TRUE);
    if (chksqr(rw-2,col+1)) return(TRUE);
    if (chksqr(rw-2,col-1)) return(TRUE);
    if (chksqr(rw+1,col+2)) return(TRUE);
    if (chksqr(rw+1,col-2)) return(TRUE);
    if (chksqr(rw-1,col+2)) return(TRUE);
    if (chksqr(rw-1,col-2)) return(TRUE);
    return (FALSE);
}

static int iabs(int num)
{
	if (num < 0) return (-num);
		else return (num);
}

static bool chksqr (int r1, int c1)
{
    if ((r1 < 0) || (r1 > BDEPTH - 1))
	return(FALSE);
    if ((c1 < 0) || (c1 > BWIDTH - 1))
	return(FALSE);
    return ((!board[r1][c1]) ? TRUE : FALSE);
}

/* knight.c ends here */