To be completely honest, solving this puzzle was mostly trial and error for me. I initially focused on the top left corner and throughout the entirety of the solution path I focused primarily on testing how the diagonal relationships impacted the surrounding areas.
The Top Row
I spent a fair amount of time here, initially focused on the top left ...
Here is the finished tiling:
To get started:
Looking at the left pear:
With those chokepoints:
For the next step I took a guess:
From there, I just looked at the pieces I had left and found something that worked.
OP here (hi!). I have awarded the green checkmark to @MOehm's answer for being the most complete (the LITS solved state is presented, the hidden connecting wall is identified, and the final one-word answer has been found). I also highly commend the answer by @Sconibulus for verbalising a logical path through the LITS grid deduction process and being first to ...
I thought I'd try my hand at writing a program for Mobius sudoku. I used the Z3 SMT solver (Python wrapper) for this. There isn't much of a "solution path" to describe: most of the constraints translate fairly directly, even the wrapping around of the columns. The main difficulty was
The other constraint which required some care was:
Here's the ...
In general, with logic puzzles it's important to mark not only the parts of the solution, but also things you know can't be part of the solution. Here, that means you should mark segments that you aren't allowed to draw, because there would be no way of completing the puzzle if you did.
For example, there can't be a connection between F1 and F2, because F1 ...
Partial answer, stuck near the last step.
Diagram (apologies for messiness):
Pulling the words out, we get these lists:
These look a little like they might be Connect Walls... and I've maybe got these categories?
Partial answer for the LITS, I believed I have encountered an error.
The big aha moment (putting it early to not waste time):
Some more logic:
A very nice little step here:
And now I think I have reached a contradiction.
And this is the problem:
For the other genre:
EDIT: I would fix this today, but it's getting late where I'm from, so ...
Vanilla? Perhaps. Easy? No.
The resolved grid should look like this:
The logical break-in I found was the following:
This now enables us to shade some more spaces around the other two 7's:
Now, we just need to ask ourselves which one of the two remaining spaces to the left of the 2-4 clue needs to be shaded.
EDIT: I realise now that the example given doesn't require uniqueness to solve the puzzle, but I'll leave the example below for those interested.
I can give an example of a Sudoku where you can use uniqueness logic to get to a solution. However, uniqueness is not the only way to get to that solution, so this is probably not pertinent to your question.