Edit - Code Golf Stack Exchange

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

Rev

Required fields*

Line Islands in a Word Search

My third word search related challenge in a row. :)

Challenge:

Brief explanation of what a word search is:

In a word search you'll be given a grid of letters and a list of words. The idea is to cross off the words from the list in the grid. The words can be in eight different directions: horizontally from left-to-right or right-to-left; vertically from top-to-bottom or bottom-to-top; diagonally from the topleft-to-bottomright or bottomright-to-topleft; or anti-diagonally from the topright-to-bottomleft or bottomleft-to-topright.

Actual challenge:

Given a list of coordinates indicating the crossed out words within a grid (in any reasonable format^†), output how many line-islands there are.

We've had challenges involving finding the amount of islands in a matrix. But in this case it's different: just looking at the grid, words could be right next to each other, but would still be two separated line-islands. E.g. In the following partially solved word search, we have four separated line-islands, even though the letters of the words are right next to each other.

enter image description here

This partially solved word search above would result in an output of 4.

If 'word' FG was FGH like this:

enter image description here

The output would have been 3 instead, because the FGH+NKH now form a single connected line-island.

In this challenge we'll only be taking the coordinates of the words in a grid as input, and output the amount of line-islands.

Challenge rules:

† You're allowed to take the input in any reasonable format. It could be pair of coordinates per word to indicate their start/end positions (e.g. [[[0,0],[0,2]],[[1,1],[1,3]],[[3,1],[1,3]],[[3,2],[2,3]]] for the second example above); it could be a full list of coordinates per word (e.g. [[[0,0],[0,1],[0,2]],[[1,1],[1,2],[1,3]],[[3,1],[2,2],[1,3]],[[3,2],[2,3]]]); a list of bit-mask matrices per word (e.g. [[[1,1,1,0],[0,0,0,0],[0,0,0,0],[0,0,0,0]],[[0,0,0,0],[0,1,1,1],[0,0,0,0],[0,0,0,0]],[[0,0,0,0],[0,0,0,1],[0,0,1,0],[0,1,0,0]],[[0,0,0,0],[0,0,0,0],[0,0,0,1],[0,0,1,0]]]); etc. If you're unsure if a possible input-format is valid, leave a comment down below.
All 'words' are guaranteed to have at least two letters.
You can assume the input won't be empty.
You can optionally take the dimensions of the grid as additional input.
Note that coordinates of 'words' are not guaranteed to be in the same positions to still form a single line-island! E.g. this grid would result in 1 because the lines cross, but neither 'word' share the same letter-positions:
enter image description here

General rules:

This is code-golf, so the shortest answer in bytes wins.
Don't let code-golf languages discourage you from posting answers with non-codegolfing languages. Try to come up with an as short as possible answer for 'any' programming language.
Standard rules apply for your answer with default I/O rules, so you are allowed to use STDIN/STDOUT, functions/method with the proper parameters and return-type, full programs. Your call.
Default Loopholes are forbidden.
If possible, please add a link with a test for your code (e.g. TIO).
Also, adding an explanation for your answer is highly recommended.

Test cases:

enter image description here

Input as start/ending coordinates of the 'words': [[[0,0],[0,2]],[[1,1],[1,2]],[[3,1],[1,3]],[[3,2],[2,3]]]
Input as coordinates of the complete 'words': [[[0,0],[0,1],[0,2]],[[1,1],[1,2]],[[3,1],[2,2],[1,3]],[[3,2],[2,3]]]
Input as bit-mask matrices of the 'words': [[[1,1,1,0],[0,0,0,0],[0,0,0,0],[0,0,0,0]],[[0,0,0,0],[0,1,1,0],[0,0,0,0],[0,0,0,0]],[[0,0,0,0],[0,0,0,1],[0,0,1,0],[0,1,0,0]],[[0,0,0,0],[0,0,0,0],[0,0,0,1],[0,0,1,0]]]

Output: 4

enter image description here

Input as start/ending coordinates of the 'words': [[[0,0],[0,2]],[[1,1],[1,3]],[[3,1],[1,3]],[[3,2],[2,3]]]
Input as coordinates of the complete 'words': [[[0,0],[0,1],[0,2]],[[1,1],[1,2],[1,3]],[[3,1],[2,2],[1,3]],[[3,2],[2,3]]]
Input as bit-mask matrices of the 'words': [[[1,1,1,0],[0,0,0,0],[0,0,0,0],[0,0,0,0]],[[0,0,0,0],[0,1,1,1],[0,0,0,0],[0,0,0,0]],[[0,0,0,0],[0,0,0,1],[0,0,1,0],[0,1,0,0]],[[0,0,0,0],[0,0,0,0],[0,0,0,1],[0,0,1,0]]]

Output: 3

enter image description here

Input as start/ending coordinates of the 'words': [[[0,0],[1,1]],[[0,1],[1,0]]]
Input as coordinates of the complete 'words': [[[0,0],[1,1]],[[0,1],[1,0]]]
Input as bit-mask matrices of the 'words': [[[1,0],[0,1]],[[0,1],[1,0]]]

Output: 1

enter image description here

Input as start/ending coordinates of the 'words': [[[1,9],[8,9]],[[8,6],[1,6]],[[1,4],[4,7]],[[9,0],[0,9]],[[1,0],[6,0]],[[6,1],[3,4]],[[9,4],[9,9]],[[0,1],[0,8]],[[9,3],[1,3]],[[0,0],[9,9]]]
Input as coordinates of the complete 'words': [[[1,9],[2,9],[3,9],[4,9],[5,9],[6,9],[7,9],[8,9]],[[8,6],[7,6],[6,6],[5,6],[4,6],[3,6],[2,6],[1,6]],[[1,4],[2,5],[3,6],[4,7]],[[9,0],[8,1],[7,2],[6,3],[5,4],[4,5],[3,6],[2,7],[1,8],[0,9]],[[1,0],[2,0],[3,0],[4,0],[5,0],[6,0]],[[6,1],[5,2],[4,3],[3,4]],[[9,4],[9,5],[9,6],[9,7],[9,8],[9,9]],[[0,1],[0,2],[0,3],[0,4],[0,5],[0,6],[0,7],[0,8]],[[9,3],[8,3],[7,3],[6,3],[5,3],[4,3],[3,3],[2,3],[1,3]],[[0,0],[1,1],[2,2],[3,3],[4,4],[5,5],[6,6],[7,7],[8,8],[9,9]]]
Input as bit-mask matrices of the 'words': pastebin

Output: 4

enter image description here

Input as start/ending coordinates of the 'words': [[[8,6],[1,6]],[[1,4],[4,7]],[[9,0],[0,9]],[[6,1],[3,4]],[[9,4],[9,9]],[[9,3],[1,3]],[[0,0],[9,9]]]
Input as coordinates of the complete 'words': [[[8,6],[7,6],[6,6],[5,6],[4,6],[3,6],[2,6],[1,6]],[[1,4],[2,5],[3,6],[4,7]],[[9,0],[8,1],[7,2],[6,3],[5,4],[4,5],[3,6],[2,7],[1,8],[0,9]],[[6,1],[5,2],[4,3],[3,4]],[[9,4],[9,5],[9,6],[9,7],[9,8],[9,9]],[[9,3],[8,3],[7,3],[6,3],[5,3],[4,3],[3,3],[2,3],[1,3]],[[0,0],[1,1],[2,2],[3,3],[4,4],[5,5],[6,6],[7,7],[8,8],[9,9]]]
Input as bit-mask matrices of the 'words': pastebin

Output: 1

Answer*

# [Wolfram Language (Mathematica)], 90 bytes

 Length@ConnectedComponents@Graph[#->If[#⋂#2=={},##]&@@@Tuples[Total/@#~Tuples~2&/@#,2]]&

[Try it online!][TIO-l12tul4m]

A simple set intersection between the lists of coordinates would detect almost all the cases except the 'phantom intersection' of two diagonal 'words'. 
In this special case, these phantom intersecting diagonals, have both 2 coordinates that add up to a same one.

```
+---------+---------+
|A |B |
| x y | x+1 y |
| | |
+---------X---------+ A coords. B coords. 
|B |A | (x,y) + (x+1,y+1) = (x,y+1) + (x+1,y)
| x y+1 | x+1 y+1 |
| | |
+---------+---------+
```

Unfortunately a test for this would not detect the standard intersection of two words that actually have one common coordinate. As such my first implementation combined two test:
- the intersection between the plain lists of coordinates `#`
- the intersection between the lists of the **sums of consecutive coordinates** `Partition[#,2,1]` (this also assumed the lists would always be in order).
 
But then I thought why not **sum every pair of coordinates** (multisets) of a 'word'? 
Also pushed by the fact that `Tuples[#,2]` is shorter than `Partition[#,2,1]`

## Technicalities

The only doubt: can there be false positives? 
That is, can two 'words' that do not share any coordinate be mapped into 'words' that do share some coordinates? 

To sum all the coordinates in a 'word' with themselves is essentially a x2 scaling done in a redundant fashion.

So, for each mapped coordinate of a 'word' \$(x_i+x_j,y_i+y_j)\$ we can infer its preimage: a pair of coordinates of 'word' that yield the mapped one. Hence if two 'words' share a mapped coordinate they also have to share the relative pair of 'core coordinates'.

This pair of 'core coordinates' (`P`,`b`) are the two coordinates around the possibly 'phantom point' (`@`) \$(\frac{x_i+x_j}{2},\frac{y_i+y_j}{2})\$

```
+---------+---------+ +---------+---------+ +---------+---------+ +---------+---------+ +---------+---------+
|BBBBBBBBB| | |PPPPPPPPP| | | | | |PPPPPPPPP| | | |PPPPPPPPP|
|BBBB@BBBB| | |PPPPPPPPP| | | | | |PPPPPPPPP| | | |PPPPPPPPP|
|BBBBBBBBB| | |PPPPPPPPP| | | | | |PPPPPPPPP| | | |PPPPPPPPP|
+---------+---------+ , +----@----+---------+ , +---------+---------+ , +---------@---------+ OR +---------@---------+
| | | |bbbbbbbbb| | |PPPPPPPPP|bbbbbbbbb| | |bbbbbbbbb| |bbbbbbbbb| |
| | | |bbbbbbbbb| | |PPPPPPPPP@bbbbbbbbb| | |bbbbbbbbb| |bbbbbbbbb| |
| | | |bbbbbbbbb| | |PPPPPPPPP|bbbbbbbbb| | |bbbbbbbbb| |bbbbbbbbb| |
+---------+---------+ +---------+---------+ +---------+---------+ +---------+---------+ +---------+---------+
```

[Wolfram Language (Mathematica)]: https://www.wolfram.com/wolframscript/
[TIO-l12tul4m]: https://tio.run/##zVM9a8MwFNz9NwyZVCxbsmwNLoIMpdChQ7aQwaRKHUjsEKuTcYau/Zf9I650UW2PgQ4phAvv4@6e3sPH0lT6WJr9thx2xfCi63dTqWVT13pr9NuyOZ6aWtemVU/n8lStw4fH5906/P76DJOi6HoShpuFUmr1cTrodr1qTHmIVHi5xpdkYQOSbDaLwejWbMtWt0UXBF3XUUJ7YjEGJr3962JEsY8YosRGLsd8LkHORj25QWfOvF3N8V2deh061mMiwXDIgByYAgUwA@YWnUZOBHICdYFeAZ6AhoCegI/w03Pk0rHOSYaKxHQ5psowu7CzO0WOrnSmmEExx1ak16WoUHRRMCjYFEoUXQLqKdQ51JlVv7o7FwkXCRcJFwkX6V2mSzhkQA5MgQKYAXOvy/Aqhlex2avYbAbmLzVdb7rV712ZZ3Cw03HjGfzyaU5/zf9zm79u/R47DAL720Vq/LKj6PW8r83wAw "Wolfram Language (Mathematica) – Try It Online"

If this is an answer to a challenge…

…Be sure to follow the challenge specification. However, please refrain from exploiting obvious loopholes. Answers abusing any of the standard loopholes are considered invalid. If you think a specification is unclear or underspecified, comment on the question instead.
…Try to optimize your score. For instance, answers to code-golf challenges should attempt to be as short as possible. You can always include a readable version of the code in addition to the competitive one. Explanations of your answer make it more interesting to read and are very much encouraged.
…Include a short header which indicates the language(s) of your code and its score, as defined by the challenge.

More generally…

…Please make sure to answer the question and provide sufficient detail.
…Avoid asking for help, clarification or responding to other answers (use comments instead).

Draft saved

Draft discarded

Edit Summary*

Cancel

Add a comment |

How to Edit

Correct minor typos or mistakes
Clarify meaning without changing it
Add related resources or links
Always respect the author’s intent
Don’t use edits to reply to the author

How to Format

create code fences with backticks ` or tildes ~
```
like so
```
add language identifier to highlight code
```python
def function(foo):
print(foo)
```
put returns between paragraphs
for linebreak add 2 spaces at end
_italic_ or **bold**
indent code by 4 spaces
backtick escapes `like _so_`
quote by placing > at start of line
to make links (use https whenever possible)

<https://example.com>

[example](https://example.com)

<a href="https://example.com">example</a>
MathJax equations \$\sin^2 \theta\$

formatting help »
answering help »

MathJax help »

How to Tag

A tag is a keyword or label that categorizes your question with other, similar questions. Choose one or more (up to 5) tags that will help answerers to find and interpret your question.

complete the sentence: my question is about...
use tags that describe things or concepts that are essential, not incidental to your question
favor using existing popular tags
read the descriptions that appear below the tag

If your question is primarily about a topic for which you can't find a tag:

combine multiple words into single-words with hyphens (e.g. code-golf), up to a maximum of 35 characters
creating new tags is a privilege; if you can't yet create a tag you need, then post this question without it, then ask the community to create it for you

popular tags »