Last week, we worked to create the shortest 1-D string using the top 10,000 words in the English language we worked to create the shortest 1-D string using the top 10,000 words in the English language. Now, lets try the same challenge in 2D!
What you need to do is to take all of the above words, and put them in a rectangle as small as possible, allowing for overlaps. For example, if your words were ["ape","pen","ab","be","pa"], then a possible rectangle would be:
.b..
apen
The above rectangle would give a score of 5.
Rules:
- Overlapping multiple letters in a word is allowed
- Words can go in any of the 8 directions
- Words cannot wrap around
- You can use any character for the empty locations
You need to create a word search that contains these top 10,000 words in English (according to Google). Your score is equal to the number of characters in your word search (excluding unused characters). If there is a tie, or if a submission is proven to be optimal, then the submission that is first posted wins.
Last week, we worked to create the shortest 1-D string using the top 10,000 words in the English language. Now, lets try the same challenge in 2D!
What you need to do is to take all of the above words, and put them in a rectangle as small as possible, allowing for overlaps. For example, if your words were ["ape","pen","ab","be","pa"], then a possible rectangle would be:
.b..
apen
The above rectangle would give a score of 5.
Rules:
- Overlapping multiple letters in a word is allowed
- Words can go in any of the 8 directions
- Words cannot wrap around
- You can use any character for the empty locations
You need to create a word search that contains these top 10,000 words in English (according to Google). Your score is equal to the number of characters in your word search (excluding unused characters). If there is a tie, or if a submission is proven to be optimal, then the submission that is first posted wins.
Last week, we worked to create the shortest 1-D string using the top 10,000 words in the English language. Now, lets try the same challenge in 2D!
What you need to do is to take all of the above words, and put them in a rectangle as small as possible, allowing for overlaps. For example, if your words were ["ape","pen","ab","be","pa"], then a possible rectangle would be:
.b..
apen
The above rectangle would give a score of 5.
Rules:
- Overlapping multiple letters in a word is allowed
- Words can go in any of the 8 directions
- Words cannot wrap around
- You can use any character for the empty locations
You need to create a word search that contains these top 10,000 words in English (according to Google). Your score is equal to the number of characters in your word search (excluding unused characters). If there is a tie, or if a submission is proven to be optimal, then the submission that is first posted wins.
Last week, we worked to create the shortest 1-D string using the top 10,000 words in the English language. Now, lets try the same challenge in 2D!
What you need to do is to take all of the above words, and put them in a rectangle as small as possible, allowing for overlaps. For example, if your words were ["ape","pen","ab","be","pa"], then a possible rectangle would be:
.b..
apen
The above rectangle would give a score of 85. (Note, the smallest possible rectangle is ebapen, with a score of 6)
Rules:
- Overlapping multiple letters in a word is allowed
- Words can go in any of the 8 directions
- Words cannot wrap around
- You can use any character for the empty locations
- Empty locations still count towards your score
You need to create a word search that contains these top 10,000 words in English (according to Google). Your score is equal to the number of characters in your word search (includingexcluding unused characters). If there is a tie, or if a submission is proven to be optimal, then the submission that is first posted wins.
Last week, we worked to create the shortest 1-D string using the top 10,000 words in the English language. Now, lets try the same challenge in 2D!
What you need to do is to take all of the above words, and put them in a rectangle as small as possible, allowing for overlaps. For example, if your words were ["ape","pen","ab","be","pa"], then a possible rectangle would be:
.b..
apen
The above rectangle would give a score of 8. (Note, the smallest possible rectangle is ebapen, with a score of 6)
Rules:
- Overlapping multiple letters in a word is allowed
- Words can go in any of the 8 directions
- Words cannot wrap around
- You can use any character for the empty locations
- Empty locations still count towards your score
You need to create a word search that contains these top 10,000 words in English (according to Google). Your score is equal to the number of characters in your word search (including unused characters). If there is a tie, or if a submission is proven to be optimal, then the submission that is first posted wins.
Last week, we worked to create the shortest 1-D string using the top 10,000 words in the English language. Now, lets try the same challenge in 2D!
What you need to do is to take all of the above words, and put them in a rectangle as small as possible, allowing for overlaps. For example, if your words were ["ape","pen","ab","be","pa"], then a possible rectangle would be:
.b..
apen
The above rectangle would give a score of 5.
Rules:
- Overlapping multiple letters in a word is allowed
- Words can go in any of the 8 directions
- Words cannot wrap around
- You can use any character for the empty locations
You need to create a word search that contains these top 10,000 words in English (according to Google). Your score is equal to the number of characters in your word search (excluding unused characters). If there is a tie, or if a submission is proven to be optimal, then the submission that is first posted wins.
Last week, we worked to create the shortest 1-D string using the top 10,000 words in the English language. Now, lets try the same challenge in 2D!
What you need to do is to take all of the above words, and put them in a rectangle as small as possible, allowing for overlaps. For example, if your words were ["ape","pen","ab","be","pa"], then a possible smallest rectangle would be:
.b..
apen
The above rectangle would give a score of 8. (Note, the smallest possible rectangle is ebapen, with a score of 6)
Rules:
- Overlapping multiple letters in a word is allowed
- Words can go in any of the 8 directions
- Words cannot wrap around
- You can use any character for the empty locations
- Empty locations still count towards your score
You need to create a word search that contains these top 10,000 words in English (according to Google). Your score is equal to the number of characters in your word search (including unused characters). If there is a tie, or if a submission is proven to be optimal, then the submission that is first posted wins.
Last week, we worked to create the shortest 1-D string using the top 10,000 words in the English language. Now, lets try the same challenge in 2D!
What you need to do is to take all of the above words, and put them in a rectangle as small as possible, allowing for overlaps. For example, if your words were ["ape","pen","ab","be","pa"], then a possible smallest rectangle would be:
.b..
apen
The above rectangle would give a score of 8.
Rules:
- Overlapping multiple letters in a word is allowed
- Words can go in any of the 8 directions
- Words cannot wrap around
- You can use any character for the empty locations
- Empty locations still count towards your score
You need to create a word search that contains these top 10,000 words in English (according to Google). Your score is equal to the number of characters in your word search (including unused characters). If there is a tie, or if a submission is proven to be optimal, then the submission that is first posted wins.
Last week, we worked to create the shortest 1-D string using the top 10,000 words in the English language. Now, lets try the same challenge in 2D!
What you need to do is to take all of the above words, and put them in a rectangle as small as possible, allowing for overlaps. For example, if your words were ["ape","pen","ab","be","pa"], then a possible rectangle would be:
.b..
apen
The above rectangle would give a score of 8. (Note, the smallest possible rectangle is ebapen, with a score of 6)
Rules:
- Overlapping multiple letters in a word is allowed
- Words can go in any of the 8 directions
- Words cannot wrap around
- You can use any character for the empty locations
- Empty locations still count towards your score
You need to create a word search that contains these top 10,000 words in English (according to Google). Your score is equal to the number of characters in your word search (including unused characters). If there is a tie, or if a submission is proven to be optimal, then the submission that is first posted wins.