n=33: 192 reachable points with |B|<=20, 45 direction classes
distinct patterns: class | (preclosed length / shortest , reduced factor) ... | unreduced factor tuples -> number of direction classes
  class -    | 1.00000:x3  1.99094:x3  2.96386:x1  3.90993:x3  4.82059:x3  5.68760:x1  6.50310:x3  7.25971:x3  7.95057:x1  8.56943:x3  9.11068:x3  9.56943:x1  9.94151:x3  10.22356:x3  10.41303:x1  10.50819:x3 | {(3, 3, 1, 3, 3, 1, 3, 3, 1, 3, 3, 1, 3, 3, 1, 3): 5} | n among reduced factors: False
  class -    | 1.00000:x11  1.99094:x11  2.96386:x11  3.90993:x11  4.82059:x11  5.68760:x11  6.50310:x11  7.25971:x11  7.95057:x11  8.56943:x11  9.11068:x1  9.56943:x11  9.94151:x11  10.22356:x11  10.41303:x11  10.50819:x11 | {(11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 11, 11, 11, 11, 11): 9} | n among reduced factors: False
  class -    | 1.00000:x33  1.99094:x33  2.96386:x11  3.90993:x33  4.82059:x33  5.68760:x11  6.50310:x33  7.25971:x33  7.95057:x11  8.56943:x33  9.11068:x3  9.56943:x11  9.94151:x33  10.22356:x33  10.41303:x11  10.50819:x33 | {(33, 33, 11, 33, 33, 11, 33, 33, 11, 33, 3, 11, 33, 33, 11, 33): 31} | n among reduced factors: True
longest closed trajectory met: 1650 bounces
direction classes with a reduced factor equal to n: 31 of 45
Theorem 7(b) on these direction classes: classes 45 ; with exactly m=16 bands of distinct preclosed length: 45 ; preclosed lengths proportional to sin(2j pi/n): 45 ; factors = n/gcd(n, alpha*j) for some alpha: 45 ; gcd(alpha, n) -> number of classes: {1: 31, 3: 9, 11: 5}
exact decisions: 312866, time 23.3s
