1 /****************************************************************************
2 * Copyright (c) 1998-2012,2013 Free Software Foundation, Inc. *
4 * Permission is hereby granted, free of charge, to any person obtaining a *
5 * copy of this software and associated documentation files (the *
6 * "Software"), to deal in the Software without restriction, including *
7 * without limitation the rights to use, copy, modify, merge, publish, *
8 * distribute, distribute with modifications, sublicense, and/or sell *
9 * copies of the Software, and to permit persons to whom the Software is *
10 * furnished to do so, subject to the following conditions: *
12 * The above copyright notice and this permission notice shall be included *
13 * in all copies or substantial portions of the Software. *
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
16 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
17 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
18 * IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
19 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
20 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
21 * THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
23 * Except as contained in this notice, the name(s) of the above copyright *
24 * holders shall not be used in advertising or otherwise to promote the *
25 * sale, use or other dealings in this Software without prior written *
27 ****************************************************************************/
29 * Knight's Tour - a brain game
31 * The original of this game was anonymous. It had an unbelievably bogus
32 * interface, you actually had to enter square coordinates! Redesign by
33 * Eric S. Raymond <esr@snark.thyrsus.com> July 22 1995. Mouse support
34 * added September 20th 1995.
36 * $Id: knight.c,v 1.35 2013/02/03 00:16:59 tom Exp $
39 #include <test.priv.h>
45 /* where to start the instructions */
53 /* notification line */
56 /* virtual color values */
61 #define CX(x) (2 + 4 * (x))
62 #define CY(y) (1 + 2 * (y))
63 #define cellmove(y, x) wmove(boardwin, CY(y), CX(x))
64 #define CXINV(x) (((x) - 1) / 4)
65 #define CYINV(y) (((y) - 2) / 2)
71 static WINDOW *boardwin; /* the board window */
72 static WINDOW *helpwin; /* the help window */
73 static WINDOW *msgwin; /* the message window */
74 static cell history[BDEPTH * BWIDTH + 1]; /* choice history */
75 static chtype minus = '-'; /* possible-move character */
77 static chtype plus = '+'; /* cursor hot-spot character */
78 static chtype trail = '#'; /* trail character */
79 static int movecount; /* count of moves so far */
80 static int trialcount; /* count of trials so far */
81 static short board[BDEPTH][BWIDTH]; /* the squares */
101 setlocale(LC_ALL, "");
103 srand((unsigned) getpid());
105 cbreak(); /* immediate char return */
106 noecho(); /* no immediate echo */
107 boardwin = newwin(BDEPTH * 2 + 1, BWIDTH * 4 + 1, BOARDY, BOARDX);
108 helpwin = newwin(0, 0, INSTRY, INSTRX);
109 msgwin = newwin(1, INSTRX - 1, NOTIFYY, 0);
110 scrollok(msgwin, TRUE);
111 keypad(boardwin, TRUE);
114 int bg = COLOR_BLACK;
117 #if HAVE_USE_DEFAULT_COLORS
118 if (use_default_colors() == OK)
122 (void) init_pair(TRAIL_COLOR, (short) COLOR_CYAN, (short) bg);
123 (void) init_pair(PLUS_COLOR, (short) COLOR_RED, (short) bg);
124 (void) init_pair(MINUS_COLOR, (short) COLOR_GREEN, (short) bg);
126 trail |= (chtype) COLOR_PAIR(TRAIL_COLOR);
127 plus |= (chtype) COLOR_PAIR(PLUS_COLOR);
128 minus |= (chtype) COLOR_PAIR(MINUS_COLOR);
130 #ifdef NCURSES_MOUSE_VERSION
131 (void) mousemask(BUTTON1_CLICKED, (mmask_t *) NULL);
132 #endif /* NCURSES_MOUSE_VERSION */
139 /* game explanation -- initial help screen */
141 (void) waddstr(helpwin, "Knight's move is a solitaire puzzle. Your\n");
142 (void) waddstr(helpwin, "objective is to visit each square of the \n");
143 (void) waddstr(helpwin, "chessboard exactly once by making knight's\n");
144 (void) waddstr(helpwin, "moves (one square right or left followed \n");
145 (void) waddstr(helpwin, "by two squares up or down, or two squares \n");
146 (void) waddstr(helpwin, "right or left followed by one square up or\n");
147 (void) waddstr(helpwin, "down). You may start anywhere.\n\n");
149 (void) waddstr(helpwin, "Use arrow keys to move the cursor around.\n");
150 (void) waddstr(helpwin, "When you want to move your knight to the \n");
151 (void) waddstr(helpwin, "cursor location, press <space> or Enter.\n");
152 (void) waddstr(helpwin, "Illegal moves will be rejected with an \n");
153 (void) waddstr(helpwin, "audible beep.\n\n");
154 (void) waddstr(helpwin, "The program will detect if you solve the\n");
155 (void) waddstr(helpwin, "puzzle; also inform you when you run out\n");
156 (void) waddstr(helpwin, "of legal moves.\n\n");
158 MvWAddStr(helpwin, NOTIFYY - INSTRY, 0,
159 "Press `?' to go to keystroke help.");
164 /* keystroke help screen */
166 (void) waddstr(helpwin, "Possible moves are shown with `-'.\n\n");
168 (void) waddstr(helpwin, "You can move around with the arrow keys or\n");
169 (void) waddstr(helpwin, "with the rogue/hack movement keys. Other\n");
170 (void) waddstr(helpwin, "commands allow you to undo moves or redraw.\n");
171 (void) waddstr(helpwin, "Your mouse may work; try left-button to\n");
172 (void) waddstr(helpwin, "move to the square under the pointer.\n\n");
174 (void) waddstr(helpwin, "x,q -- exit y k u 7 8 9\n");
175 (void) waddstr(helpwin, "r -- redraw screen \\|/ \\|/ \n");
176 (void) waddstr(helpwin, "bksp -- undo move h-+-l 4-+-6\n");
177 (void) waddstr(helpwin, "a -- autojump /|\\ /|\\ \n");
178 (void) waddstr(helpwin, " b j n 1 2 3\n");
180 (void) waddstr(helpwin, "\nYou can place your knight on the selected\n");
181 (void) waddstr(helpwin, "square with spacebar, Enter, or the keypad\n");
182 (void) waddstr(helpwin, "center key. Use F/B to review the path.\n");
184 MvWAddStr(helpwin, NOTIFYY - INSTRY, 0,
185 "Press `?' to go to game explanation");
189 show_help(bool * keyhelp)
203 chksqr(int r1, int c1)
205 if ((r1 < 0) || (r1 > BDEPTH - 1))
207 if ((c1 < 0) || (c1 > BWIDTH - 1))
209 return ((!board[r1][c1]) ? TRUE : FALSE);
213 chkmoves(int rw, int col)
214 /* check to see if valid moves are available */
218 for (n = 0; n < SIZEOF(offsets); n++)
219 if (chksqr(rw + offsets[n].y, col + offsets[n].x))
229 MvAddStr(0, 20, "KNIGHT'S MOVE -- a logical solitaire");
231 move(BOARDY, BOARDX);
232 waddch(boardwin, ACS_ULCORNER);
233 for (j = 0; j < 7; j++) {
234 waddch(boardwin, ACS_HLINE);
235 waddch(boardwin, ACS_HLINE);
236 waddch(boardwin, ACS_HLINE);
237 waddch(boardwin, ACS_TTEE);
239 waddch(boardwin, ACS_HLINE);
240 waddch(boardwin, ACS_HLINE);
241 waddch(boardwin, ACS_HLINE);
242 waddch(boardwin, ACS_URCORNER);
244 for (i = 1; i < BDEPTH; i++) {
245 move(BOARDY + i * 2 - 1, BOARDX);
246 waddch(boardwin, ACS_VLINE);
247 for (j = 0; j < BWIDTH; j++) {
248 waddch(boardwin, ' ');
249 waddch(boardwin, ' ');
250 waddch(boardwin, ' ');
251 waddch(boardwin, ACS_VLINE);
253 move(BOARDY + i * 2, BOARDX);
254 waddch(boardwin, ACS_LTEE);
255 for (j = 0; j < BWIDTH - 1; j++) {
256 waddch(boardwin, ACS_HLINE);
257 waddch(boardwin, ACS_HLINE);
258 waddch(boardwin, ACS_HLINE);
259 waddch(boardwin, ACS_PLUS);
261 waddch(boardwin, ACS_HLINE);
262 waddch(boardwin, ACS_HLINE);
263 waddch(boardwin, ACS_HLINE);
264 waddch(boardwin, ACS_RTEE);
267 move(BOARDY + i * 2 - 1, BOARDX);
268 waddch(boardwin, ACS_VLINE);
269 for (j = 0; j < BWIDTH; j++) {
270 waddch(boardwin, ' ');
271 waddch(boardwin, ' ');
272 waddch(boardwin, ' ');
273 waddch(boardwin, ACS_VLINE);
276 move(BOARDY + i * 2, BOARDX);
277 waddch(boardwin, ACS_LLCORNER);
278 for (j = 0; j < BWIDTH - 1; j++) {
279 waddch(boardwin, ACS_HLINE);
280 waddch(boardwin, ACS_HLINE);
281 waddch(boardwin, ACS_HLINE);
282 waddch(boardwin, ACS_BTEE);
284 waddch(boardwin, ACS_HLINE);
285 waddch(boardwin, ACS_HLINE);
286 waddch(boardwin, ACS_HLINE);
287 waddch(boardwin, ACS_LRCORNER);
291 mark_possibles(int prow, int pcol, chtype mark)
295 for (n = 0; n < SIZEOF(offsets); n++) {
296 if (chksqr(prow + offsets[n].y, pcol + offsets[n].x)) {
297 cellmove(prow + offsets[n].y, pcol + offsets[n].x);
298 waddch(boardwin, mark);
304 find_next_move(int *y, int *x)
315 oldy = history[movecount - 1].y;
316 oldx = history[movecount - 1].x;
317 for (j = 0; j < SIZEOF(offsets) * 2; j++) {
318 k = j % SIZEOF(offsets);
319 newy = oldy + offsets[k].y;
320 newx = oldx + offsets[k].x;
321 if (chksqr(newy, newx)) {
327 } else if (found >= 0) {
336 *y = oldy + offsets[next].y;
337 *x = oldx + offsets[next].x;
345 count_next_moves(int y, int x)
350 wprintw(msgwin, "\nMove %d", movecount);
351 for (j = 0; j < SIZEOF(offsets); j++) {
352 int newy = y + offsets[j].y;
353 int newx = x + offsets[j].x;
354 if (chksqr(newy, newx)) {
358 wprintw(msgwin, ", gives %d choices", count);
363 unmarkcell(int row, int column)
365 cellmove(row, column);
366 waddch(boardwin, '\b');
367 waddch(boardwin, ' ');
368 waddch(boardwin, minus);
369 waddch(boardwin, ' ');
373 markcell(chtype tchar, int row, int column)
375 cellmove(row, column);
376 waddch(boardwin, '\b');
377 waddch(boardwin, tchar);
378 waddch(boardwin, tchar);
379 waddch(boardwin, tchar);
383 drawmove(chtype tchar, int oldy, int oldx, int row, int column)
384 /* place the stars, update board & currents */
386 if (movecount <= 1) {
389 for (i = 0; i < BDEPTH; i++) {
390 for (j = 0; j < BWIDTH; j++) {
391 if (movecount == 0) {
395 if (winch(boardwin) == minus)
396 waddch(boardwin, movecount ? ' ' : minus);
401 markcell(tchar, oldy, oldx);
402 mark_possibles(oldy, oldx, ' ');
405 if (row >= 0 && column >= 0) {
406 markcell(trail, row, column);
407 mark_possibles(row, column, minus);
408 board[row][column] = TRUE;
411 wprintw(msgwin, "\nMove %d", movecount);
412 if (trialcount != movecount)
413 wprintw(msgwin, " (%d tries)", trialcount);
427 evalmove(int row, int column)
432 else if (board[row][column] == TRUE) {
433 waddstr(msgwin, "\nYou've already been there.");
436 int rdif = iabs(row - history[movecount - 1].y);
437 int cdif = iabs(column - history[movecount - 1].x);
439 if (!((rdif == 1) && (cdif == 2)) && !((rdif == 2) && (cdif == 1))) {
440 waddstr(msgwin, "\nThat's not a legal knight's move.");
453 for (i = 0; i < BDEPTH; i++)
454 for (j = 0; j < BWIDTH; j++)
455 if (board[i][j] != 0)
457 return (count == (BWIDTH * BDEPTH) ? -1 : count);
461 no_previous_move(void)
463 waddstr(msgwin, "\nNo previous move.");
471 bool keyhelp; /* TRUE if keystroke help is up */
473 int lastcol = 0; /* last location visited */
476 int review = 0; /* review history */
477 int rw = 0, col = 0; /* current row and column */
480 /* clear screen and draw board */
486 wnoutrefresh(stdscr);
487 wnoutrefresh(helpwin);
488 wnoutrefresh(msgwin);
489 wnoutrefresh(boardwin);
493 for (i = 0; i < BDEPTH; i++) {
494 for (j = 0; j < BWIDTH; j++) {
499 memset(history, 0, sizeof(history));
500 history[0].y = history[0].x = -1;
501 history[1].y = history[1].x = -1;
502 lastrow = lastcol = -2;
509 if (rw != lastrow || col != lastcol) {
510 if (lastrow >= 0 && lastcol >= 0) {
511 cellmove(lastrow, lastcol);
512 if (board[lastrow][lastcol])
513 waddch(boardwin, trail);
515 waddch(boardwin, oldch);
519 oldch = winch(boardwin);
525 waddch(boardwin, plus);
530 switch (wgetch(boardwin)) {
534 ny = rw + BDEPTH - 1;
547 nx = col + BWIDTH - 1;
558 ny = rw + BDEPTH - 1;
559 nx = col + BWIDTH - 1;
565 nx = col + BWIDTH - 1;
570 ny = rw + BDEPTH - 1;
580 #ifdef NCURSES_MOUSE_VERSION
586 if (myevent.y >= CY(0) && myevent.y <= CY(BDEPTH)
587 && myevent.x >= CX(0) && myevent.x <= CX(BWIDTH)) {
588 nx = CXINV(myevent.x);
589 ny = CYINV(myevent.y);
597 #endif /* NCURSES_MOUSE_VERSION */
603 if (evalmove(rw, col)) {
605 history[movecount - 1].y,
606 history[movecount - 1].x,
608 history[movecount].y = (short) rw;
609 history[movecount].x = (short) col;
613 if (!chkmoves(rw, col)) {
614 if (completed() < 0) {
615 waddstr(msgwin, "\nYou won.");
618 "\nNo further moves are possible.");
630 if (movecount <= 0) {
632 } else if (movecount <= 1) {
633 ny = history[movecount].y;
634 nx = history[movecount].x;
635 if (nx < 0 || ny < 0) {
636 ny = (lastrow >= 0) ? lastrow : 0;
637 nx = (lastcol >= 0) ? lastcol : 0;
640 board[ny][nx] = FALSE;
642 drawmove(' ', ny, nx, -1, -1);
647 int oldy = history[movecount - 1].y;
648 int oldx = history[movecount - 1].x;
650 if (!board[rw][col]) {
652 waddch(boardwin, ' ');
655 board[oldy][oldx] = FALSE;
657 ny = history[movecount - 1].y;
658 nx = history[movecount - 1].x;
659 if (nx < 0 || ny < 0) {
663 drawmove(' ', oldy, oldx, ny, nx);
665 /* avoid problems if we just changed the current cell */
666 cellmove(lastrow, lastcol);
667 oldch = winch(boardwin);
674 if (find_next_move(&ny, &nx))
675 count_next_moves(ny, nx);
683 ny = history[movecount - review - 1].y;
684 nx = history[movecount - review - 1].x;
691 if (review < movecount - 2) {
693 ny = history[movecount - review - 1].y;
694 nx = history[movecount - review - 1].x;
703 clearok(curscr, TRUE);
704 wnoutrefresh(stdscr);
705 wnoutrefresh(boardwin);
706 wnoutrefresh(msgwin);
707 wnoutrefresh(helpwin);
729 if ((count = completed()) < 0)
730 wprintw(msgwin, "\nYou won. Care to try again? ");
732 wprintw(msgwin, "\n%d squares filled. Try again? ", count);
735 (tolower(wgetch(msgwin)) == 'y');
739 main(int argc GCC_UNUSED, char *argv[]GCC_UNUSED)
746 ExitProgram(EXIT_SUCCESS);
749 /* knight.c ends here */