I noticed that the argument I had in mind didn’t work out quite as intended in the previous Maxi Loop, here’s an updated version.
Rules Draw a single closed loop that connects cell centres horizontally and vertically, visiting every cell. Clues indicate the length of the longest loop segment in that room.
Maybe Puzzles 
Yes, this puzzle seems far more logically solvable than the previous one. While I saw roughly what the breakin in the previous one was meant to be, I couldn’t apply it there.
Yes. It’s a bit of an accident the previous one turned out to be unique at all.