n=11: 851 reachable points with |B|<=40, 196 direction classes
distinct patterns: class | (preclosed length / shortest , reduced factor) ... | unreduced factor tuples -> number of direction classes
  class -    | 1.00000:x1  1.91899:x1  2.68251:x1  3.22871:x1  3.51334:x1 | {(11, 11, 11, 11, 11): 180, (1, 1, 1, 1, 1): 16} | n among reduced factors: False
longest closed trajectory met: 1166 bounces
direction classes with a reduced factor equal to n: 0 of 196
Theorem 7(b) on these direction classes: classes 196 ; with exactly m=5 bands of distinct preclosed length: 196 ; preclosed lengths proportional to sin(2j pi/n): 196 ; factors = n/gcd(n, alpha*j) for some alpha: 196 ; gcd(alpha, n) -> number of classes: {1: 180, 11: 16}
exact decisions: 221410, time 11.9s
