Видео

10

🙏🙏🙏🙏🙏

Ganpati bappa morya ❤

This deserves 3973834757484847475858585858 comments

Good job and sound

Sounds good!

Cool 😅❤😊

Happy Independence day bro

This image can be represented by a graph with vertices at every line intersection. This puzzle is equivalent to asking if there is an Euler path on that graph. I learned in college that a graph only has an Euler walk if and only if exactly two or zero vertices have odd degree - that is, if and only if two or zero intersections have an odd number of lines sticking out of them. I count six. So, I claim that this is impossible. Looking forward to being given a solution and being proven an idiot.

Hdec

Its mathematical impossible without doing some cheating trick like the last attempt. It is possible to trace a graph when there are 2 or less nodes that have an odd number of lines connected to it. Unfortunately for this graph, every node has 3 lines and there are 8 nodes, so there are 8 nodes with an odd number of lines which is more than 2, thus impossible. QED

It's not possible

Nice ❤ well done 👍🏽 1:41

You just need to start and end at the points with 3 lines going in and out. As long as you keep that in mind it's easy to find many solutions.

I solved it just by looking at the thumbnail. This is not impossible, it is kindergarten level

sewen

Well this click bait account is being blocked

Without watching the video, you start at the bottom right of the rectangle. Go up, left, diagonal down, all the way to the right (drawing entire bottom), then just fill in the middle

you act like that is difficult and like all of those failed attempts couldnt be fixed very easily by just looking for more than half a second

5 rectangles

5

I did it another easier way

Impossible because it is, solution is dumb, video is 120 seconds too long, be better.

Awesome!

what if i trace on the same lines to do it

Thats some next level trolling

if i remember graph theory correctly, for this kind of problems there must be exactly 0 or 2 nodes with an odd number of edges to be able to make a path that crosses every edge exactly once

the pen was lifted by the thickness of one sheet of paper

I... dont know what I did to my algorithm to end up here

this made my brain cell count sharply decline

Here is a trick to these kinds of puzzles. Every point has a number of lines going in and out of them. We call those points nodes, and the lines edges. Most nodes will have an even number of edges connected to them, and you can pair them up for a line of drawing going through the node for each such pair. The place you end and start will also need and extra edge. This means that for such a puzzle to be possible to solve it must either have 2 nodes with odd number of edges or have no nodes with odd number of edges, the former meaning that you need to start and end in that set of nodes and the latter meaning that you will have to start and end in the same node, and it is possible that there are more than one place where you can start and stop. For this puzzle, there are 2 nodes with 3 edges, which is the corners where the two lower boxes join. Once you start using this trick, these puzzles becomes much, much easier to solve, to the point where it almost feels like they solve themselves. Heck it will often be that you reach a node and no matter which edge you chose to go through next it will be part of a solution to do that.

Solution at 1:50

Easy, gg.

Yayy!

Easy

That don’t count gng

there is no way that counts

If there are more than 2 points with an odd number of vertices, the puzzle is impossible, as an odd number means that that point must be either the beginning or endpoint of your drawing.

that /ðat/ pronoun 1. used to identify a specific person or thing observed or heard by the speaker: "that's his wife over there" 2. referring to a specific thing previously mentioned, known, or understood: "that's a good idea" determiner 1. used to identify a specific person or thing observed or heard by the speaker: "look at that chap there" 2. referring to a specific thing previously mentioned, known, or understood: "he lived in Mysore at that time" adverb 1. to such a degree; so: "I wouldn't go that far" conjunction 1. introducing a subordinate clause expressing a statement or hypothesis: "she said that she was satisfied" 2. expressing a wish or regret: literary "oh that he could be restored to health" Solved!

Agree with HobbyAccount. It can’t be done. If there are locations where an odd number of lines come together, there must be exactly two, one where you start and one where you end. Here there are six such locations.

It’s impossible, for a graph like this for there to be a single path that crosses all points exactly once there can only be to nodes on the graph that have an odd number of vertices

yes "solved"...

This puzzle I can solve, you got wrong

That is wrong - the line in the middle is missing. But is is easy to start the drawing at a different point to end with the middle line

With these puzzles, the secret is to identify which vertices have an odd number of lines: a vertex with an even number will have the same number of entrances and exits, but a vertex with an odd number must have one extra entrance or exit. Therefore, if there are any vertices with an odd number of lines, there must be *exactly* two such verticies, and one is the starting point, and the other is the ending point.

You got it wrong bro

clickbait title

Can you solve the puzzle? No I cannot. Because it’s impossible

You have to fold the paper

These puzzles are known as "eulerian paths" in mathematics. Euler proved that a puzzle of this sort is not solvable if there are more than 2 vertices with an odd number of lines coming out of each. In this case, there are 4 of them (the outer vertices), so it's not an eulerian graph and it is therefore not solvable.