forked from johannesgerer/jburkardt-f
-
Notifications
You must be signed in to change notification settings - Fork 1
/
wordsnake.html
234 lines (206 loc) · 5.8 KB
/
wordsnake.html
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
<html>
<head>
<title>
WORDSNAKE - Seek High Scoring Wordsnakes
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
WORDSNAKE <br> Seek High Scoring Wordsnakes
</h1>
<hr>
<p>
<b>WORDSNAKE</b>
is a FORTRAN90 program
which tries to find a good solution to the "Wordsnake Puzzle".
<p>
<p>
<b>WORDSNAKE</b> is given a list of words and tries to arrange them
in a list so that the end of one word has maximum overlap with the
beginning of the next word. The entire list is called a "wordsnake",
and is scored by squaring the overlaps of each consecutive pair, and
adding. We allow the wordsnake to "wraparound", so there's one extra
score for overlap from the last word to the first.
</p>
<h3 align = "center">
Usage:
</h3>
<p>
<blockquote>
<b>wordsnake</b> <i>wordlist</i>
</blockquote>
where
<ul>
<li>
<i>wordlist</i> is a file containing a list of words,
one per line, to be made into a wordsnake.
</dd>
</ul>
</p>
<h3 align = "center">
Licensing:
</h3>
<p>
The computer code and data files described and made available on this web page
are distributed under
<a href = "../../txt/gnu_lgpl.txt">the GNU LGPL license.</a>
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../cpp_src/anagram/anagram.html">
ANAGRAM</a>,
a C++ program which
determines anagrams of a string,
by James Cherry;
</p>
<p>
<a href = "../../f_src/puzzles/puzzles.html">
PUZZLES</a>,
FORTRAN90 programs which
were used to solve various puzzles.
</p>
<p>
<a href = "../../f_src/subanagram/subanagram.html">
SUBANAGRAM</a>,
a FORTRAN90 program which
finds words which are anagrams formed from some of the letters
of a given master word.
</p>
<p>
<a href = "../../datasets/words/words.html">
WORDS</a>,
a dataset directory which
contains lists of words;
</p>
<h3 align = "center">
Reference:
</h3>
<p>
<ol>
<li>
Dennis Shasha,<br>
Wordsnakes,<br>
Dr Dobb's Journal,<br>
July 2000, pages 143-144.
</li>
</ol>
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "wordsnake.f90">wordsnake.f90</a>, the source code;
</li>
<li>
<a href = "wordsnake.sh">wordsnake.sh</a>,
commands to compile and load the source code;
</li>
</ul>
</p>
<h3 align = "center">
Examples and Tests:
</h3>
<p>
<ul>
<li>
<a href = "wordsnake_input.txt">wordsnake_input.txt</a>, a sample wordlist;
</li>
<li>
<a href = "wordsnake_output.txt">wordsnake_output.txt</a>, output from
the command "wordsnake wordsnake_input.txt > wordsnake_output.txt";
</li>
</ul>
</p>
<h3 align = "center">
List of Routines:
</h3>
<p>
<ul>
<li>
<b>MAIN</b> is the main program for WORDSNAKE.
</li>
<li>
<b>FILE_RECORD_COUNT</b> counts the number of records in a file.
</li>
<li>
<b>FILE_RECORD_READ</b> reads the records in a file.
</li>
<li>
<b>GET_UNIT</b> returns a free FORTRAN unit number.
</li>
<li>
<b>I4_MODP</b> returns the nonnegative remainder of integer division.
</li>
<li>
<b>I4_RANDOM</b> returns a random integer in a given range.
</li>
<li>
<b>I4_SWAP</b> switches two integer values.
</li>
<li>
<b>I4_SWAP3</b> swaps three integer values.
</li>
<li>
<b>I4_UNSWAP3</b> unswaps three integer values.
</li>
<li>
<b>I4_WRAP</b> forces an integer to lie between given limits by wrapping.
</li>
<li>
<b>I4VEC_IDENTITY</b> sets an integer vector to the identity vector A(I)=I.
</li>
<li>
<b>LOWER</b> returns a lowercase version of a string.
</li>
<li>
<b>OVERLAP_TABLE</b> computes a table of the overlap between pairs of words.
</li>
<li>
<b>PERM_RANDOM</b> selects a random permutation of N objects.
</li>
<li>
<b>S_OVERLAP</b> determines the overlap between two strings.
</li>
<li>
<b>TIMESTAMP</b> prints the current YMDHMS date as a time stamp.
</li>
<li>
<b>UPPER</b> returns an uppercase version of a string.
</li>
<li>
<b>WORDSNAKE</b> seeks a high scoring permutation of a set of words.
</li>
<li>
<b>WORDSNAKE_PRINT</b> prints a wordsnake.
</li>
<li>
<b>WORDSNAKE_SCORE</b> computes the score for a given wordsnake.
</li>
<li>
<b>WORDSNAKE_SEARCH_GREEDY</b> constructs a wordsnake using a greedy algorithm.
</li>
<li>
<b>WORDSNAKE_SEARCH_INSERT</b> tries to improve the score by inserting a word.
</li>
<li>
<b>WORDSNAKE_SEARCH_SWAP2</b> tries to improve the score by swapping 2 words.
</li>
<li>
<b>WORDSNAKE_SEARCH_SWAP3</b> tries to improve the score by swapping 3 words.
</li>
<li>
<b>WORDSNAKE_SEARCH_TRANSPOSE</b> tries to improve the score using transpositions.
</li>
</ul>
</p>
<hr>
<i>
Last revised on 13 November 2006.
</i>
<!-- John Burkardt -->
</body>
</html>