n=11 R=30.0: 467 reachable points, 2367 nodes, max #reflections 31, exact fallbacks 654, mp calls 0, 0.2s
   types: A0:215 A1:58 A2:30 A3:20 A4:18 A5:18 A6:20 A7:30 A8:58
   alpha in [0,omega], beta in [2pi/n,pi] violated: 0
   Def 2.1 rows as printed (with parity rule) give exactly the exact-formula type: failures 0
   points where a row of the 'wrong' sign also holds: 10; of these with a DIFFERENT type from that row: 8
      these ambiguous points have N in [1] (N=1: the diagonals X_0X_{k+1}, 1<=k<=n-3: expected 8)
   X_0X_(k+1) has type A_k for 0<=k<=n-2: True
   remark 'A_0 <=> beta-alpha=2pi/n' fails for 0 non-diagonal points (for the 8 proper diagonals the remark is not literally true)
