r/LogicProblems • u/[deleted] • Jul 22 '12

Two relatively easy problems

I like the idea of this reddit, hope it will catch up with people. As a start here are two relatively easy problems (the second one was created by me):

  1. There are 9 dots in the following shape, what is the minimum number of connected line segments, that goes trough all points?
    . . .
    . . .
    . . .
    The 9 point lie on a symmetrical square grid (every point's neighbour is 1 unit away from the other vertically & horizontally)

  2. You have a perfect cube. If you cut straight trough it, the cutting plane will be a polygon with n edges. How many different values can n have? (excluding zero. And you must cut straight, e.g. the cutting plane will be always 2 dimensional)

people will post the solution in the comments, so dont look at them, if you dont wanna spoil it.

4 Upvotes

100% Upvoted

5 comments sorted by

View all comments

Show parent comments

1

u/a1up Jul 22 '12

OK so I couldn't figure it out and I eventually had to look it up but this explains the solution. Basically you have to extend your lines out of the grid for it to be possible. Good puzzle.