Talk:Word search: Difference between revisions

From Rosetta Code
Content added Content deleted
No edit summary
Line 8: Line 8:
== Overlap query ==
== Overlap query ==
If you have "din" and "other", can a "not" be planted on all-existing letters, given that they are bits of different words? Would there be a difference between straight-line instances of that kind and orthogonal ones? [[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 14:57, 30 June 2017 (UTC)
If you have "din" and "other", can a "not" be planted on all-existing letters, given that they are bits of different words? Would there be a difference between straight-line instances of that kind and orthogonal ones? [[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 14:57, 30 June 2017 (UTC)
:Can you show an example of what you mean? --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 15:58, 30 June 2017 (UTC)

Revision as of 15:58, 30 June 2017

Not sure how important the output format is

The task did not really say much about how the result should be displayed. Not sure if that matters... --Rdm (talk) 04:13, 26 March 2016 (UTC)

As long as you can check the result, it's fine. -- I get the impression that in your solution there isn't much overlap, which wouldn't disqualify it, but maybe I should specify that? Fwend (talk) 10:31, 26 March 2016 (UTC)
Yes, I think I will require at least 10 overlaps. (I'll have to change my own code as well) Fwend (talk) 10:36, 26 March 2016 (UTC)

Overlap query

If you have "din" and "other", can a "not" be planted on all-existing letters, given that they are bits of different words? Would there be a difference between straight-line instances of that kind and orthogonal ones? Pete Lomax (talk) 14:57, 30 June 2017 (UTC)

Can you show an example of what you mean? --Rdm (talk) 15:58, 30 June 2017 (UTC)