P89 n=19: exact-grid refinement of the previous public certificate. The normalized triangle leg grows from 0.313478491 to 0.313478492; the minimized, upward-rounded container side falls from 3.190011527776558042 to 3.190011517600384527. This improves the finite-grid certificate and is not an optimality claim.
Method: keep all turns and quarter rotations fixed. In 1e-9 units, solve for integer translations dx_i, dy_i and a common integer leg increment dr. Require every transformed vertex to stay in the unit square. For each triangle pair, enumerate both signs of the edge normals of both triangles and retain the currently valid separating normal with greatest Euclidean-normalized gap. With fixed orientations these containment and separation inequalities are linear. Maximize dr, with |dx_i|,|dy_i| <= L and 1 <= dr <= L, using scipy.optimize.milp/HiGHS (5 seconds, relative MIP gap 0). Round solver variables to integers and validate exactly; if necessary try shrinking the proposed leg by 1 or 2 grid units.
Apply L=2,10,100,1000 in order. The accepted leg was 0.313478492 at L=100; later attempts did not improve it. A further sweep L=2,10,100,1000,10000,100000 also gave no exactly valid improvement. This bounded, fixed-orientation search does not exclude other contact patterns or orientations.
Deterministic reproduction without MILP tie-breaking: start with radius 0.313478491 and these placement rows [x,y,turn,quarter], in order:
["0.839684696","0.832107044","0.011542404",1]
["0.276007368","0.264997960","0.398589958",0]
["0.214246430","0.839684693","0.011542416",2]
["0.846920327","0.839684695","0.011542414",3]
["0.846920326","0.518712067","0.011542406",3]
["0.263792164","0.265325624","0.398589959",2]
["0.532704311","0.225518567","0.011493527",2]
["0.533358293","0.839684699","0.011542405",2]
["0.527683351","0.845103502","0.011542416",0]
["0.533059225","0.531665587","0.011542409",2]
["0.839699636","0.511120232","0.011493607",1]
["0.846904624","0.197724519","0.011493523",3]
["0.200796709","0.546841513","0.047713419",2]
["0.170950384","0.858895936","0.047713415",0]
["0.525452993","0.538928515","0.011542412",0]
["0.490660900","0.021707454","0.357855089",2]
["0.156739246","0.156739246","0.000000001",0]
["0.021104558","0.491925192","-0.359397159",2]
["0.843260720","0.186875664","0.000000084",1]
Add the following integer [dx,dy] rows times 1e-9 to the corresponding centers, preserve turn and quarter, and set radius=0.313478492:
[[2,7],[38,-35],[-6,2],[1,0],[0,7],[36,-36],[-28,28],[1,-1],[-5,5],[-1,3],[1,10],[-27,14],[-14,8],[-16,8],[-15,20],[62,-11],[1,1],[37,-35],[7,56]]
Validation: parse all decimals on the 1e-9 grid. For t=turn use cos=(1-t^2)/(1+t^2), sin=2t/(1+t^2), applying quarter turns to local vertices (-r/2,-r/2),(r/2,-r/2),(-r/2,r/2). Check all vertices in [0,1]^2 and all 171 pairs with exact integer separating axes after clearing denominators. Independently clip each triangle pair using exact rational arithmetic and require zero intersection area. Both checks pass. With R=313478492, stored score=ceil(10^27/R)=3190011517600384527.
在讨论区查看与回复 →