search

jonadsimon / wonder-words-generator

Generates WonderWords puzzles
Apache License 2.0
2 stars 0 forks source link

Sample for specific distribution rather than naive shortest-to-longest #20

Closed jonadsimon closed 2 years ago

jonadsimon commented 2 years ago

The related words for seed "number sequences" include the length-15 words:

Within a few seconds the program determines the board to be unsatisfiable.

This implies that sprinkling in a few longer words can significantly constrain the search space, while still allowing for dense packing

Full sequence:

['word', 'field', 'string', 'series', 'metric', 'divisor', 'infimum', 'integers', 'analysis', 'ellipsis', 'supremum', 'constant', 'interval', 'computing', 'polynomial', 'mathematics', 'order theory', 'uncountable', 'subsequence', 'indexed family', 'exact sequence', 'computer memory', 'rational numbers', 'positive integer', 'product topology']

Full array:

n = 15;
m = 25;

max_len = 15;
word_lens = [ 4, 5, 6, 6, 6, 7, 7, 8, 8, 8, 8, 8, 8, 9, 10, 11, 11, 11, 11, 13, 13, 14, 15, 15, 15 ];
words = [| W, O, R, D, E, E, E, E, E, E, E, E, E, E, E | F, I, E, L, D, E, E, E, E, E, E, E, E, E, E | S, T, R, I, N, G, E, E, E, E, E, E, E, E, E | S, E, R, I, E, S, E, E, E, E, E, E, E, E, E | M, E, T, R, I, C, E, E, E, E, E, E, E, E, E | D, I, V, I, S, O, R, E, E, E, E, E, E, E, E | I, N, F, I, M, U, M, E, E, E, E, E, E, E, E | I, N, T, E, G, E, R, S, E, E, E, E, E, E, E | A, N, A, L, Y, S, I, S, E, E, E, E, E, E, E | E, L, L, I, P, S, I, S, E, E, E, E, E, E, E | S, U, P, R, E, M, U, M, E, E, E, E, E, E, E | C, O, N, S, T, A, N, T, E, E, E, E, E, E, E | I, N, T, E, R, V, A, L, E, E, E, E, E, E, E | C, O, M, P, U, T, I, N, G, E, E, E, E, E, E | P, O, L, Y, N, O, M, I, A, L, E, E, E, E, E | M, A, T, H, E, M, A, T, I, C, S, E, E, E, E | O, R, D, E, R, T, H, E, O, R, Y, E, E, E, E | U, N, C, O, U, N, T, A, B, L, E, E, E, E, E | S, U, B, S, E, Q, U, E, N, C, E, E, E, E, E | I, N, D, E, X, E, D, F, A, M, I, L, Y, E, E | E, X, A, C, T, S, E, Q, U, E, N, C, E, E, E | C, O, M, P, U, T, E, R, M, E, M, O, R, Y, E | R, A, T, I, O, N, A, L, N, U, M, B, E, R, S | P, O, S, I, T, I, V, E, I, N, T, E, G, E, R | P, R, O, D, U, C, T, T, O, P, O, L, O, G, Y |];
jonadsimon commented 2 years ago

DIstribution favoring most short words is favorable, at least when considering length alone.

Possible that trying to assemble set of highly-overlapping words in advance would be more helpful, but this is unclear