Touching matches
Three matches can be arranged so that there are two matches meeting at every junction.
Can you arrange matches so that there are three matches meeting at every junction and no loose ends? What is the fewest number of matches that can be used to solve this puzzle? How many matches if the solution lies on the table? How many matches if there are no such restrictions?
With three matches there are these possible arrangements of
joined matches Each has a different pattern of nodes.
They can be notated as
(1,1,2,2)
(1,1,1,3
)
(2,2,2)
How many arrangements are there with 4 matches?
This would be (2,2,2,2)?
How many others are there?