Please turn on javascript in your browser to play chess.
Posers and Puzzles

Posers and Puzzles

  1. 24 Feb '08 22:32
    u have 6 dots..

    . . .

    . . .



    upper dots must connect with all bottom dots and either way, with a line..
    cross line is illegal...
  2. Standard member Mexico
    Quis custodiet
    24 Feb '08 22:59
    Originally posted by anthranilate
    u have 6 dots..

    . . .

    . . .



    upper dots must connect with all bottom dots and either way, with a line..
    cross line is illegal...
    Using the top line as a base for this explanation;

    Draw large sort of ellipses around the outside of the rest of the dots to connect the left most dot to the other 3.........
    Directly connect the center dot to the other 3 using straight lines....
    for the right hand dot go right around........... Aghhhhh to hard to explain.... Do it on paper.....

    The other option is to do this with your lines since you never stipulated that the lines had to connect directly....

    ._._.
    l l l
    ._._.
  3. 24 Feb '08 23:12
    i already try many ways but at last, one dot cant connect with other dot.... can all of u give the specific answer...
  4. 24 Feb '08 23:45 / 2 edits
    Originally posted by Mexico
    Using the top line as a base for this explanation;

    Draw large sort of ellipses around the outside of the rest of the dots to connect the left most dot to the other 3.........
    Directly connect the center dot to the other 3 using straight lines....
    for the right hand dot go right around........... Aghhhhh to hard to explain.... Do it on paper.....

    The o ...[text shortened]... e you never stipulated that the lines had to connect directly....

    ._._.
    l l l
    ._._.
    You cannot connect all of them as the last dot pairing will have a complete barrier (360 degrees).

    This does work if you do not have to have 9 lines, but use one line to connect one top dot with all three bottom dots, then you only need three lines (or one line if you want to extend it further).
  5. Standard member Mexico
    Quis custodiet
    24 Feb '08 23:59
    Yea I did this when I was a kid, remembered that I had a solution which was really clever..... Then remembered what it was....

    The puzzle is impossible unless you do what I did, actually won 10 pounds for this which is quite funny because I half cheated......

    Basically to connect the last one I went out around the edge of the page and used that gap to solve the puzzle.......
  6. Standard member smw6869
    Granny
    25 Feb '08 02:10
    Originally posted by anthranilate
    u have 6 dots..

    . . .

    . . .



    upper dots must connect with all bottom dots and either way, with a line..
    cross line is illegal...
    1 2 3


    4 5 6

    x

    1>4>x>5>3>2>1>6


    F. GRANNY.
  7. Standard member Mexico
    Quis custodiet
    25 Feb '08 02:51
    Originally posted by smw6869
    1 2 3


    4 5 6

    x

    1>4>x>5>3>2>1>6


    F. GRANNY.
    No you misunderstand.... I've seen this before.....


    Its gotta be several lines that go:

    1>4,1>5,14,2>5,2>6,
    2>4,2>5,2>6,

    Its impossible
  8. 25 Feb '08 05:13
    Isn't this equivalent to map-coloring? The four-color theorem should apply. Is it possible to completely connect 5 dots to each other with non-crossing lines?
  9. Standard member Mexico
    Quis custodiet
    25 Feb '08 06:46
    HAHAHAHAHAHAHA you can do it, I remember now.... Its gotta be on a torus.... If you put em on a big donut it can be done.... Thats how I did it last time too.....
  10. 25 Feb '08 09:16
    You can make a hole through the paper and use that way. Nothing prohibits to make holes in the paper.
  11. 25 Feb '08 09:21
    Originally posted by GregM
    Isn't this equivalent to map-coloring? The four-color theorem should apply. Is it possible to completely connect 5 dots to each other with non-crossing lines?
    No - but they are connected. The 4-colour theorem applies to any planar graph (this is a graph - a collection of nodes (points) and vertexes (lines)). A planar graph is any graph that can be drawn on a sphere such that no lines cross.

    It can be shown that a graph is not planar if and only if it contains the graph described above (called k[3,3]) or the connected graph on 5 vertexes (k[5] - a pentagon with all nodes connected to all other nodes) embedded in it. This leads quite nicely onto the 5-colour problem.

    I know this reads quite awfully - http://tinyurl.com/33zkwr
    [wiki] describes it better.
  12. Standard member Mexico
    Quis custodiet
    25 Feb '08 09:24
    Originally posted by FabianFnas
    You can make a hole through the paper and use that way. Nothing prohibits to make holes in the paper.
    Thats what I meant by torus...
  13. 25 Feb '08 10:41
    Originally posted by Mexico
    Thats what I meant by torus...
    A paper is flat, a torus is not.
  14. 25 Feb '08 17:09
    can u guys post the answer..............really appreciate it
  15. 25 Feb '08 17:21
    Originally posted by anthranilate
    can u guys post the answer..............really appreciate it
    The answer is that it can't be done. Unless you have a torus like geometry or a paper with a hole in it or otherwise, then it can be done with a trick. But on a flat surface, like a paper, it can't be done.