Heilbronn's triangle problem
Better configurations for Heilbronn’s triangle problem in the unit square, n = 11–14
verify #1
Resources--partition=main --time=00:05:00 --cpus-per-task=1 --mem=1024M
Submit directory(the project root)
Approved versionf722717
Resultno configurations to check
Batch script
#!/bin/bash #SBATCH --job-name=verify #SBATCH --time=5:00 # Recompute the smallest triangle of every n*.txt in the pushed route's folder, exactly. python3 verify.py "$SS_INPUT/$SS_ROUTE_DIR"
Log
no configurations to check