Yeah, and there’s this. chaotic_iak rejected this variant for his
February
sequence in order to get consistent 7x7 dimensions, so I made one.
It’s been about a month. I have no idea why I procrastinated posting it
until now.
This is a Samurai
Fillomino,
which means each grid satisfies the constraints on its own. Write a
number in every empty cell so that, in each square grid, every group of
cells with the same number that is connected through its edges has that
number of cells. Note that the two grids must contain the same numbers
where they overlap, but the grouping should be considered independently.
I’d explain this really carefully if it weren’t the main gimmick of this
puzzle.
Yay crazy hybrids! I guess this one is kind of hard.
Draw a loop through adjacent vertices that cannot intersect itself.
For each pair of symmetrically placed numbers, one is a Slitherlink clue
which indicates how many of the four edges around it are drawn, and one
is a Contact clue which indicates the total length of all straight
segments adjacent to it where segment length is always measured up to
the nearest turns in the loop.
Please click on the image if it looks weird, which it very likely will.
(This was a WordPress bug
that should no longer be relevant.)
A Naoki Inaba
(JP) type, as seen on
Para’s
Puzzle Site.
Draw a loop through adjacent vertices that cannot intersect itself;
each number indicates the total length of all straight segments adjacent
to it, where segment length is always measured up to the nearest turns
in the loop.
Let’s see how well WordPress’s scheduling works again. Happy Chinese
New Year!
Nikoli
Slitherlink
+ Masyu
hybrid; I don’t know who first put them together but combinations like
this aren’t rare.
Draw a loop through vertices that cannot intersect itself; each
number indicates how many of the four edges around it are drawn; the
loop must pass through all large dots, and it must go straight through
white dots while turning either before or after (or both), while it must
turn on black dots without turning either before or after.
mathgrant’s
hybrid type: a Fillomino (write a number in every empty cell so that
every group of cells with the same number that is connected through its
edges has that number of cells) where each tetromino has had their 4s
replaced by one of L, I, T, or S describing their shape, and they obey
the rules of LITS — they can touch if they are not congruent, they must
all be connected, and their squares cannot form a 2x2 block.
This is another
MellowMelon’s
Double Back. Briefly, draw a closed loop through all square centers
visiting each bold-outlined area twice. Shaded cells do not influence
solving, only aesthetics.
It’s mostly easy, I think. It’s okay if you don’t know what the theme
means. (Yes, chao, I want more contrib points.) Also, WordPress seems to
have stopped automatically linking images to their files. Hmm.
It’s been a while, hasn’t it? This is something I constructed
semi-experimentally to stop failing at an entire genre of puzzles, and
then procrastinated posting just about forever. I only test-solved this
on paper; I hope I didn’t do anything silly while digitizing.
Rules paraphrased from USPC because I can’t find any good links:
Write each of the given words into its own snail; letters must be
entered from the outside of the snail spirally inward. Not all squares
will be used; squares with “-” must stay blank. Each letter can appear
at most once in each row and column.
Okay, I give up. Here it is: Gridderface is a (quoting the project description, which I wrote anyway so whatever) “keyboard inferface for marking grid-based puzzles in Java” that I’ve been working on for too long. It is open-source under the GPL v3.
Basically, it’s a thing you can paste logic puzzle images into to solve them in, like people do in Paint, when you can’t or don’t want to print them.
Noticed this at meander
lawn who has a really broad puzzle blogroll… I don’t really know
what I’m doing and may have misinterpreted something, but here goes.
(Ahahaha puzzle 33 on 11/22… I wish it was intentional :P)
Draw a path through square centers which enters and exits through the
given places. Outside the “ice barns” (the gray things), the path may
turn freely but may not self-intersect; inside “ice barns” the path may
self-intersect but may not turn. Each ice barn (not necessarily every
cell but every region, I think) must be passed over. The path must pass
through each given arrow in the given direction.
Yes, a “big” crazy mutant puzzle for a “milestone”
(as seen on xkcd), both for this
blog and for my life. Things are rough now, but I prepared this
ridiculously ahead of time. It’s still not really big, but I’m
not so experienced and I don’t have the inspiration for something like
an
entire mini-puzzlehunt. Also, I think I should attempt more
word-bank-based puzzles some day so I won’t fail as completely at
them.
But anyway: This is a Slitherlink combining MellowMelon’s
Crosslink
and
Liar
variations. Draw a loop through vertices that can intersect itself but
must go straight both times if it does; each number normally indicates
how many of the four edges around it are draw, but exactly one clue in
each row and column is false. Have fun.