This is definitely the hardest of the Wall Mazes I’ve constructed, but there’s a clean logical solve path here that doesn’t require any deep lookaheads and is worth finding.
Rules: Draw a non-intersecting loop through the centres of some cells. If two cells are separated by a border, the loop visits exactly one of them.