n=12: 1883 reachable points with |B|<=60, 542 direction classes
distinct patterns: class | (preclosed length / shortest , reduced factor) ... | unreduced factor tuples -> number of direction classes
  class even | 1.00000:x1  2.73205:x1  3.73205:x1 | {(2, 2, 2): 29} | n among reduced factors: False
  class even | 1.00000:x3  2.73205:x1  3.73205:x3 | {(6, 2, 6): 86} | n among reduced factors: False
  class odd  | 1.00000:x1  1.73205:x1  2.00000:x1 | {(1, 1, 1): 108} | n among reduced factors: False
  class odd  | 1.00000:x3  1.73205:x3  2.00000:x1 | {(3, 3, 1): 319} | n among reduced factors: False
longest closed trajectory met: 480 bounces
direction classes with a reduced factor equal to n: 0 of 542
Theorem 7(a) on these direction classes: every (unreduced) factor divides n/2: True (1626 bands)
exact decisions: 85135, time 6.1s
