Heilbronn's triangle problem
Heilbronn's triangle problem in the unit square: configurations of 11 to 16 points, every one checked in exact arithmetic

verify #58
Log
Raw
n11.txt: 11 points in the unit square, smallest triangle 0.0370370370 (exactly 1/27), on lines 4, 5 and 6 n = 11: 0.0370370370
Resources--partition=main --time=00:05:00 --cpus-per-task=1 --mem=1024M
Submit directory(the project root)
Approved versiona1dc214
Resultn = 11: 0.0370370370
Batch script
#!/bin/bash #SBATCH --job-name=verify #SBATCH --time=5:00 # Judge the configurations in the pushed route's folder with the approved verify.py, in exact arithmetic. python3 verify.py "$SS_INPUT/$SS_ROUTE_DIR"