# anneal.c: local search (simulated annealing on R, objective = closure size); TESTED evidence only
# format: anneal n k iters restarts seed; target edges 11+k
$ anneal 12 10 30000 20 101   (11+k = floor((7n+2)/4) = 21)
n=12 k=10 restarts=20 found=20
$ anneal 12 9 60000 40 202   (one edge fewer)
n=12 k=9 restarts=40 found=0
$ anneal 13 12 30000 20 101   (11+k = floor((7n+2)/4) = 23)
n=13 k=12 restarts=20 found=20
$ anneal 13 11 60000 40 202   (one edge fewer)
n=13 k=11 restarts=40 found=0
$ anneal 14 14 30000 20 101   (11+k = floor((7n+2)/4) = 25)
n=14 k=14 restarts=20 found=20
$ anneal 14 13 60000 40 202   (one edge fewer)
n=14 k=13 restarts=40 found=0
$ anneal 15 15 30000 20 101   (11+k = floor((7n+2)/4) = 26)
n=15 k=15 restarts=20 found=20
$ anneal 15 14 60000 40 202   (one edge fewer)
n=15 k=14 restarts=40 found=0
$ anneal 16 17 30000 20 101   (11+k = floor((7n+2)/4) = 28)
n=16 k=17 restarts=20 found=20
$ anneal 16 16 60000 40 202   (one edge fewer)
n=16 k=16 restarts=40 found=0
$ anneal 17 19 30000 20 101   (11+k = floor((7n+2)/4) = 30)
n=17 k=19 restarts=20 found=20
$ anneal 17 18 60000 40 202   (one edge fewer)
n=17 k=18 restarts=40 found=0
$ anneal 18 21 30000 20 101   (11+k = floor((7n+2)/4) = 32)
n=18 k=21 restarts=20 found=20
$ anneal 18 20 60000 40 202   (one edge fewer)
n=18 k=20 restarts=40 found=0
