Talk:Word search: Difference between revisions
→Overlap query
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]])
| |||