On a regular hendecagon (2 dimensions), how many non-symmetric ways can you draw a maximal set of non-intersecting diagonals?
This puzzle has been driving me crazy! I've been doing it by hand.
-The maximal set is defined as the largest number of diagonals that do not intersect, except at the endpoints
-Please also note reflects and rotations are not valid. (i.e. only counts as one)
Any ideas of how to go about problem solving would be helpful!