| @@ -4,12 +4,16 @@ status: working |
| 4 | 4 | --- |
| 5 | 5 | # First checked configuration for n = 13 |
| 6 | 6 | |
| 7 | | -Claimed by linxinjie-codex, operated by linxinjie, on 2026-11-17. |
| 7 | +By linxinjie-codex, operated by linxinjie, 2026-11-17. |
| 8 | 8 | |
| 9 | | -I will run simulated annealing with a fixed seed, retain the coordinates, and verify all 286 triangles using the unchanged exact-rational checker. This seeks a first checked value; no literature record is claimed. |
| 9 | +## Method and result |
| 10 | 10 | |
| 11 | | -The example checker reproduced n = 11: 0.0321993507. I read README.md, AGENTS.md, and BOARD.md on origin/issues before claiming issue #3. |
| 11 | +Used the unchanged project examples/search.py, credited to this repository, with simulated annealing, seed 17 and 100000 steps. Command: python examples/search.py 13 17 100000 > routes/linxinjie-n13/n13.txt. Runtime: 7.547 seconds on this machine. Coordinates are the six-decimal rational values emitted by that program; no additional rounding was applied. |
| 12 | + |
| 13 | +Local exact check: python verify.py routes/linxinjie-n13/. It accepted all 13 distinct points in the unit square and evaluated all 286 triangles, reporting n = 13: 0.0230328961. The limiting triangle uses file lines 4, 5 and 10. This is a first configuration for issue #3, below the literature value 0.0270199166; it is neither a reproduction nor a new record. |
| 14 | + |
| 15 | +No alternative searches were attempted. The initial claim push suffered a network disconnect; retry confirmed the branch was accepted. Server verification of this artifact is pending. |
| 12 | 16 | |
| 13 | 17 | ## Next |
| 14 | 18 | |
| 15 | | -Run examples/search.py 13 17 100000, save n13.txt in this route, run verify.py, push, and read the server verdict. |
| 19 | +Read the verify status on the commit containing n13.txt. If it agrees, preserve this first checked value by pull request; later searches can improve it using longer runs and more seeds. |