Hinge folding problem
Partially triggered by Aiden’s toys.
A interesting computation problem caught me today: what is the most stable pattern that a chain of hinges can form. The chain is formed by N individual hinges with each hinge have uniform length (1 unit), so total length is N. The two ends…