Mfcttrf

This is a Heyacrazy puzzle, designed at request of testsolvers of previous puzzles who wanted to see how longer diagonals would work.

Rules of Heyacrazy:

• Shade some cells of the grid.




• Shaded cells cannot be orthogonally adjacent; unshaded cells must be orthogonally connected.




• When the puzzle is solved, you must not be able to draw a line segment that passes through two borders, and does not pass through any shaded cells or grid vertices.

For an example puzzle and its solution, see this question.

Solution:

There are lots of quick and easy deductions at the bottom, starting with the two cells that on their own contain two edges and leading to this:


One of the two cells on the top edge where two lines meet must be shaded. If we try letting it be the right-hand one, we quickly get to this impossible situation


and so instead it must be the left-hand one:


One of the two currently-blank cells in column 3 must be shaded. Can it be the lower one? If so, then we have this


which is impossible because now lines emanating SE-ish from the third cell on the first row require two adjacent cells to be shaded. So in fact it was the upper of the two cells in column 3 that's shaded:


requiring the cell one left and one down from the top right corner to be shaded, which immediately requires all the other cells near it to be unshaded for connectivity


leading us rapidly to


and then


and we're done.

Labelling the rows 1 (top) to 7 (bottom) and the columns A (left) to F (right), our first step is that

A5 and F6 are clearly shaded, which means A4, A6, B5, F5, F7, E6 are unshaded. Then B6 is also shaded, which means C6 and B7 are unshaded. For connectivity of unshaded squares, now A7, C7, and E7 must be unshaded.

Next target to be shaded is

E5, with unshaded around it, and then D6, with unshaded around it. For connectivity, now C5 must be unshaded. Then D4 must be shaded, with unshaded around it.

Now we have a few sets of squares of which at least one must be shaded:

D1 and E1, C1 and C2 and C3, D1 and E2. That means if E1 is shaded, then D1 is not shaded and so E2 is shaded, contradiction. So D1 is shaded, which means C1, E1, and D2 are unshaded, which means exactly one of C2 and C3 is shaded.

Trying a similar deduction technique again:

At least one of C2 and E3 must be shaded. So either C2 is shaded, or C3 and E3 both are. In the latter case, we get the following with no unique solution:

So in fact

C2 is shaded, which means B2 and C3 are unshaded, and B1 for connectivity. Now E2 must be shaded (I think), and then everything else in the top right corner must be unshaded.

Finally,

B3 must be shaded, so B4 and A3 are unshaded, and A2 for connectivity. Then A1 must be shaded and we're done: