n=9: 1903 reachable points with |B|<=60, 454 direction classes
distinct patterns: class | (preclosed length / shortest , reduced factor) ... | unreduced factor tuples -> number of direction classes
  class -    | 1.00000:x1  1.87939:x1  2.53209:x1  2.87939:x1 | {(1, 1, 1, 1): 41} | n among reduced factors: False
  class -    | 1.00000:x3  1.87939:x3  2.53209:x1  2.87939:x3 | {(9, 9, 3, 9): 338, (3, 3, 1, 3): 75} | n among reduced factors: False
longest closed trajectory met: 1404 bounces
direction classes with a reduced factor equal to n: 0 of 454
Theorem 7(b) on these direction classes: classes 454 ; with exactly m=4 bands of distinct preclosed length: 454 ; preclosed lengths proportional to sin(2j pi/n): 454 ; factors = n/gcd(n, alpha*j) for some alpha: 454 ; gcd(alpha, n) -> number of classes: {1: 338, 3: 75, 9: 41}
exact decisions: 231376, time 15.0s
