Pipes Puzzle Uniqueness

Question

In the puzzle game Pipes, a space-filling tree of pipes (which may have either one, two, or three neighboring connections each, but not four) is scrambled by a series of tile rotations, and the goal is to reconstruct the solution. To do so, you may rotate any tile, including the "source" tile (marked with a red circle), any multiple of 90°. (Note: "space-filling tree" means every tile/square must have a pipe part on it, and no loops are allowed)

Main puzzle statement: Is it possible for a Pipes puzzle to have multiple solutions (equivalently: is it possible to transform one tree into another via rotations)? What might be the smallest $N$ for which this can happen on an $N \times N$ grid?

Easier analogue: Pipes Lite is a fictional alternative in which pipes may have only one or two neighboring connections each. Is it possible for a Pipes Lite puzzle to have multiple solutions?

More difficult analogue: Is it possible for a Pipes puzzle to have no possible tile orientation deductions from the outset? That is to say, any individual tile has at least two orientations belonging to separate solutions?

                                

Answer 1

Answer to the "more difficult" question:

I claim that

yes, it is possible

and here's why:

Here are two solutions to a Pipes puzzle where no pipe is in the same orientation in both solutions.

Easier analogue:

I claim that

No, it is not possible.

and here's why:

There is a single solution to any Pipes Lite, which can be found as follows:
Say that each tile is labelled with "straight", "turn", or "dead end".


We're going to mark each border between two segments with "wall" or "pipe" to reconstruct the solution:

Mark the edges all around the border with "wall". Then, for any straight tile, we can copy its marking to the other side; for any turn, we can copy the other marking to the other side.

Here, I've marked the walls on the left side, and then done the transfer for the first column.
And here, it's done for the second:


This can be repeated starting from all four directions, not doing transfers at dead ends:


And the solution is directly drawn out. (If the dead ends are in the same row or column, you may need to do transfers with the dead ends first - if all three sides are walls, draw a pipe in the remaining direction, otherwise draw a wall. Then you can continue as normal, and finish drawing the loop.)

Normal question:

It's possible to do with 4×4:


It's not possible to do with 3×3:
- If a corner piece changes, it must be a dead end; it forces the cell next to it to be a turn...

...and that forces the other corner to be a dead end. This continues around the whole board, and then the center is forced to be a +, which is disallowed.
So no corner pieces can change between solutions, so no edge pieces can change between solutions, so the middle cannot change between solutions.

Answer 2

Here’s a solution that has only some non-unique pipes. My strategy is having that sort of outer parity loop, and filling in the middle in any way. This can be made for any odd square, and I believe the inner fill for a 5x5 is impossible using this strategy. Wouldn’t be shocked if you could do something similar with a 6x6, and I will look into it some more.