You are asked to place matchsticks on a flat surface such that each matchstick end meets three others, and no matches cross. It is easy to achieve this for patterns that extend indefintely:
The challenge is to truncate such patterns to finite 2D networks. How small a matchstick network can you create?
Further clarifications: the matchsticks all have equal length and can be thought of as mathematical line segments. At each point of contact, exactly four ends meet. All matches lay flat on the surface, no gluing allowed!
Answer
I must admit that I found It with google but this is the solution:
No comments:
Post a Comment