This year’s 24 hour puzzle marathon is just over. Thanks to the organizers, authors and participants for a great weekend. I contributed a round again. It turned out a little less polished and balanced than last year’s, but there’s a couple of nice puzzles in there. Puzzles below, or grab a copy of the booklet.
Two more Checkered Fillominos. I made a bunch of them for the 24 hours that take place in Budapest this weekend. These here use some different logic. The first one turned out to have an easier break-in that circumvents what I had in mind, but maybe the similarities help as a hint?
This is a Starwars puzzle, another of the types on the GP. Inspired by a certain puzzle on the portal.
Rules Place stars in some cells, such that cells with stars don’t touch, not even diagonally, and such that each row, column, area and line has exactly two stars.
Here are two neighbors puzzles, a type which features on next weekend’s Dutch round of the WPF Puzzle GP. This time there is plenty of practice material, see Richard’s comment on the GP forum.
I made the second one first, but it appears I broke or imagined some of the logic. It does seem to have turned out unique. Usually I wouldn’t post it, but maybe it’s good practice for dealing with an impenetrable puzzle? If you find a nice way through, do let me know.
Rules Place a digit between 1 and 3 in every cell, such that each row and column contains exactly three copies of each. A cell is shaded if and only if the digit that it contains is different from all orthogonally adjacent digits.
Maybe Puzzles 