- for (y = 0; y < 4; y++)
- for (x = 0; x < 4; x++)
- board_enumerate (board, x, y, seen, word, dict_root (dict));
-}
-
-static bool_t
-seen_predicate (dict_entry_t entry)
-{
- return entry & GRID_WORD_SEEN;
-}
-
-static bool_t
-unseen_predicate (dict_entry_t entry)
-{
- return ! seen_predicate (entry);
-}
-
-static void
-_count_possible (dict_cursor_t cursor,
- int depth,
- int possible[17])
-{
- char c;
-
- if (cursor == DICT_CURSOR_NIL)
- return;
-
- if (DICT_ENTRY_IS_WORD (dict_cursor_resolve (cursor)))
- possible[depth]++;
-
- for (c = 'a'; c <= 'z'; c++)
- _count_possible (dict_cursor_next (cursor, c), depth + 1, possible);
-}
-
-#define GAME_LENGTH (3 * 60)
-int
-main (void)
-{
- int i;
- dict_t dict, solution;
- board_t board;
- struct timeval tv, tv_stop;
- int remaining, minutes, seconds;
- /* 16 tiles + Qu on one tile = max 17 letters in one word. */
- int found[17], possible[17];
- int found_total, possible_total;
- char prompt[7], *response;
- bool_t just_saw_board;
-
- gettimeofday (&tv, NULL);
- srand (tv.tv_sec ^ tv.tv_usec);
-
- dict_init (&dict);
- dict_add_words_from_file (&dict, "words.txt");
- board_init (&board);
-
- dict_init (&solution);
- board_solve (&board, &dict, &solution);
-
- for (i=0; i < 17; i++) {
- found[i] = 0;
- possible[i] = 0;
- }
- _count_possible (dict_root (&solution), 0, possible);
- found_total = 0;
- possible_total = 0;
- for (i=0; i < 17; i++)
- possible_total += possible[i];
-
- board_print (&board);
- just_saw_board = TRUE;
-
- gettimeofday (&tv, NULL);
- tv_stop = tv;
- tv_stop.tv_sec += GAME_LENGTH;
- remaining = GAME_LENGTH;
- do {
- minutes = remaining / 60;
- seconds = remaining % 60;
- sprintf (prompt, "%02d:%02d ", minutes, seconds);
- response = readline (prompt);
- add_history (response);
- if (strlen (response) == 0) {
- if (! just_saw_board) {
- board_print (&board);
- just_saw_board = TRUE;
- } else {
- for (i = 2; i <= 17; i++)
- if (possible[i])
- printf ("%d: (%d/%d) ", i, found[i], possible[i]);
- printf ("total: (%d/%d = %.2f%%)\n",
- found_total, possible_total,
- 100 * (double) found_total / possible_total);
- }
- } else {
- dict_entry_t *entry;
- just_saw_board = FALSE;
- if (response[strlen (response) - 1] == '\n')
- response[strlen (response) - 1] = '\0';
- entry = dict_lookup (&solution, response);
- if (DICT_ENTRY_IS_WORD (entry)) {
- if (*entry & GRID_WORD_SEEN) {
- printf ("(repeat)\n");
- } else {
- *entry |= GRID_WORD_SEEN;
- found [strlen (response)]++;
- found_total++;
- }
- } else {
- entry = dict_lookup (&dict, response);
- if (DICT_ENTRY_IS_WORD (entry))
- printf ("(a good word, but it's not in the puzzle)\n");
- else
- printf ("*** %s is not a word\n", response);
- }
- }
- free (response);
- gettimeofday (&tv, NULL);
- remaining = floor (0.5 + (tv_stop.tv_sec - tv.tv_sec) + (tv_stop.tv_usec - tv.tv_usec) / 1000000.0);
- minutes = remaining / 60;
- } while (remaining > 0);
-
- board_print (&board);
-
- printf ("Words you found:\n");
- dict_print_by_length_if (&solution, seen_predicate);
-
- printf ("\nWords you missed:\n");
- dict_print_by_length_if (&solution, unseen_predicate);
- printf ("\n");
-
- printf ("You found %d of %d words (%.2f%%)\n",
- found_total, possible_total,
- 100 * (double) found_total / possible_total);
-
- dict_fini (&dict);
-
- return 0;