]>
git.gir.st - solVItaire.git/blob - sol.c
1 #define _DEFAULT_SOURCE
14 #define MAX_HIDDEN 6 /*how many cards are turned over at most in a tableu pile*/
15 #define MAX_STOCK 24 /*how many cards can be in the stock at most (=@start)*/
17 #define PILE_SIZE MAX_HIDDEN+NUM_RANKS
21 #define MAX_STOCK 50 /*how many cards can be dealt onto the piles*/
23 #define PILE_SIZE DECK_SIZE*NUM_DECKS /* no maximum stack size in spider :/ */
26 #define get_suit(card) \
27 ((card-1) % NUM_SUITS)
28 #define get_rank(card) \
29 ((card-1) / NUM_SUITS)
30 #define get_color(card) \
31 ((get_suit(card) ^ get_suit(card)>>1) & 1)
34 card_t s
[MAX_STOCK
]; /* stock */
35 int z
; /* stock size */
36 int w
; /* waste; index into stock (const -1 in spider) */
37 card_t f
[NUM_DECKS
*NUM_SUITS
][PILE_SIZE
]; /* foundation */
38 card_t t
[NUM_PILES
][PILE_SIZE
]; /* tableu piles */
40 /* NOTE: .f & .t are overloaded; 64+n=foundation; 128+n=stock */
41 int f
; /* pile cards were taken from */
42 int t
; /* pile cards were moved to */
43 int n
; /* number of cards moved */
50 int m
; /* difficulty mode */
52 const struct scheme
* s
;
56 /* stores a function pointer for every takeable action; called by game loop */
57 int (*action
[NUM_PLACES
][10])(int,int) = {
59 /* 1 2 3 4 5 6 7 stk wst fnd*/
60 /* 1 */ { t2f
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, nop
, nop
, t2f
},
61 /* 2 */ { t2t
, t2f
, t2t
, t2t
, t2t
, t2t
, t2t
, nop
, nop
, t2f
},
62 /* 3 */ { t2t
, t2t
, t2f
, t2t
, t2t
, t2t
, t2t
, nop
, nop
, t2f
},
63 /* 4 */ { t2t
, t2t
, t2t
, t2f
, t2t
, t2t
, t2t
, nop
, nop
, t2f
},
64 /* 5 */ { t2t
, t2t
, t2t
, t2t
, t2f
, t2t
, t2t
, nop
, nop
, t2f
},
65 /* 6 */ { t2t
, t2t
, t2t
, t2t
, t2t
, t2f
, t2t
, nop
, nop
, t2f
},
66 /* 7 */ { t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2f
, nop
, nop
, t2f
},
67 /*stk*/ { nop
, nop
, nop
, nop
, nop
, nop
, nop
, nop
, s2w
, nop
},
68 /*wst*/ { w2t
, w2t
, w2t
, w2t
, w2t
, w2t
, w2t
, w2s
, w2f
, w2f
},
69 /*fnd*/ { f2t
, f2t
, f2t
, f2t
, f2t
, f2t
, f2t
, nop
, nop
, nop
},
71 /* 1 2 3 4 5 6 7 8 9 10*/
72 /* 1 */ { nop
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
},
73 /* 2 */ { t2t
, nop
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
},
74 /* 3 */ { t2t
, t2t
, nop
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
},
75 /* 4 */ { t2t
, t2t
, t2t
, nop
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
},
76 /* 5 */ { t2t
, t2t
, t2t
, t2t
, nop
, t2t
, t2t
, t2t
, t2t
, t2t
},
77 /* 6 */ { t2t
, t2t
, t2t
, t2t
, t2t
, nop
, t2t
, t2t
, t2t
, t2t
},
78 /* 7 */ { t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, nop
, t2t
, t2t
, t2t
},
79 /* 8 */ { t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, nop
, t2t
, t2t
},
80 /* 9 */ { t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, nop
, t2t
},
81 /*10 */ { t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, t2t
, nop
},
82 /*stk*/ { s2t
, s2t
, s2t
, s2t
, s2t
, s2t
, s2t
, s2t
, s2t
, s2t
},
87 int main(int argc
, char** argv
) {
88 (void) argc
;(void) argv
;
89 op
.s
= &unicode_large_color
;
91 op
.m
= MEDIUM
; //TODO: make configurable
95 sol(); //TODO: restart, etc.
105 switch (get_cmd(&from
, &to
)) {
107 switch (action
[from
][to
](from
,to
)) {
109 case ERR
: visbell(); break;
113 getchar(); /* consume char left by win_anim() */
117 case CMD_QUIT
: return;
123 int find_top(card_t
* pile
) {
125 for(i
=PILE_SIZE
-1; i
>=0 && !pile
[i
]; i
--);
128 void turn_over(card_t
* pile
) {
129 int top
= find_top(pile
);
130 if (pile
[top
] < 0) pile
[top
] *= -1;
132 int check_won(void) {
133 for (int pile
= 0; pile
< NUM_DECKS
*NUM_SUITS
; pile
++)
134 if (f
.f
[pile
][NUM_RANKS
-1] == NO_CARD
) return 0;
138 void win_anim(void) {
139 printf ("\033[?25l"); /* hide cursor */
141 /* set cursor to random location */
142 int row
= 1+random()%(24-op
.s
->width
);
143 int col
= 1+random()%(80-op
.s
->height
);
145 /* draw random card */
146 int face
= 1 + random() % 52;
147 for (int l
= 0; l
< op
.s
->height
; l
++) {
148 printf ("\033[%d;%dH", row
+l
, col
);
149 printf ("%s", op
.s
->card
[face
][l
]);
153 /* exit on keypress */
154 struct pollfd p
= {STDIN_FILENO
, POLLIN
, 0};
155 if (poll (&p
, 1, 80)) goto fin
;
158 printf ("\033[?25h"); /* show cursor */
161 // takeable actions {{{
163 card_t
stack_take(void) { /*NOTE: assert(f.w >= 0) */
164 card_t card
= f
.s
[f
.w
];
165 /* move stack one over, so there are no gaps in it: */
166 for (int i
= f
.w
; i
< f
.z
-1; i
++)
169 f
.w
--; /* make previous card visible again */
172 int t2f(int from
, int to
) { /* tableu to foundation */
173 (void) to
; //don't need
174 int top_from
= find_top(f
.t
[from
]);
175 to
= get_suit(f
.t
[from
][top_from
]);
176 int top_to
= find_top(f
.f
[to
]);
177 if ((top_to
< 0 && get_rank(f
.t
[from
][top_from
]) == RANK_A
)
178 || (top_to
>= 0 && get_rank(f
.f
[to
][top_to
]) == get_rank(f
.t
[from
][top_from
])-1)) {
179 f
.f
[to
][top_to
+1] = f
.t
[from
][top_from
];
180 f
.t
[from
][top_from
] = NO_CARD
;
181 turn_over(f
.t
[from
]);
182 if (check_won()) return WON
;
186 int w2f(int from
, int to
) { /* waste to foundation */
187 (void) from
; (void) to
; //don't need
188 if (f
.w
< 0) return ERR
;
189 to
= get_suit(f
.s
[f
.w
]);
190 int top_to
= find_top(f
.f
[to
]);
191 if ((top_to
< 0 && get_rank(f
.s
[f
.w
]) == RANK_A
)
192 || (top_to
>= 0 && get_rank(f
.f
[to
][top_to
]) == get_rank(f
.s
[f
.w
])-1)) {
193 f
.f
[to
][top_to
+1] = stack_take();
194 if (check_won()) return WON
;
199 int s2w(int from
, int to
) { /* stock to waste */
200 (void) from
; (void) to
; //don't need
201 if (f
.z
== 0) return ERR
;
203 if (f
.w
== f
.z
) f
.w
= -1;
206 int w2s(int from
, int to
) { /* waste to stock (undoes stock to waste) */
207 (void) from
; (void) to
; //don't need
208 if (f
.z
== 0) return ERR
;
210 if (f
.w
< -1) f
.w
= f
.z
-1;
213 int f2t(int from
, int to
) { /* foundation to tableu */
214 int top_to
= find_top(f
.t
[to
]);
215 printf ("take from (1-4): "); fflush (stdout
);
216 from
= getchar() - '1';
217 if (from
< 0 || from
> 3) return ERR
;
218 int top_from
= find_top(f
.f
[from
]);
220 if ((get_color(f
.t
[to
][top_to
]) != get_color(f
.f
[from
][top_from
]))
221 && (get_rank(f
.t
[to
][top_to
]) == get_rank(f
.f
[from
][top_from
])+1)) {
222 f
.t
[to
][top_to
+1] = f
.f
[from
][top_from
];
223 f
.f
[from
][top_from
] = NO_CARD
;
227 int w2t(int from
, int to
) { /* waste to tableu */
228 (void) from
; //don't need
229 int top_to
= find_top(f
.t
[to
]);
230 if (((get_color(f
.t
[to
][top_to
]) != get_color(f
.s
[f
.w
]))
231 && (get_rank(f
.t
[to
][top_to
]) == get_rank(f
.s
[f
.w
])+1))
232 || (top_to
< 0 && get_rank(f
.s
[f
.w
]) == RANK_K
)) {
233 f
.t
[to
][top_to
+1] = stack_take();
237 int t2t(int from
, int to
) { /* tableu to tableu */
238 int top_to
= find_top(f
.t
[to
]);
239 int top_from
= find_top(f
.t
[from
]);
240 for (int i
= top_from
; i
>=0; i
--) {
241 if (((get_color(f
.t
[to
][top_to
]) != get_color(f
.t
[from
][i
]))
242 && (get_rank(f
.t
[to
][top_to
]) == get_rank(f
.t
[from
][i
])+1)
243 && f
.t
[from
][i
] > NO_CARD
) /* card face up? */
244 || (top_to
< 0 && get_rank(f
.t
[from
][i
]) == RANK_K
)) {
245 /* move cards [i..top_from] to their destination */
246 for (;i
<= top_from
; i
++) {
248 f
.t
[to
][top_to
] = f
.t
[from
][i
];
249 f
.t
[from
][i
] = NO_CARD
;
251 turn_over(f
.t
[from
]);
255 return ERR
; /* no such move possible */
258 int is_consecutive (card_t
* pile
, int pos
) {
259 if (pos
+1 >= PILE_SIZE
) return 1; /* card is last */
260 if (pile
[pos
+1] == NO_CARD
) return 1; /* card is first */
262 if (get_rank(pile
[pos
+1]) != get_rank(pile
[pos
])-1) return 0; /*rank consecutive?*/
263 if (get_suit(pile
[pos
+1]) != get_suit(pile
[pos
])) return 0; /*same suit?*/
267 void remove_if_complete (card_t
* pile
) { //TODO: cleanup
268 static int foundation
= 0; /* where to put pile onto (1 set per stack)*/
269 /* test if K...A complete; move to foundation if so */
270 int top_from
= find_top(pile
);
271 if (get_rank(pile
[top_from
]) != RANK_A
) return;
272 for (int i
= top_from
; i
>=0; i
--) {
273 if (!is_consecutive (pile
, i
)) return;
274 if (i
+RANK_K
== top_from
275 && get_rank(pile
[top_from
-RANK_K
]) == RANK_K
) { //ace to king ok, remove it
276 for (int i
= top_from
, j
= 0; i
> top_from
-NUM_RANKS
; i
--, j
++) {
277 f
.f
[foundation
][j
] = pile
[i
];
286 int t2t(int from
, int to
) { //TODO: in dire need of cleanup
287 //TODO: segfaulted once on large column
288 //TODO: sometimes moving doesn't work (ERR when it should be OK) XXX
290 int top_from
= find_top(f
.t
[from
]);
291 int top_to
= find_top(f
.t
[to
]);
292 int empty_to
= -1; //awful, nondescriptive name :/
293 if (top_to
< 0) { /* empty pile? */
294 printf ("\rup to (a23456789xjqk): "); //TODO: automatically do it if only 1 card movable
295 empty_to
= getchar();
297 case 'a': case 'A': empty_to
= RANK_A
; break;
298 case '0': /* fallthrough */
299 case 'x': case 'X': empty_to
= RANK_X
; break;
300 case 'j': case 'J': empty_to
= RANK_J
; break;
301 case 'q': case 'Q': empty_to
= RANK_Q
; break;
302 case 'k': case 'K': empty_to
= RANK_K
; break;
303 default: empty_to
-= '1';
305 if (empty_to
< RANK_A
|| empty_to
> RANK_K
) return ERR
;
307 for (int i
= top_from
; i
>= 0; i
--) {
308 if (!is_consecutive(f
.t
[from
], i
)) break;
310 if ((get_rank(f
.t
[from
][i
]) == get_rank(f
.t
[to
][top_to
])-1) // consecutive?
311 || (empty_to
>= RANK_A
&& get_rank(f
.t
[from
][i
]) == empty_to
)) { //to empty pile and rank ok?
312 for (;i
<= top_from
; i
++) {
314 f
.t
[to
][top_to
] = f
.t
[from
][i
];
315 f
.t
[from
][i
] = NO_CARD
;
317 turn_over(f
.t
[from
]);
318 remove_if_complete (f
.t
[to
]);
319 if (check_won()) return WON
;
324 return ERR
; /* no such move possible */
326 int s2t(int from
, int to
) { //TODO: check remove, won
327 (void) from
; (void) to
; //don't need
328 if (f
.z
<= 0) return ERR
; /* stack out of cards */
329 for (int pile
= 0; pile
< NUM_PILES
; pile
++)
330 if (f
.t
[pile
][0]==NO_CARD
) return ERR
; /*no piles may be empty*/
331 for (int pile
= 0; pile
< NUM_PILES
; pile
++) {
332 f
.t
[pile
][find_top(f
.t
[pile
])+1] = f
.s
[--f
.z
];
337 int nop(int from
, int to
) { (void)from
;(void)to
; return ERR
; }
340 int get_cmd (int* from
, int* to
) {
341 //returns 0 on success or an error code indicating game quit, new game,...
342 //TODO: escape sequences (mouse, cursor keys)
343 //TODO: don't allow taking from empty piles
348 /* direct addressing: */
349 case '1': *from
= TAB_1
; break;
350 case '2': *from
= TAB_2
; break;
351 case '3': *from
= TAB_3
; break;
352 case '4': *from
= TAB_4
; break;
353 case '5': *from
= TAB_5
; break;
354 case '6': *from
= TAB_6
; break;
355 case '7': *from
= TAB_7
; break;
357 case '8': *from
= TAB_8
; break;
358 case '9': *from
= TAB_9
; break;
359 case '0': *from
= TAB_10
; break;
360 #elif defined KLONDIKE
361 case '9': *from
= WASTE
; break;
362 case '0': *from
= FOUNDATION
; break;
363 case '8': /* fallthrough */
365 case '\n': /* shortcut for dealing from stock */
369 /* cursor keys addressing: */
371 case 'q': return CMD_QUIT
;
372 case 'r': return CMD_NEW
; //TODO
373 case 'h': return CMD_HINT
; //TODO
374 case '?': return CMD_HELP
; //TODO
375 case '/': return CMD_FIND
; //TODO: highlight card of given rank (even non-movable)
376 case '\033': return CMD_INVAL
; //TODO: cntlseq
377 default: return CMD_INVAL
;
382 if (t
< '0' || t
> '9') return CMD_INVAL
;
395 f
= (const struct playfield
){0}; /* clear playfield */
396 card_t deck
[DECK_SIZE
*NUM_DECKS
];
397 int avail
= DECK_SIZE
*NUM_DECKS
;
398 for (int i
= 0; i
< DECK_SIZE
*NUM_DECKS
; i
++) deck
[i
] = (i
%DECK_SIZE
)+1;
400 if (op
.m
!= NORMAL
) for (int i
= 0; i
< DECK_SIZE
*NUM_DECKS
; i
++) {
401 if (op
.m
== MEDIUM
) deck
[i
] = 1+((deck
[i
]-1) | 2);
402 if (op
.m
== EASY
) deck
[i
] = 1+((deck
[i
]-1) | 2 | 1);
403 /* the 1+ -1 dance gets rid of the offset created by NO_CARD */
406 srandom (time(NULL
));
407 /*XXX*/ long seed
= time(NULL
);
408 /*XXX*/ srandom (seed
);
409 for (int i
= DECK_SIZE
*NUM_DECKS
-1; i
> 0; i
--) { //fisher-yates
410 int j
= random() % (i
+1);
411 if (j
-i
) deck
[i
]^=deck
[j
],deck
[j
]^=deck
[i
],deck
[i
]^=deck
[j
];
413 ///////////////////////////////////////////////XXX
414 //sometimes we see duplicate cards. this tries to catch that
415 int count
[_NUM_CARDS_internal
] = {0};
416 for (int i
= 0; i
< DECK_SIZE
*NUM_DECKS
; i
++)
418 for (int i
= 0; i
< _NUM_CARDS_internal
; i
++){ //0 is NO_CARD
420 int x
= op
.m
==MEDIUM
?2:op
.m
==EASY
?4:1;
424 if (deck
[i
] == NO_CARD
) continue;
425 if (count
[deck
[i
]] != NUM_DECKS
*x
) {
427 printf ("found duplicate card with seed %lx!\n", seed
);
428 for (int i
= 1; i
< _NUM_CARDS_internal
; i
++)
429 printf ("%3d of %2d\n", count
[deck
[i
]], deck
[i
]);
433 ///////////////////////////////////////////////XXX
436 for (int i
= 0; i
< NUM_PILES
; i
++) {
438 int closed
= i
; /* pile n has n closed cards, then 1 open */
440 int closed
= i
<4?5:4; /* pile 1-4 have 5, 5-10 have 4 closed */
442 /* face down cards are negated: */
443 for (int j
= 0; j
< closed
; j
++) f
.t
[i
][j
] = -deck
[--avail
];
444 f
.t
[i
][closed
] = deck
[--avail
]; /* the face-up card */
446 /* rest of the cards to the stock; NOTE: assert(avail==50) for spider */
447 for (f
.z
= 0; avail
; f
.z
++) f
.s
[f
.z
] = deck
[--avail
];
448 f
.w
= -1; /* @start: nothing on waste (no waste in spider -> const) */
451 int is_movable(card_t
* pile
, int n
) { //TODO cleanup, code deduplication, needs entry in sol.h
453 return(pile
[n
] > NO_CARD
); /*non-movable cards don't exist in klondike*/
455 int top
= find_top(pile
);
456 for (int i
= top
; i
>= 0; i
--) {
457 if (pile
[i
] <= NO_CARD
) return 0; //card face down?
458 if (!is_consecutive(pile
, i
)) return 0;
459 if (i
== n
) return 1; //card reached, must be movable
464 #define print_hi(test, str) /* for highlighting during get_cmd() */ \
465 printf ("%s%s%s", (test)?"\033[7m":"", str, (test)?"\033[27m":"")
466 void print_table(int highlight
) { //{{{
467 printf("\033[2J\033[H"); /* clear screen, reset cursor */
469 /* print stock, waste and foundation: */
470 for (int line
= 0; line
< op
.s
->height
; line
++) {
472 print_hi (highlight
== STOCK
, (
473 (f
.w
< f
.z
-1)?op
.s
->facedown
474 :op
.s
->placeholder
)[line
]);
476 print_hi (highlight
== WASTE
, (
477 /* NOTE: cast, because f.w sometimes is (short)-1 !? */
478 ((short)f
.w
>= 0)?op
.s
->card
[f
.s
[f
.w
]]
479 :op
.s
->placeholder
)[line
]);
480 printf ("%s", op
.s
->card
[NO_CARD
][line
]); /* spacer */
482 for (int pile
= 0; pile
< NUM_SUITS
; pile
++) {
483 int card
= find_top(f
.f
[pile
]);
484 print_hi (highlight
== FOUNDATION
,
485 (card
< 0)?op
.s
->placeholder
[line
]
486 :op
.s
->card
[f
.f
[pile
][card
]][line
]);
492 //TODO: spider: print stack size, maybe foundation (horiz. overlap?)
493 for (int line
= 0; line
< op
.s
->height
; line
++) {
494 for (int i
= f
.z
/10; i
; i
--) {
495 printf ("%s", op
.s
->facedown
[line
]);
501 /* print tableu piles: */
502 int row
[NUM_PILES
] = {0};
503 int line
[NUM_PILES
]= {0};
504 int label
[NUM_PILES
]={0};// :|
505 int line_had_card
; // :|
508 for (int pile
= 0; pile
< NUM_PILES
; pile
++) {
509 card_t card
= f
.t
[pile
][row
[pile
]];
510 card_t next
= f
.t
[pile
][row
[pile
]+1];
511 int movable
= is_movable(f
.t
[pile
], row
[pile
]);
513 if (movable
) printf ("\033[1m"); /* bold */ //TODO: interferes with grey color!
514 print_hi (highlight
== pile
&& movable
, (
515 (card
<0)?op
.s
->facedown
518 printf ("\033[22m"); /* normal intensity (no bold) */
520 if (++line
[pile
] >= (next
?op
.s
->overlap
:op
.s
->height
) //normal overlap
522 || (line
[pile
] >= 1 &&
523 f
.t
[pile
][row
[pile
]] < 0 &&
524 f
.t
[pile
][row
[pile
]+1] <0) //extreme overlap on closed
525 || (0) //extreme overlap on sequence TODO
531 if(!card
&& !label
[pile
]) { /* tableu labels: */
533 printf ("\b\b%d ", (pile
+1) % 10); //XXX: hack
535 line_had_card
|= !!card
;
538 } while (line_had_card
);
541 void visbell (void) {
542 printf ("\033[?5h"); fflush (stdout
);
544 printf ("\033[?5l"); fflush (stdout
);
547 void append_undo (int n
, int f
, int t
) {
548 (void)n
;(void)f
;(void)t
;
549 //check if we have to free redo buffer (.next)
552 //TODO: undo; needs operations to be written by x2y()
555 void screen_setup (int enable
) {
558 printf ("\033[s\033[?47h"); /* save cursor, alternate screen */
559 printf ("\033[H\033[J"); /* reset cursor, clear screen */
560 //TODO//printf ("\033[?1000h\033[?25l"); /* enable mouse, hide cursor */
562 //TODO//printf ("\033[?9l\033[?25h"); /* disable mouse, show cursor */
563 printf ("\033[?47l\033[u"); /* primary screen, restore cursor */
568 void raw_mode(int enable
) { //{{{
569 static struct termios saved_term_mode
;
570 struct termios raw_term_mode
;
573 tcgetattr(STDIN_FILENO
, &saved_term_mode
);
574 raw_term_mode
= saved_term_mode
;
575 raw_term_mode
.c_lflag
&= ~(ICANON
| ECHO
);
576 raw_term_mode
.c_cc
[VMIN
] = 1 ;
577 raw_term_mode
.c_cc
[VTIME
] = 0;
578 tcsetattr(STDIN_FILENO
, TCSAFLUSH
, &raw_term_mode
);
580 tcsetattr(STDIN_FILENO
, TCSAFLUSH
, &saved_term_mode
);
584 //vim: foldmethod=marker