Loading...
Please wait, while we are loading the content...
Similar Documents
Which Way to the Square
| Content Provider | Semantic Scholar |
|---|---|
| Author | Sabey, Richard |
| Copyright Year | 1996 |
| Abstract | My square-searching program uses two pruning techniques which it is well to bear in mind, for a program running on the same word list as mine would only produce the same statistics if it used both these tech niques. My program prunes in the way Leonard Gordon described in "Bottoms Up!" in the February 1993 Word Ways. That is, a word is accepted in a row of a partially-built square only if each of the incom plete rows is fillab1e. I record statistics in two arrays, "accept" and "try". Every time I have accepted words for k-1 rows of the square, every word which begins (or ends, for the bottom-up run) with the appropriate k-1 letters is a candidate for the kth row. Every time I try a candidate word for the kth place, I increment try[k]. If this candidate is such that the remaining rows are all fillab1e, I increment accept [k]. In addition, I use a short cut pointed out by Leonard Gordon in "Significantly-Different Word Squares" in the November 1993 Word Ways. |
| Starting Page | 3 |
| Ending Page | 3 |
| Page Count | 1 |
| File Format | PDF HTM / HTML |
| Volume Number | 29 |
| Alternate Webpage(s) | https://digitalcommons.butler.edu/cgi/viewcontent.cgi?article=4048&context=wordways |
| Alternate Webpage(s) | https://digitalcommons.butler.edu/cgi/viewcontent.cgi?article=4048&context=wordways&httpsredir=1&referer= |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
