-
Notifications
You must be signed in to change notification settings - Fork 0
/
solve.c
156 lines (132 loc) · 3.54 KB
/
solve.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
/*
* solve.c
* This file is part of Gniggle
*
* Copyright (C) 2006 - Rob Kendrick <rjek@rjek.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to
* deal in the Software without restriction, including without limitation the
* rights to use, copy, modify, merge, publish, distribute, and/or sell copies
* of the Software, and to permit persons to whom the Software is furnished to
* do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
* IN THE SOFTWARE.
*/
#include <stdbool.h>
#include <string.h>
#include <malloc.h>
#include <stdio.h>
#include "dictionary.h"
#include "solve.h"
bool gniggle_solve_sufficent_letters(const char *word, const char *grid)
{
char *letters = strdup(grid);
size_t i;
for (i = 0; i < strlen(word); i++) {
char *o = strchr(letters, word[i]);
if (o == NULL) {
free(letters);
return false;
}
*o = '-';
}
free(letters);
return true;
}
#define GRIDOFFSET(ROW, COL) ((ROW * width) + (COL))
#define GRID(ROW,COL) grid[((ROW) * width) + (COL)]
static bool gniggle_solve_look(const char *word, char *grid,
unsigned int width, unsigned int height,
unsigned int x, unsigned int y,
unsigned int *path)
{
char eaten;
signed int sx, sy;
if (word[0] == '\0')
return true;
eaten = GRID(x, y);
GRID(x, y) = '-';
for (sx = -1; sx < 2; sx++) {
for (sy = -1; sy < 2; sy++) {
if ( (sx + x >= 0) && (y + sy >= 0)
&& (x + sx < width)
&& (y + sy < height)
) {
if (GRID(x + sx, y + sy) == word[0]) {
if (path != NULL) {
path[0] = y + 1;
path[1] = x + 1;
}
if (gniggle_solve_look(word + 1, grid,
width, height,
x + sx, y + sy,
path ? path + 2 : NULL) ==
true) {
return true;
}
}
}
}
}
GRID(x, y) = eaten;
return false;
}
bool gniggle_solve_word_on_grid(const char *word,
const char *grid,
const unsigned int width,
const unsigned int height,
unsigned int *path)
{
char firstchar = word[0];
char *wordc;
char *gridc;
unsigned int x, y;
if (gniggle_solve_sufficent_letters(word, grid) == false)
return false;
wordc = strdup(word + 1);
gridc = strdup(grid);
for (x = 0; x < width; x++) {
for (y = 0; y < height; y++) {
if (GRID(x, y) == firstchar) {
if (gniggle_solve_look(wordc, gridc,
width, height, x, y, path) == true) {
free(wordc);
free(gridc);
return true;
}
}
}
}
free(wordc);
free(gridc);
return false;
}
#ifdef TEST_RIG
#include <stdio.h>
#include <stdlib.h>
int main(int argc, char *argv[]) {
unsigned int width, height;
unsigned char *grid;
unsigned char word[BUFSIZ];
width = (unsigned int)atoi(argv[1]);
height = (unsigned int)atoi(argv[2]);
grid = (unsigned char *)argv[3];
while (scanf("%s", word) == 1) {
bool found = gniggle_solve_word_on_grid(
word, grid, width, height);
if (found)
printf("%s\n", word);
}
return 0;
}
#endif