They do not know how to solve this problem. You can?

Just go around the world. Easy

Solved it!

Can you solve this puzzle?

Carving a piece of art out of watermelon.

Start in the upper right corner.

Hard puzzle to solve from the 18th century

Of course you can. It is just a matter of ...perspective

The puzzle that seems difficult to solve.

Collective intelligence of ants solving a puzzle

Simplest way

Not solvable

Easy

This video makes me happy

It can be done, but it requires the contestant to slip into non-Euclidean dimensions of angular space, which will, of course, make them visible to the hounds of Tindalos... and, well... it's just not worth it at that point -

Lots of people get it wrong answer. Can you solve it?

If you cant retrace your steps or go diagonally its impossible

Very easy

@grok how fast can you solve this?

@TheFigen_ Instantly—it's impossible. The yellow tape forms a graph with more than two odd-degree vertices, so there's no Eulerian path to trace all lines without lifting your foot or retracing. That's why they keep failing.

@charlesace_ @TheFigen_ They are looking for Hamiltonian paths not Eulerian paths

@charlesace_ @TheFigen_ The task in the video is to trace all the tape lines (edges) without lifting or retracing, which is an Eulerian path problem. It's impossible due to multiple odd-degree vertices. Hamiltonian paths focus on visiting vertices once, but here it's about covering edges.

@charlesace_ @TheFigen_ No, the task is to find a path that traverse each yellow tape box (vertices) exactly once

Upon reviewing the video, the participants are attempting to trace all the yellow tape lines continuously without retracing or lifting their path, which aligns with an Eulerian path problem. The graph has four odd-degree vertices, making it impossible. If the goal was visiting each box once (Hamiltonian), a path exists in a 3x3 grid, but that's not what the attempts show.

@charlesace_ @TheFigen_ It has nothing to do with tape lines individually, the lines for different boxes, and those boxes are vertices. Nobody cares about which line u step over

The video shows participants trying to trace all yellow tape lines (edges) continuously without retracing or lifting, an Eulerian path problem. With 8 odd-degree vertices in the 4x4 grid graph, it's impossible. The green overlay follows the lines, not box centers, confirming this. If it were visiting boxes (Hamiltonian), it'd be possible, but that's not what's depicted.

here's the solution:

Could you solve this?

lol

🤭🤭🤭🤭🤭🤭🤭🤭

ez

Here we go ☺️😎

A puzzle that seems hard to solve.

Hardest puzzle ever

if moving on a diaganal is permited then their are numberious paths!

This is solvable if you allow them to walk out of the boxes or walk diagonally.

I seriously do not understand the point of this exercise

Simple!

You can prove it's impossible by giving the squares alternating colors. There's 8 white squares and 6 black squares, but any path that visits 6 black squares must visit 5, 6, or 7 white squares, depending on starting/ending colors.