OK, smarties - solve this one

[Faithless]

Without lifting your pencil or retracing any lines, draw this image:

http://img78.photobucket.com/albums/v245/chottomatte/yw0002.jpg

Is it solvable?

Yes, I do know the answer.

[Commando_turned_MD]

Yes it is....I remember doing a similar problem

[mr. x]

this isnt that hard u just do diagonals first

[ism]

Yes. You also need to add the condition that the pencil can never leave the same surface (like folding the paper over) since it's not one of those "think outside the box" problems.

[Faithless]

Solvable, ayyy?

This web page says it's not, and for a very simple reason that applies to all pencil-line problems of its kind:

http://web.ukonline.co.uk/conker/puzzles/lyle's-puzzle.htm

[mr. x]

oh my bad

[lazydude]

yay i did it

[mr. x]

yay i did it
ummm no u didnt

http://web.ukonline.co.uk/conker/pu...le's-puzzle.htm

[SunWuKong]

Without lifting your pencil or retracing any lines, draw this image:

http://img78.photobucket.com/albums/v245/chottomatte/yw0002.jpg

Is it solvable?

Yes, I do know the answer.

after many trial and error repetitions... :rolleyes:

i started thinking about it instead. in a node with an odd number of connections, eventually you'd end up "traveling" there with no way out, since you can't retrace a line. there are 5 nodes, and you can only begin your trace from one node. that means for the other 4 nodes, you can only "travel to" it. however, 4 of these nodes have an odd number of connections. which means a diagram like this would only be possible to solve if the diagram does not have more than 2 nodes with an odd number of connections (you can begin from one and end at the other).

Solvable, ayyy?

This web page says it's not, and for a very simple reason that applies to all pencil-line problems of its kind:

http://web.ukonline.co.uk/conker/puzzles/lyle's-puzzle.htm

yay my discrete math class from years ago came in handy. :tongue:

[Faithless]

It also takes a farting puzzle solver to understand what the fart zero or two odd nodes means in the first place. :rolleyes:

[jz87]

Search for "Seven bridges of Konigsburg" on google. This is a very old class of graph problems that was first solved by the famous Swiss mathematician Leonhard Euler.

[Cipherous]

I forget Euler's rule but he proved that for every graph, you can traverse every edge if and only if the number of edges were odd or something like that.