Here’s another one from the LM preparation. EDIT: new version fixing an ambiguity.
Rules Shade some cells, such that there’s at most one unshaded copy of any number within a row or column. Shaded cells must not share an edge. Then draw a single loop that travels horizontally and vertically between cell centres that visits all unshaded cells.
Here’s a Hitori puzzle that I made a while back. Which gives me an excuse to advertise the German Logic Masters that take place in Stuttgart on Saturday, which include a Hitori-themed round among others. The instructions were published this weekend, it promises to be an excellent set of puzzles. What’s more, this year the contest will also be offered online with a slight delay, see this forum thread.
Maybe Puzzles 