serenity_test

serenity_test, an Octave code which calls serenity(), which considers the serenity puzzle, a smaller version of the eternity puzzle. The serenity puzzle specifies a dodecagonal region R composed of 288 30-60-90 triangles, and a set of 8 "tiles", each consisting of 36 30-60-90 triangles, and seeks an arrangement of the tiles that exactly covers the region.

Licensing:

The information on this web page is distributed under the MIT license.

Related Data and Programs:

serenity, an Octave code which considers the serenity puzzle, a smaller version of the eternity puzzle. The serenity puzzle specifies a dodecagonal region R composed of 288 30-60-90 triangles, and a set of 8 "tiles", each consisting of 36 30-60-90 triangles, and seeks an arrangement of the tiles that exactly covers the region.

Source Code:

• serenity_test.m, calls all the tests;
• serenity_test.sh, runs all the tests;
• serenity_test.txt, the output file.

• serenity.lp, defines the problem, created by serenity_lp().
• serenity.sol, the solution information.
• serenity_solution.png, a plot of the tiling.
• serenity.txt, a printed version of the binary solution as extracted from the cplex() solution file.