Timeline for Puzzle pieces, each in contact with 5 others

13 events

when toggle format	what		by	license	comment
Apr 13, 2017 at 12:50	history	edited	CommunityBot		replaced http://puzzling.stackexchange.com/ with https://puzzling.stackexchange.com/
Feb 6, 2015 at 18:17	answer	added	Johannes		timeline score: 3
Feb 5, 2015 at 22:16	vote	accept	Johannes
Jan 31, 2015 at 20:04	history	edited	Johannes		+ tag
Jan 31, 2015 at 19:34	answer	added	arbitrary		timeline score: 3
Jan 30, 2015 at 14:42	history	edited	Johannes	CC BY-SA 3.0	+ Hint
Jan 30, 2015 at 2:01	comment	added	Johannes		@KSmarts - graph theory tells us 12 puzzle pieces is the minimum. It doesn't tell us you need on average 3.5 squares per puzzle piece. A solution with fewer than 42 squares does exist.
Jan 29, 2015 at 20:14	comment	added	KSmarts		I think the 42 square solution might be optimal. It is based on the icosahedron graph, which is the smallest 5-regular planar graph. So if we abstract the problem to a graph, that is the optimal solution. I can't see any way of rearranging that answer to make it any smaller.
Jan 29, 2015 at 19:20	history	edited	Johannes	CC BY-SA 3.0	added 40 characters in body
Jan 29, 2015 at 15:27	history	edited	Johannes	CC BY-SA 3.0	added 34 characters in body
Jan 29, 2015 at 15:19	history	edited	Johannes	CC BY-SA 3.0	added 21 characters in body
Jan 29, 2015 at 14:40	history	edited	Johannes	CC BY-SA 3.0	Consistent terminology
Jan 29, 2015 at 12:37	history	asked	Johannes	CC BY-SA 3.0