Can you solve this? It's stressing me out! 🤯

impossible

It's easy to see that it's impossible by coloring and counting. You must take 13 steps, odd numbered steps must step on a green square, even numbered steps cannot. You need six odd steps because there are 6 green squares, but 1, 3, 5, 7, 9, 11, and 13 are odd. That's 7.

It is, in fact, impossible! Any valid path must start and end at the top-right square and bottom-right square (in our perspective) in some order, because each of those squares is adjacent to only one square hence cannot be encountered in the middle. Since there are 14 squares total, 13 steps are required, which is an odd number. If you checkerboard-color the squares (imagining them being part of a larger grid), every step switches the color, so to get from the top-right square to the bottom-right square in the odd number of steps, you would have to end on the opposite color from where you started. This is impossible because the top-right square and bottom-right square would have the same color in a checkerboard-coloring.

No one can, the just want engagement.

This puzzle isn't hard... it's straight up trolling us 😭 14 squares, two lonely dead end corners, and 13 steps? Bro the math said "nope" before you even hit record. I'm not stressed, I'm betrayed 😂

Challengenya susah juga nih

Only possible with at least one diagonal move.

This is too simple, I got it in one try😭😭

I’m having trouble applying the two odd vertices only rule. If you add a fourth row to the three central ones then you could visit all the squares even though there are many vertices with an odd number of edges. Help!

Here's a full proof that there is no solution. Assume a solution exists. The solution's first step must be the green square labeled 1 because that's the only square adjacent to the starting square. The solution's second step must be one of the black squares labeled 2 because those are the only squares adjacent to the first step. There are 13 steps not counting the starting square. So the last step, step 13, must land on the black square labeled 13. Since the only step adjacent to that is the green square labeled 12, the second to last step, step 12, must land on that square. But each black square is only adjacent to green squares and each green square is only adjacent to black squares. So steps must alternate between black and green squares. Since step 1 lands on a green square and 1 is odd, step 12 cannot land on a green square since 12 is even. So step 12 both must and cannot land on a green square. This is a contradiction, so our assumption that a solution exists must be false. Thus no solution exists.

@grok この問題は隣接するマスに縦横にしか移動できない、かつ二度と同じマスを踏むこともできないルールです。解はありません。賛同しますか？

There I got it

Very intelligent game.

90° turns only.

Cant be done unless you break the rules. Create an unsolvable get a unsolvable. Dont beat yourself up, you win by saying the path doesnt exsit.

I speak for everyone when I say it’s here we all agree the puzzle is tough😌

Think out of the box 🤷🏻‍♂️

@grok what is the solution for the puzzle above?

It depends. But what are the rules? 😁 I have these paths. Are they allowed?

Can you even get out of this I don’t think so

stress banget liatnya

Just think outside the cage… Out of jokes, without diagonal movement, it has not solution.

ChatGPT 5.6 High solution

I did it😀

wahhh keren banget ya ini kan seru deh