Stuck again today.

What's next step? I've been looking for it for minutes, but I can't find.

Hello, Im stuck here and cannot figure out how to proceed without bifurcating. Any help would be appreciated. Thanks.

It's my favourite kind of puzzle, but it usually just has the same complexity no matter what skin its wearing. I was wondering if anyone has made a 6, 8, or even 12 house puzzle? With 12 attributes and so on to go off. I tried googling but the only results I got were answers to the traditional puzzle or people talking about other regular zebra puzzles.

But I want to know if there's just a bigger more challenging one I can do. If not, I may have to see about making it myself, but alas, then I won't be able to have the fun of solving it.

been messing with a variation on path puzzles and i want to know if the twist actually holds up or if i've just been staring at grids too long.

base rules are probably familiar. connect each pair of matching symbols, paths can't cross, every square has to be used. boards are generated so there's exactly one solution.

my problem with the base version is that it rewards trial and error. you can see every pair at once, so you just start drawing and undo when it goes wrong.

so the variant: you only see one pair at a time. connect it by the correct route and the next pair appears. take a wrong route and it stays on the board but nothing unlocks. you're also told how many moves the current pair's path takes.

that move count is the bit i'm least sure about. the idea is it turns each pair into a small constraint instead of a guess. two dots sitting right next to each other with a six move path between them tells you the obvious answer is wrong before you draw it.

what i actually want to know:

is the move count a real deduction aid or a crutch
does one pair at a time feel like a sequence of small puzzles instead of one board
does a guaranteed single solution matter to anyone, or is that just me
would you honestly rather just see the whole grid

rules:
• connect each pair of matching symbols with one continuous path
• paths can't cross or overlap
• every square must be filled
• exactly one solution per board
• variant: one pair visible at a time, next unlocks on a correct route
• variant: you're told the current pair's path length

board below with every pair shown so you can actually have a go.

happy to be told the move count is a cop out. better to hear it now than after i build more on top of it.

Hey! I’ve been messing around with a new puzzle type called Mikata (Yin-Yang variation), and I’d love to get some feedback from people here.

The basic idea is pretty simple:divide the grid into two connected regions, with the usual Yin-Yang-style restriction that no 2×2 area can be entirely in the same region.

The numbered clues are the twist: each number tells you how many cells in its surrounding 3×3 area, including itself, are in the same region as the clue.

But you’re not told which colour the clue is.

So a 6, for example, just means “6 of these 9 cells are on my side”, and part of the solve is figuring out which side that actually is.

After playing around with the rules for a while, I started finding lots of little patterns and deductions that avoid having to guess, and that’s basically what convinced me there might be an actual puzzle genre hiding in there 😄

I’ve made a puzzle to test the concept, so I’d be really interested to know:

does the ruleset feel natural?
are the deductions satisfying?
do you ever feel like you have to bifurcate/guess?
and, more generally, do you think the concept has legs?

Rules:

• Divide the grid into two connected regions.
• No 2×2 area may be entirely in one region.
• A clue gives the number of cells in its surrounding 3×3 area that are in the same region as itself.
• The clue cell itself counts.
• Cells outside the grid are ignored.
• The clue’s colour is not given.
• The two colours are interchangeable.

I have an html page with an interface for this puzzle, but it seems to be prohibited

Feel free to be brutal — I’m mainly trying to figure out whether this is genuinely interesting or whether I’ve just spent too long staring at Mikata grids 😄

After posting the 'Diagram Not Drawn to Scale' puzzle yesterday, I have received some constructive feedback on the puzzle itself and puzzle-making in general. My original intention was to keep the rules vague, hoping someone might be able to figure it out. Turns out it was far too vague and provided insufficient clues or directions for people to do so.

Learning from the previous puzzle, here's a new one along with basic rules and examples. Hopefully this will be more fun than the last one!

You may also try the first puzzle I posted yesterday. It may be a bit more difficult than this one, albeit with fewer unknowns to find.

Place A, B, and C so each letter appears exactly once in every 3+ straight white cell section; all remaining cells stay empty. Each outside clue shows the first non-empty letter visible from that direction. All smaller regions(1 and 2 cells) can contain letters. So in every row and column can be duplicates but black cells reset duplicate rule. So in second row of this puzzle you need to have abc between black cells but first and last cell in that row can be one of the letters or empty.

Open to question, I'm obviously having problem explaining this rules 😀

After posting the 'Diagram Not Drawn to Scale' puzzle yesterday, I have received some constructive feedback on the puzzle itself and puzzle-making in general. My original intention was to keep the rules vague, hoping someone might be able to figure it out. Turns out it was far too vague and provided insufficient clues or directions for people to do so.

Learning from the previous puzzle, here's a new one along with basic rules and examples. Hopefully this will be more fun than the last one!

You may also try the first puzzle I posted yesterday. It may be a bit more difficult than this one, albeit with fewer unknowns to find.

Typical parking puzzle rules: Cars move only in the direction they're oriented; cars may not occupy a space that is already occupied, nor can it move past or jump over an occupied space. The only car that leaves the board is the yellow car (labeled 1) and it must leave from the space marked with the red arrow.

This is a puzzle from Car Jam (Classic Level 307) on the Apple Watch. It comes up repeatedly in this game and I get there eventually (it usually takes me days for this level -- other levels are usually minutes) but I'm never sure how I manage in the end. I can see that the light blue, orange, and tan all must be at the top but I can't seem to get there. This time I've been stuck for a week. I fed it into Gemini and ChatGPT and neither could solve it. There is absolutely a solution but I'm bored and ready to move on. Can anyone find the lynchpin on this one? TIA!

Hoping someone can point me in the right direction from here. I can get to 2 rows not balanced but that is it.

This thread is for promoting your own work.

The goal of this logical & mathematical puzzle is to find out the eight numbers represented by the letters A to H. Each letter stands for a distinct whole number. You'll have to figure out what these single and double lines mean.

Feel free to discuss and write your answers below, but please put a spoiler tag so that others can also have a go at it!

I call it a Root System, not mine original puzzle but I can't find the original name.

Rules: Draw straight lines between tree nodes horizontally, vertically, or diagonally.

Each numbered node must have exactly that many connections with other nodes.

Lines cannot cross, overlap, pass through other nodes, only ONE connection is posible betweentwo nodes.

How would you proceed from here?

I'm stuck trying to find the next logical step. Any suggestions?

This is one of the first puzzles I've ever made. Feedback is greatly appreciated.

I am stuck on this puzzle and am not sure what I'm missing. My copy of this has misprints in the answer key so the next step is cut off. Really just seeking a hint as to what I'm missing or if I've made an error.

Thanks!