Monthly Archives: April 2015

Puzzle set: 24 Hour Puzzle Marathon, 2015 edition

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.

Continue reading

Advertisements

Puzzle 61 & 62: Neighbors

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.

neighbors2neighbors

 

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.