I used matlab global optimization toolbox’s genetic algorithm to solve the triangle packing problem outlined in previous post. It does what it is supposed to do :). i.e finds a tiling.
Left output of the GA algorithm. Optimal packing of two congruent triangles (red) and unit cell (blue). On the right are surrounding unit cells added.
Same but with 3 triangles in a unit cell. Doesn’t work so well. Takes 194 sec to compute. Density is 0.7178.
4 triangles. Took 138.315 sec to compute. Density is 0.6715;
5 triangles took 829.64 sec to compute. Density is 0.8055.
6 triangles took 228.458 sec to compute. Density is 0.7534.
