Logic Masters Deutschland e.V.

Blackout Touching Slitherlink - Tetrominos

(Eingestellt am 22. November 2022, 18:14 Uhr von KNT)


Touching Slitherlink: Draw a closed loop that travels between some vertices of the grid that uses each gridpoint at most once. Clues indicate how many times the loop visits the respective cells. In this context, a “visit” is defined as a contiguous section of the loop traveling on the boundary of the cell in question, including the possibility of just a single corner point; two such sections are considered separate visits if the loop leaves the boundary of the cell between them.

Blackout Tetrominos: Blacken some cells in the grid such that all blackened cells form tetrominos, and no two tetromino shapes may repeat, including rotations or reflections. Tetrominos may not touch each other, even diagonally. If a cell with a clue is blackened, then that clue is ignored. Every tetromino must be placed outside the loop.

Play on Penpa+!

Answer check is enabled with green loop segments, and the tetrominos must be shaded any of the three choices of grey.

Lösungscode: Row 3, If a cell is blackened, enter the letter corresponding to which tetromino the blackened cell belongs to (L, I, T, S, O), otherwise, enter the valid touching slitherlink clue for the cell.

Zuletzt geändert am 22. November 2022, 19:44 Uhr

Gelöst von Niverio, Myxo, the_cogito, polar, jovi_al, MagnusJosefsson, Mark Sweep, Koalagator2, kjholt, SPREVVIE, Jesper, harrison, Statistica, Alfred, Franjo, moeve, Vebby, wooferzfg, Jakhob, Xilentor, jessica6, AnnaTh, ch1983, OGRussHood, Alex, Luigi, ascension, Jaych, Dandelo, AMD, Gaabje1234
Komplette Liste


am 26. November 2022, 08:05 Uhr von wooferzfg
Beautiful logic, thank you!

am 22. November 2022, 20:15 Uhr von jovi_al
Lovely little puzzle! Nothing tricky, just a nice way to spend a small portion of your day :)

am 22. November 2022, 19:27 Uhr von Myxo
Nice! But it's harder than 2* in my opinion ;)

am 22. November 2022, 19:17 Uhr von KNT
Posted with a missing clue. Apologies!

am 22. November 2022, 18:19 Uhr von Niverio
Finally a cute KNT puzzle :)

Bewertung:97 %
Gelöst:31 mal
Beobachtet:2 mal

Lösung abgeben