Talk:Word search: Difference between revisions

m
 
(3 intermediate revisions by 3 users not shown)
Line 13:
:::: It's not that hard to implement though: just check if a word can be contained in the list of currently placed words. If it can, require that when it is placed that it occupy at least one previously unoccupied position. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 15:25, 3 July 2017 (UTC)
::::: That's what the Java code does, but it still allows a larger word to embed a smaller word later. Imagine that you've placed the word "one", then the word "done" could be laid over it.[[User:Fwend|Fwend]] ([[User talk:Fwend|talk]]) 17:06, 3 July 2017 (UTC)
:::::: Oh, I overlooked that possibility. Still... you could pregenerate a list of words (maybe 50 of them) at the start and run the containment check against that list. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]])
::::::: Sure, you could check it, but the task already has plenty of constraints, I don't think this one is really necessary. [[User:Fwend|Fwend]] ([[User talk:Fwend|talk]]) 18:37, 3 July 2017 (UTC)
== Bad link to word list ==
The task description contains a broken link to the word list 'unixdict.txt'. Perhaps the link could be changed to a working link for the original file that can be found at the internet archive, 'The Wayback Machine', [https://web.archive.org/web/20160419090505/http://www.puzzlers.org/pub/wordlists/unixdict.txt unixdict.txt]. --[[User:Demivec|Demivec]] ([[User talk:Demivec|talk]]) 08:05, 18 January 2019 (UTC)
Anonymous user