Timeline for Word search puzzle generation
Current License: CC BY-SA 3.0
33 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Mar 11, 2023 at 18:08 | history | suggested | noodle person |
this is a word-search, not a crossword
|
|
| Mar 11, 2023 at 16:27 | review | Suggested edits | |||
| S Mar 11, 2023 at 18:08 | |||||
| Apr 13, 2017 at 12:39 | history | edited | Community Bot |
replaced http://codegolf.stackexchange.com/ with https://codegolf.stackexchange.com/
|
|
| Mar 24, 2015 at 0:51 | vote | accept | Migue | ||
| Mar 24, 2015 at 0:01 | comment | added | gnibbler | Is this supposed to be codegolf? The accepted answer hasn't been golfed at all | |
| Mar 23, 2015 at 18:07 | answer | added | edc65 | timeline score: 6 | |
| Mar 23, 2015 at 13:40 | vote | accept | Migue | ||
| Mar 24, 2015 at 0:51 | |||||
| S Mar 23, 2015 at 13:40 | history | bounty ended | Migue | ||
| S Mar 23, 2015 at 13:40 | history | notice removed | Migue | ||
| Mar 23, 2015 at 10:50 | answer | added | bacchusbeale | timeline score: 1 | |
| Mar 23, 2015 at 7:21 | comment | added | firephil | letter sharing makes it quite difficult... | |
| Mar 21, 2015 at 2:55 | comment | added | orlp |
As of now, the question has inputs that can not be solved, but no mention is made of how you're supposed to deal with that. For example the set A B C D E F G H I J K L M N O P Q R S T U V W X Y Z has no solution.
|
|
| S Mar 16, 2015 at 13:49 | history | bounty started | Migue | ||
| S Mar 16, 2015 at 13:49 | history | notice added | Migue | Draw attention | |
| Mar 6, 2015 at 6:11 | history | tweeted | twitter.com/#!/StackCodeGolf/status/573727462187757568 | ||
| Mar 4, 2015 at 12:22 | comment | added | Migue | @xnor Yes, words could appear totally or partially within another because it doesn't contradict the rules. And yes, random filling letters should avoid accidentally repeat the words. | |
| Mar 3, 2015 at 21:54 | comment | added | xnor | Can one word appear totally within another? You mention random filling letters -- do they have to avoid accidentally repeating the words? | |
| Mar 3, 2015 at 21:31 | history | reopened |
Jakube Timtech NinjaBearMonkey hildred Peter Taylor |
||
| Mar 3, 2015 at 12:39 | comment | added | Migue | @PeterTaylor, I chose to remove the random part from the question, so one just have to place the words in any way and get the smallest possible matrix just with the constraints of directions and repetition. | |
| Mar 3, 2015 at 12:29 | history | edited | Migue | CC BY-SA 3.0 |
deleted 9 characters in body
|
| Mar 3, 2015 at 3:44 | comment | added | xnor | Why 3 reopen votes? This is still totally underspecified. | |
| Mar 2, 2015 at 23:10 | comment | added | Peter Taylor | Not really, no. I'm still not clear what the space from which an answer should randomly sample is, nor how much flexibility is allowed in weighting the elements of that space. | |
| Mar 2, 2015 at 18:31 | review | Reopen votes | |||
| Mar 3, 2015 at 16:33 | |||||
| Mar 2, 2015 at 18:13 | comment | added | Migue | @PeterTaylor, I edited the question. I hope it's clear now. | |
| Mar 2, 2015 at 18:11 | history | edited | Migue | CC BY-SA 3.0 |
added 73 characters in body
|
| Mar 2, 2015 at 18:02 | comment | added | Migue | Yes, it should be found only in one position. | |
| Mar 2, 2015 at 18:01 | comment | added | Peter Taylor | It's not clear to me what exactly you mean by "Words should be placed randomly in all directions". Would an answer meet this criterion if, having laid the words out deterministically, it randomly selects one of the eight symmetries of the square? Or, at the other extreme, should the output be selected uniformly from all the possible smallest squares which contain the words? Or is the line drawn somewhere in between those extremes? | |
| Mar 2, 2015 at 18:00 | history | edited | Migue |
edited tags
|
|
| Mar 2, 2015 at 17:58 | history | closed |
Jakube Alex A. user3094403 Calvin's Hobbies Peter Taylor |
Needs more focus | |
| Mar 2, 2015 at 17:45 | comment | added | Geobits |
Must each word be found in only one position (like typical word searches)? For instance, the letter left of AC in your example would make another CAT if it's T.
|
|
| Mar 2, 2015 at 17:28 | review | Close votes | |||
| Mar 2, 2015 at 18:01 | |||||
| Mar 2, 2015 at 17:03 | review | First posts | |||
| Mar 2, 2015 at 17:09 | |||||
| Mar 2, 2015 at 17:02 | history | asked | Migue | CC BY-SA 3.0 |