n=25: 285 reachable points with |B|<=24, 64 direction classes
distinct patterns: class | (preclosed length / shortest , reduced factor) ... | unreduced factor tuples -> number of direction classes
  class -    | 1.00000:x1  1.98423:x1  2.93717:x1  3.84378:x1  4.68978:x1  5.46182:x1  6.14772:x1  6.73666:x1  7.21937:x1  7.58822:x1  7.83740:x1  7.96299:x1 | {(1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1): 4} | n among reduced factors: False
  class -    | 1.00000:x5  1.98423:x5  2.93717:x5  3.84378:x5  4.68978:x1  5.46182:x5  6.14772:x5  6.73666:x5  7.21937:x5  7.58822:x1  7.83740:x5  7.96299:x5 | {(25, 25, 25, 25, 5, 25, 25, 25, 25, 5, 25, 25): 54, (5, 5, 5, 5, 1, 5, 5, 5, 5, 1, 5, 5): 6} | n among reduced factors: False
longest closed trajectory met: 1350 bounces
direction classes with a reduced factor equal to n: 0 of 64
Theorem 7(b) on these direction classes: classes 64 ; with exactly m=12 bands of distinct preclosed length: 64 ; preclosed lengths proportional to sin(2j pi/n): 64 ; factors = n/gcd(n, alpha*j) for some alpha: 64 ; gcd(alpha, n) -> number of classes: {1: 54, 5: 6, 25: 4}
exact decisions: 329496, time 21.1s
