I was introduced yesterday to this great type due to Eric Fox of f-puzzles, and decided to go ahead and add it to the puzz.link applet. Here’s one:
Rules Shade some cells, so that all shaded cells are connected by edge. Clues indicate the number of shaded cells in a room. There can’t be more than three shaded or unshaded cells in a row, i.e., no I-tetromino can fit fully inside the shaded or unshaded cells.
Here’s a Where is black cells? puzzle that I made after I was spoiled on the argument behind this tough one by edderiofer. Not sure solving this one will help with that one though.
Here’s a Five Cells puzzle with the extra rule that the same pentominoes can’t touch along an edge, as for Pentominous puzzles.
Here’s a Heyawake puzzle that I published on the new-ish puzsq.sakura.ne.jp puzzle collection website.
I should be writing up my experience in Kirchheim from two weeks ago, where I managed to beat Ulrich Voigt to take my first German title. Instead, here’s a Geradeweg puzzle, to serve as an advertisement for the Puzzler’s Club contest at LMI next weekend. The contest will feature two puzzles of mine (a Geradeweg and a Checkered Fillomino), next to a number of great puzzles by other authors.
David Millar of thegriddle.net came up with a neat new type recently with Times Zone. It’s a hybrid of latin square and loop puzzle, where the numbers inside the loop (in the “times zone”) form products while the numbers outside form sums. Check out the Intro to Times Zone for detailed instructions and a walkthrough. Here’s one I made, enjoy:
Rules Fill the grid with digits 1-6, so that each row/column contains each digit exactly once. Furthermore, draw a single loop along the grid lines that doesn’t touch or cross itself.
The loop divides each row/column into groups of digits. Each such group of digits corresponds to a number; it’s the product of these digits if the group is inside the loop, and the sum otherwise. Clues outside the grid describe the groups in that row/column in the correct order; an asterisk (*) stands for an arbitrary amount of groups, including no group at all.
Here’s a new loop type. You can solve and check your answer over here. (Let me know if that works for you and is useful, very much work in progress.)
In other things:
Finally here’s the puzzle:
Rules Draw two loops that consist of horizontal and vertical segments. One loop goes along the grid lines, while the other loop goes from cell center to cell center. Clues indicate how many of the (up to) four adjacent edges have an intersection of both loops.
Example
Maybe Puzzles 