n=10: 1907 reachable points with |B|<=60, 568 direction classes
distinct patterns: class | (preclosed length / shortest , reduced factor) ... | unreduced factor tuples -> number of direction classes
  class even | 1.00000:x1  2.61803:x1  3.23607:x1 | {(1, 1, 1): 17} | n among reduced factors: False
  class even | 1.00000:x5  2.61803:x5  3.23607:x1 | {(5, 5, 1): 106} | n among reduced factors: False
  class odd  | 1.00000:x1  1.61803:x1 | {(5, 5): 373, (1, 1): 72} | n among reduced factors: False
longest closed trajectory met: 740 bounces
direction classes with a reduced factor equal to n: 0 of 568
Theorem 7(a) on these direction classes: every (unreduced) factor divides n/2: True (1259 bands)
exact decisions: 120954, time 8.1s
