We want to cut a regular hexagon into several regular polygons such that
What is the minimum possible number of pieces that the original hexagon can be cut into?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Here is how to do it with 1 2 :
And, without a rigorous proof, I believe 1 2 will be the smallest, since you will need to have hexagons in each corner, and at least one triangle on each edge to connect the hexagons.
I also believe that this is the only arrangement (not counting rotations).
Thanks @Paul Hindess for correcting my original solution!