Puzzle 63: Rings from Hell

Tetromino Slitherlink Divide the blue cells (marked T) to tetrominoes. Put each of 0,1,2,3 exactly once to each tetromino so each cell contains one number. Afterwards, solve the resulting Slitherlink puzzle: Draw a loop following the grid’s edges. A clue tells the number of edges of the square it’s contained in that belongs to the loop.

Tetromino Slitherlink Example

Difficulty 9.0/10 • Target times 15:00 30:00 1:00:00 6:00:00
Solution PNG (not uploaded) • PDF (not uploaded)

Puzzle 63: Rings from Hell
Tetromino Slitherlink

UPDATE 30-May-2014: I forgot whether this is supposed to be Liar too, as there’s no indication of Liar other than the instructions accidentally having a single sentence. I think not, and so I remove the Liar condition for now. I’ll testsolve it again when I have time; if someone finds this puzzle to be broken due to the Liar condition being removed, tell me too.

Yes, Rings from Hell. Because it has rings and it has 9.0/10 difficulty. As in you have to do lots of nontrivial brute force to obtain the solution. But then Tetromino Slitherlink is mostly brute force. I think I should wish you luck. The difficulty escalates (which is much better than decreases, as you can brute force the remaining—wait, then again, brute force is the only way to solve the endgame so far). A far tamer puzzle will be up in 12 hours.

Deception has ended. Congratulations to Hideaki Jo (deu), Palmer Mebane (MellowMelon), and xevs (Ko Okamoto) for topping the test, and additionally EKBM (Endo Ken) alongside the top three to complete the test. Solutions for select puzzles (so far two) can be found in the thread. Solutions are made on demand, so post there or comment here or e-mail me or notify me however the method if you want a solution for some other puzzle.

EDIT: Fixed example. Thanks for mathgrant to remind me.

Puzzle 13: Tetromino Slitherlink

Tetromino Slitherlink. Follow usual rules of Slitherlink. In addition, the gray squares can be partitioned into tetrominoes such that in each tetromino, each number from 0-3 appears. Pretty hard because it’s first time. Well it’s first time; I can’t estimate its difficulty properly.

Puzzle 13: Tetromino Slitherlink

Yay. Okay the tetrominoes are obvious, but putting the numbers aren’t that obvious.

I can obviously imagine a version where the tetrominoes can be ambiguous. As long as the numbers (and hence the loop) are fixed, it doesn’t matter how the tetrominoes are divided. Or otherwise, without given numbers. The latter would be way more difficult actually, because I couldn’t think of an opening without a number. Time to ask someone good at making difficult puzzles.