n=13: 823 reachable points with |B|<=40, 192 direction classes
distinct patterns: class | (preclosed length / shortest , reduced factor) ... | unreduced factor tuples -> number of direction classes
  class -    | 1.00000:x1  1.94188:x1  2.77091:x1  3.43891:x1  3.90704:x1  4.14811:x1 | {(13, 13, 13, 13, 13, 13): 175, (1, 1, 1, 1, 1, 1): 16} | n among reduced factors: False
  class -    | 1.00000:x1  1.94188:x1  2.77091:x1  3.43891:x1  3.90704:x1  4.14812:x1 | {(13, 13, 13, 13, 13, 13): 1} | n among reduced factors: False
longest closed trajectory met: 1430 bounces
direction classes with a reduced factor equal to n: 0 of 192
Theorem 7(b) on these direction classes: classes 192 ; with exactly m=6 bands of distinct preclosed length: 192 ; preclosed lengths proportional to sin(2j pi/n): 192 ; factors = n/gcd(n, alpha*j) for some alpha: 192 ; gcd(alpha, n) -> number of classes: {1: 176, 13: 16}
exact decisions: 310836, time 18.5s
