runMode: serial
maxCount: 10000
repeat: 1
LOCheck: 0
dataset: codeTables
datafile: QECC_sample.txt
method: dist_m4ri_RW
ignoreTrivialCodes: 1
resume: 0
nMin: 1
nMax: 100000
iterCount: 10000
maxTime: 28800
nThreads: 1
verbose: False
maxErr: -1
GF4blockRep: 2
regroupPerm: 1
filterCircuit: 1
HL: 0
genCount: 100
offspring: 10
pMut: 2.0
sMut: 0.2
tabuLength: 0
swapPivot: 1
swapBlockorder: 0
pMutScale: 50
CCstart: -1
pySATsolver: g4
pySATbinary: lsu
addStabs: 0
permuteDEM: 1
outfile: /Users/markwebster/Dropbox/QuantumComputing/dev/codeDistance-main/examples/results/codeTables-QECC_sample.txt-dist_m4ri_RW-20260303_211534.542039_85062422.txt
#########################################
name	n	k	d	delta d	Time	R	T	Progress
[[3,1,1]]	3	1	1	0	0.48410433300887235	1	1	# step=0 row=0 minW=13 found cw of W=2: [1 4]\n# round=1000 of 10000 minW=2\n# round=2000 of 10000 minW=2\n# round=3000 of 10000 minW=2\n# round=4000 of 10000 minW=2\n# round=5000 of 10000 minW=2\n# round=6000 of 10000 minW=2\n# round=7000 of 10000 minW=2\n# round=8000 of 10000 minW=2\n# round=9000 of 10000 minW=2\n# round=10000 of 10000 minW=2\nRW algorithm upper bound for the distance d=2\n
[[4,1,2]]	4	1	2	0	0.025690499984193593	1	1	# step=0 row=0 minW=17 found cw of W=4: [1 3 5 7]\n# round=1000 of 10000 minW=4\n# round=2000 of 10000 minW=4\n# round=3000 of 10000 minW=4\n# round=4000 of 10000 minW=4\n# round=5000 of 10000 minW=4\n# round=6000 of 10000 minW=4\n# round=7000 of 10000 minW=4\n# round=8000 of 10000 minW=4\n# round=9000 of 10000 minW=4\n# round=10000 of 10000 minW=4\nRW algorithm upper bound for the distance d=4\n
[[5,1,3]]	5	1	3	0	0.057683417020598426	1	1	# step=0 row=0 minW=21 found cw of W=6: [1 3 8 11 12 17]\n# round=1000 of 10000 minW=6\n# round=2000 of 10000 minW=6\n# round=3000 of 10000 minW=6\n# round=4000 of 10000 minW=6\n# round=5000 of 10000 minW=6\n# round=6000 of 10000 minW=6\n# round=7000 of 10000 minW=6\n# round=8000 of 10000 minW=6\n# round=9000 of 10000 minW=6\n# round=10000 of 10000 minW=6\nRW algorithm upper bound for the distance d=6\n
[[6,1,3]]	6	1	3	0	0.04917683298117481	1	1	# step=0 row=0 minW=25 found cw of W=6: [1 5 8 14 19 23]\n# round=1000 of 10000 minW=6\n# round=2000 of 10000 minW=6\n# round=3000 of 10000 minW=6\n# round=4000 of 10000 minW=6\n# round=5000 of 10000 minW=6\n# round=6000 of 10000 minW=6\n# round=7000 of 10000 minW=6\n# round=8000 of 10000 minW=6\n# round=9000 of 10000 minW=6\n# round=10000 of 10000 minW=6\nRW algorithm upper bound for the distance d=6\n
[[7,1,3]]	7	1	3	0	0.04440862502087839	1	1	# step=0 row=0 minW=29 found cw of W=6: [1 3 7 8 10 14]\n# round=1000 of 10000 minW=6\n# round=2000 of 10000 minW=6\n# round=3000 of 10000 minW=6\n# round=4000 of 10000 minW=6\n# round=5000 of 10000 minW=6\n# round=6000 of 10000 minW=6\n# round=7000 of 10000 minW=6\n# round=8000 of 10000 minW=6\n# round=9000 of 10000 minW=6\n# round=10000 of 10000 minW=6\nRW algorithm upper bound for the distance d=6\n
[[8,1,3]]	8	1	3	0	0.035920957976486534	1	1	# step=0 row=0 minW=33 found cw of W=6: [1 4 9 10 20 26]\n# round=1000 of 10000 minW=6\n# round=2000 of 10000 minW=6\n# round=3000 of 10000 minW=6\n# round=4000 of 10000 minW=6\n# round=5000 of 10000 minW=6\n# round=6000 of 10000 minW=6\n# round=7000 of 10000 minW=6\n# round=8000 of 10000 minW=6\n# round=9000 of 10000 minW=6\n# round=10000 of 10000 minW=6\nRW algorithm upper bound for the distance d=6\n
[[9,1,3]]	9	1	3	0	0.04551504200208001	1	1	# step=0 row=0 minW=37 found cw of W=6: [1 5 10 14 20 29]\n# round=1000 of 10000 minW=6\n# round=2000 of 10000 minW=6\n# round=3000 of 10000 minW=6\n# round=4000 of 10000 minW=6\n# round=5000 of 10000 minW=6\n# round=6000 of 10000 minW=6\n# round=7000 of 10000 minW=6\n# round=8000 of 10000 minW=6\n# round=9000 of 10000 minW=6\n# round=10000 of 10000 minW=6\nRW algorithm upper bound for the distance d=6\n
[[10,1,4]]	10	1	4	0	0.055217750021256506	1	1	# step=0 row=0 minW=41 found cw of W=12: [1 2 4 5 7 10 14 15 17 20 21 22]\n# step=0 row=2 minW=12 found cw of W=10: [2 5 6 10 12 13 15 20 23 36]\n# step=0 row=3 minW=10 found cw of W=8: [5 7 8 15 17 18 23 33]\n# round=1000 of 10000 minW=8\n# round=2000 of 10000 minW=8\n# round=3000 of 10000 minW=8\n# round=4000 of 10000 minW=8\n# round=5000 of 10000 minW=8\n# round=6000 of 10000 minW=8\n# round=7000 of 10000 minW=8\n# round=8000 of 10000 minW=8\n# round=9000 of 10000 minW=8\n# round=10000 of 10000 minW=8\nRW algorithm upper bound for the distance d=8\n
[[11,1,5]]	11	1	5	0	0.07053079199977219	1	1	# step=0 row=3 minW=45 found cw of W=10: [4 8 14 19 20 25 29 37 40 42]\n# round=1000 of 10000 minW=10\n# round=2000 of 10000 minW=10\n# round=3000 of 10000 minW=10\n# round=4000 of 10000 minW=10\n# round=5000 of 10000 minW=10\n# round=6000 of 10000 minW=10\n# round=7000 of 10000 minW=10\n# round=8000 of 10000 minW=10\n# round=9000 of 10000 minW=10\n# round=10000 of 10000 minW=10\nRW algorithm upper bound for the distance d=10\n
[[12,6,3]]	12	6	3	0	0.04941058298572898	1	1	# step=0 row=0 minW=49 found cw of W=8: [1 8 13 14 20 26 28 40]\n# step=0 row=1 minW=8 found cw of W=6: [2 9 21 26 28 40]\n# round=1000 of 10000 minW=6\n# round=2000 of 10000 minW=6\n# round=3000 of 10000 minW=6\n# round=4000 of 10000 minW=6\n# round=5000 of 10000 minW=6\n# round=6000 of 10000 minW=6\n# round=7000 of 10000 minW=6\n# round=8000 of 10000 minW=6\n# round=9000 of 10000 minW=6\n# round=10000 of 10000 minW=6\nRW algorithm upper bound for the distance d=6\n
[[13,6,3]]	13	6	3	0	0.052990666998084635	1	1	# step=0 row=0 minW=53 found cw of W=8: [1 2 6 9 14 32 35 41]\n# step=0 row=1 minW=8 found cw of W=6: [3 9 14 27 29 35]\n# round=1000 of 10000 minW=6\n# round=2000 of 10000 minW=6\n# round=3000 of 10000 minW=6\n# round=4000 of 10000 minW=6\n# round=5000 of 10000 minW=6\n# round=6000 of 10000 minW=6\n# round=7000 of 10000 minW=6\n# round=8000 of 10000 minW=6\n# round=9000 of 10000 minW=6\n# round=10000 of 10000 minW=6\nRW algorithm upper bound for the distance d=6\n
[[14,2,5]]	14	2	5	0	0.06578533301944844	1	1	# step=0 row=0 minW=57 found cw of W=14: [1 2 3 11 13 15 23 32 44 45 46 51 53 55]\n# step=0 row=2 minW=14 found cw of W=12: [3 5 11 12 13 19 21 31 49 53 54 55]\n# step=0 row=8 minW=12 found cw of W=10: [2 3 11 12 14 42 44 45 53 54]\n# round=1000 of 10000 minW=10\n# round=2000 of 10000 minW=10\n# round=3000 of 10000 minW=10\n# round=4000 of 10000 minW=10\n# round=5000 of 10000 minW=10\n# round=6000 of 10000 minW=10\n# round=7000 of 10000 minW=10\n# round=8000 of 10000 minW=10\n# round=9000 of 10000 minW=10\n# round=10000 of 10000 minW=10\nRW algorithm upper bound for the distance d=10\n
[[15,2,5]]	15	2	5	0	0.0765829999872949	1	1	# step=0 row=0 minW=61 found cw of W=10: [1 7 12 16 27 32 43 47 52 58]\n# round=1000 of 10000 minW=10\n# round=2000 of 10000 minW=10\n# round=3000 of 10000 minW=10\n# round=4000 of 10000 minW=10\n# round=5000 of 10000 minW=10\n# round=6000 of 10000 minW=10\n# round=7000 of 10000 minW=10\n# round=8000 of 10000 minW=10\n# round=9000 of 10000 minW=10\n# round=10000 of 10000 minW=10\nRW algorithm upper bound for the distance d=10\n
[[16,1,6]]	16	1	6	0	0.08099045799463056	1	1	# step=0 row=0 minW=65 found cw of W=18: [1 2 8 14 17 18 21 23 27 43 44 48 53 55 56 60 62 64]\n# step=0 row=3 minW=18 found cw of W=12: [7 8 14 21 23 41 44 53 56 57 60 62]\n# round=1000 of 10000 minW=12\n# round=2000 of 10000 minW=12\n# round=3000 of 10000 minW=12\n# round=4000 of 10000 minW=12\n# round=5000 of 10000 minW=12\n# round=6000 of 10000 minW=12\n# round=7000 of 10000 minW=12\n# round=8000 of 10000 minW=12\n# round=9000 of 10000 minW=12\n# round=10000 of 10000 minW=12\nRW algorithm upper bound for the distance d=12\n
[[17,3,5]]	17	3	5	0	0.07729437501984648	1	1	# step=0 row=0 minW=69 found cw of W=10: [1 6 9 21 38 40 48 52 60 65]\n# round=1000 of 10000 minW=10\n# round=2000 of 10000 minW=10\n# round=3000 of 10000 minW=10\n# round=4000 of 10000 minW=10\n# round=5000 of 10000 minW=10\n# round=6000 of 10000 minW=10\n# round=7000 of 10000 minW=10\n# round=8000 of 10000 minW=10\n# round=9000 of 10000 minW=10\n# round=10000 of 10000 minW=10\nRW algorithm upper bound for the distance d=10\n
[[18,5,5]]	18	5	5	0	0.0874036249879282	1	1	# step=0 row=0 minW=73 found cw of W=16: [1 5 6 14 16 19 21 23 34 36 39 42 51 54 68 69]\n# step=0 row=1 minW=16 found cw of W=14: [2 5 14 21 23 36 40 42 54 56 57 58 60 68]\n# step=0 row=4 minW=14 found cw of W=10: [6 7 16 22 25 29 34 40 60 65]\n# round=1000 of 10000 minW=10\n# round=2000 of 10000 minW=10\n# round=3000 of 10000 minW=10\n# round=4000 of 10000 minW=10\n# round=5000 of 10000 minW=10\n# round=6000 of 10000 minW=10\n# round=7000 of 10000 minW=10\n# round=8000 of 10000 minW=10\n# round=9000 of 10000 minW=10\n# round=10000 of 10000 minW=10\nRW algorithm upper bound for the distance d=10\n
[[19,5,5]]	19	5	5	0	0.09594733398989774	1	1	# step=0 row=0 minW=77 found cw of W=10: [1 7 15 20 26 28 29 53 66 67]\n# round=1000 of 10000 minW=10\n# round=2000 of 10000 minW=10\n# round=3000 of 10000 minW=10\n# round=4000 of 10000 minW=10\n# round=5000 of 10000 minW=10\n# round=6000 of 10000 minW=10\n# round=7000 of 10000 minW=10\n# round=8000 of 10000 minW=10\n# round=9000 of 10000 minW=10\n# round=10000 of 10000 minW=10\nRW algorithm upper bound for the distance d=10\n
[[20,3,6]]	20	3	6	0	0.16622604100848548	1	1	# step=0 row=0 minW=81 found cw of W=20: [1 3 5 9 15 18 30 37 43 53 55 56 58 61 65 69 70 73 76 77]\n# step=0 row=2 minW=20 found cw of W=18: [3 5 6 8 16 21 26 28 30 43 53 60 61 65 70 73 76 80]\n# step=0 row=3 minW=18 found cw of W=14: [3 7 15 18 30 37 43 55 57 58 60 67 70 80]\n# step=0 row=13 minW=14 found cw of W=12: [5 13 15 16 18 25 49 53 55 56 58 69]\n# round=1000 of 10000 minW=12\n# round=2000 of 10000 minW=12\n# round=3000 of 10000 minW=12\n# round=4000 of 10000 minW=12\n# round=5000 of 10000 minW=12\n# round=6000 of 10000 minW=12\n# round=7000 of 10000 minW=12\n# round=8000 of 10000 minW=12\n# round=9000 of 10000 minW=12\n# round=10000 of 10000 minW=12\nRW algorithm upper bound for the distance d=12\n
[[21,3,6]]	21	3	6	0	0.11200579200522043	1	1	# step=0 row=1 minW=85 found cw of W=12: [2 7 14 17 22 23 24 28 64 66 77 80]\n# round=1000 of 10000 minW=12\n# round=2000 of 10000 minW=12\n# round=3000 of 10000 minW=12\n# round=4000 of 10000 minW=12\n# round=5000 of 10000 minW=12\n# round=6000 of 10000 minW=12\n# round=7000 of 10000 minW=12\n# round=8000 of 10000 minW=12\n# round=9000 of 10000 minW=12\n# round=10000 of 10000 minW=12\nRW algorithm upper bound for the distance d=12\n
[[22,7,5]]	22	7	5	0	0.11793012500857003	1	1	# step=0 row=0 minW=89 found cw of W=20: [1 2 3 6 13 15 20 28 33 35 49 55 61 64 67 68 69 71 81 83]\n# step=0 row=1 minW=20 found cw of W=14: [2 4 12 15 19 20 26 34 41 46 47 64 69 81]\n# step=0 row=2 minW=14 found cw of W=12: [5 15 19 20 33 41 47 55 64 69 71 81]\n# step=0 row=3 minW=12 found cw of W=10: [2 7 13 15 33 35 46 55 59 73]\n# round=1000 of 10000 minW=10\n# round=2000 of 10000 minW=10\n# round=3000 of 10000 minW=10\n# round=4000 of 10000 minW=10\n# round=5000 of 10000 minW=10\n# round=6000 of 10000 minW=10\n# round=7000 of 10000 minW=10\n# round=8000 of 10000 minW=10\n# round=9000 of 10000 minW=10\n# round=10000 of 10000 minW=10\nRW algorithm upper bound for the distance d=10\n
[[23,2,7]]	23	2	7	0	0.13059695798438042	1	1	# step=0 row=0 minW=93 found cw of W=16: [1 6 11 29 31 33 50 54 56 57 63 69 70 73 86 92]\n# step=0 row=6 minW=16 found cw of W=14: [4 5 6 13 31 51 52 57 63 73 77 80 82 86]\n# round=1000 of 10000 minW=14\n# round=2000 of 10000 minW=14\n# round=3000 of 10000 minW=14\n# round=4000 of 10000 minW=14\n# round=5000 of 10000 minW=14\n# round=6000 of 10000 minW=14\n# round=7000 of 10000 minW=14\n# round=8000 of 10000 minW=14\n# round=9000 of 10000 minW=14\n# round=10000 of 10000 minW=14\nRW algorithm upper bound for the distance d=14\n
[[24,8,5]]	24	8	5	0	0.11608970901579596	1	1	# step=0 row=0 minW=97 found cw of W=14: [1 8 10 11 22 32 37 58 61 66 73 83 90 94]\n# step=0 row=2 minW=14 found cw of W=12: [3 8 14 31 32 37 38 51 55 59 61 83]\n# step=0 row=10 minW=12 found cw of W=10: [15 22 31 39 40 55 59 83 88 94]\n# round=1000 of 10000 minW=10\n# round=2000 of 10000 minW=10\n# round=3000 of 10000 minW=10\n# round=4000 of 10000 minW=10\n# round=5000 of 10000 minW=10\n# round=6000 of 10000 minW=10\n# round=7000 of 10000 minW=10\n# round=8000 of 10000 minW=10\n# round=9000 of 10000 minW=10\n# round=10000 of 10000 minW=10\nRW algorithm upper bound for the distance d=10\n
[[25,8,5]]	25	8	5	0	0.12224783297278918	1	1	# step=0 row=0 minW=101 found cw of W=14: [1 2 8 16 18 20 27 32 43 51 57 70 83 91]\n# step=0 row=8 minW=14 found cw of W=12: [9 12 20 35 38 43 59 63 70 85 87 93]\n# step=1 row=29 minW=12 found cw of W=10: [9 10 13 24 26 34 38 51 60 99]\n# round=1000 of 10000 minW=10\n# round=2000 of 10000 minW=10\n# round=3000 of 10000 minW=10\n# round=4000 of 10000 minW=10\n# round=5000 of 10000 minW=10\n# round=6000 of 10000 minW=10\n# round=7000 of 10000 minW=10\n# round=8000 of 10000 minW=10\n# round=9000 of 10000 minW=10\n# round=10000 of 10000 minW=10\nRW algorithm upper bound for the distance d=10\n
[[26,6,6]]	26	6	6	0	0.1433737920015119	1	1	# step=0 row=1 minW=105 found cw of W=16: [2 4 5 20 21 28 31 34 46 49 65 73 75 82 86 91]\n# step=0 row=3 minW=16 found cw of W=12: [4 7 17 23 33 49 53 56 65 79 91 95]\n# round=1000 of 10000 minW=12\n# round=2000 of 10000 minW=12\n# round=3000 of 10000 minW=12\n# round=4000 of 10000 minW=12\n# round=5000 of 10000 minW=12\n# round=6000 of 10000 minW=12\n# round=7000 of 10000 minW=12\n# round=8000 of 10000 minW=12\n# round=9000 of 10000 minW=12\n# round=10000 of 10000 minW=12\nRW algorithm upper bound for the distance d=12\n
[[27,6,6]]	27	6	6	0	0.14436429101624526	1	1	# step=0 row=1 minW=109 found cw of W=14: [2 4 10 29 31 34 41 64 74 75 88 95 101 102]\n# step=2 row=46 minW=14 found cw of W=12: [8 22 23 42 49 55 62 77 78 82 96 105]\n# round=1000 of 10000 minW=12\n# round=2000 of 10000 minW=12\n# round=3000 of 10000 minW=12\n# round=4000 of 10000 minW=12\n# round=5000 of 10000 minW=12\n# round=6000 of 10000 minW=12\n# round=7000 of 10000 minW=12\n# round=8000 of 10000 minW=12\n# round=9000 of 10000 minW=12\n# round=10000 of 10000 minW=12\nRW algorithm upper bound for the distance d=12\n
[[28,6,6]]	28	6	6	0	0.16178550000768155	1	1	# step=0 row=0 minW=113 found cw of W=18: [1 3 16 17 18 24 34 48 57 70 72 80 87 90 98 101 102 104]\n# step=0 row=1 minW=18 found cw of W=16: [4 7 9 34 40 49 63 70 77 78 88 90 93 96 98 106]\n# step=0 row=6 minW=16 found cw of W=14: [3 7 12 16 18 22 40 49 63 72 77 78 87 102]\n# step=1 row=49 minW=14 found cw of W=12: [1 3 13 37 47 57 75 78 87 93 97 106]\n# round=1000 of 10000 minW=12\n# round=2000 of 10000 minW=12\n# round=3000 of 10000 minW=12\n# round=4000 of 10000 minW=12\n# round=5000 of 10000 minW=12\n# round=6000 of 10000 minW=12\n# round=7000 of 10000 minW=12\n# round=8000 of 10000 minW=12\n# round=9000 of 10000 minW=12\n# round=10000 of 10000 minW=12\nRW algorithm upper bound for the distance d=12\n
[[29,6,7]]	29	6	7	0	0.1683529999863822	1	1	# step=0 row=0 minW=117 found cw of W=26: [1 18 19 21 22 23 34 36 44 51 56 57 59 61 63 68 77 81 86 90 94 97 102 105 108 114]\n# step=0 row=1 minW=26 found cw of W=24: [2 15 17 19 22 23 28 34 41 46 50 51 56 57 61 70 77 81 89 90 92 102 108 114]\n# step=0 row=2 minW=24 found cw of W=18: [3 12 15 17 41 46 50 52 56 57 63 81 86 90 92 102 108 114]\n# step=0 row=14 minW=18 found cw of W=16: [12 22 23 27 28 36 41 50 51 52 56 63 65 86 92 108]\n# step=1 row=39 minW=16 found cw of W=14: [4 10 16 24 25 26 39 49 78 82 84 91 103 112]\n# round=1000 of 10000 minW=14\n# round=2000 of 10000 minW=14\n# round=3000 of 10000 minW=14\n# round=4000 of 10000 minW=14\n# round=5000 of 10000 minW=14\n# round=6000 of 10000 minW=14\n# round=7000 of 10000 minW=14\n# round=8000 of 10000 minW=14\n# round=9000 of 10000 minW=14\n# round=10000 of 10000 minW=14\nRW algorithm upper bound for the distance d=14\n
[[30,9,6]]	30	9	6	0	0.16616562500712462	1	1	# step=0 row=0 minW=121 found cw of W=18: [1 7 21 34 41 42 45 49 51 60 64 67 75 79 90 91 101 102]\n# step=0 row=6 minW=18 found cw of W=12: [7 10 11 28 41 60 84 90 97 100 114 118]\n# round=1000 of 10000 minW=12\n# round=2000 of 10000 minW=12\n# round=3000 of 10000 minW=12\n# round=4000 of 10000 minW=12\n# round=5000 of 10000 minW=12\n# round=6000 of 10000 minW=12\n# round=7000 of 10000 minW=12\n# round=8000 of 10000 minW=12\n# round=9000 of 10000 minW=12\n# round=10000 of 10000 minW=12\nRW algorithm upper bound for the distance d=12\n
[[31,9,6]]	31	9	6	0	0.17543479200685397	1	1	# step=0 row=0 minW=125 found cw of W=22: [1 5 6 13 19 27 32 33 39 41 47 53 67 68 70 72 81 84 95 106 109 120]\n# step=0 row=1 minW=22 found cw of W=18: [2 4 20 44 47 51 53 58 68 72 84 95 97 99 103 106 109 120]\n# step=0 row=3 minW=18 found cw of W=16: [3 6 8 19 27 33 39 44 53 58 65 68 81 95 106 115]\n# step=0 row=9 minW=16 found cw of W=14: [2 3 19 21 33 53 58 66 81 83 84 96 97 120]\n# step=0 row=31 minW=14 found cw of W=12: [2 3 13 33 44 47 60 65 84 91 109 115]\n# round=1000 of 10000 minW=12\n# round=2000 of 10000 minW=12\n# round=3000 of 10000 minW=12\n# round=4000 of 10000 minW=12\n# round=5000 of 10000 minW=12\n# round=6000 of 10000 minW=12\n# round=7000 of 10000 minW=12\n# round=8000 of 10000 minW=12\n# round=9000 of 10000 minW=12\n# round=10000 of 10000 minW=12\nRW algorithm upper bound for the distance d=12\n
[[32,5,8]]	32	5	8	0	0.18935266698827036	1	1	# step=0 row=1 minW=129 found cw of W=18: [2 5 6 7 34 35 37 38 39 47 55 56 85 88 99 111 117 119]\n# step=0 row=41 minW=18 found cw of W=16: [7 8 11 37 38 54 67 72 74 75 99 101 102 103 106 118]\n# round=1000 of 10000 minW=16\n# round=2000 of 10000 minW=16\n# round=3000 of 10000 minW=16\n# round=4000 of 10000 minW=16\n# round=5000 of 10000 minW=16\n# round=6000 of 10000 minW=16\n# round=7000 of 10000 minW=16\n# round=8000 of 10000 minW=16\n# round=9000 of 10000 minW=16\n# round=10000 of 10000 minW=16\nRW algorithm upper bound for the distance d=16\n
[[33,7,8]]	33	7	8	0	0.20632829100941308	1	1	# step=0 row=0 minW=133 found cw of W=16: [1 10 11 21 32 34 43 44 47 63 86 87 96 113 119 131]\n# round=1000 of 10000 minW=16\n# round=2000 of 10000 minW=16\n# round=3000 of 10000 minW=16\n# round=4000 of 10000 minW=16\n# round=5000 of 10000 minW=16\n# round=6000 of 10000 minW=16\n# round=7000 of 10000 minW=16\n# round=8000 of 10000 minW=16\n# round=9000 of 10000 minW=16\n# round=10000 of 10000 minW=16\nRW algorithm upper bound for the distance d=16\n
[[34,17,5]]	34	17	5	0	0.15736670899786986	1	1	# step=0 row=0 minW=137 found cw of W=20: [1 9 16 24 36 43 45 55 58 61 69 80 82 84 89 95 104 113 114 116]\n# step=0 row=6 minW=20 found cw of W=16: [11 15 20 33 34 45 55 60 68 70 83 88 89 94 104 135]\n# step=0 row=13 minW=16 found cw of W=14: [15 21 33 34 36 45 61 68 70 83 89 95 113 135]\n# step=0 row=16 minW=14 found cw of W=12: [9 16 26 34 36 43 68 70 80 84 94 114]\n# step=1 row=5 minW=12 found cw of W=10: [4 11 23 30 51 72 98 113 119 125]\n# round=1000 of 10000 minW=10\n# round=2000 of 10000 minW=10\n# round=3000 of 10000 minW=10\n# round=4000 of 10000 minW=10\n# round=5000 of 10000 minW=10\n# round=6000 of 10000 minW=10\n# round=7000 of 10000 minW=10\n# round=8000 of 10000 minW=10\n# round=9000 of 10000 minW=10\n# round=10000 of 10000 minW=10\nRW algorithm upper bound for the distance d=10\n
[[35,4,9]]	35	4	9	0	0.24624920799396932	1	1	# step=0 row=0 minW=141 found cw of W=26: [1 4 12 14 16 20 33 40 46 47 49 54 55 57 67 68 74 75 92 96 102 106 116 121 124 131]\n# step=0 row=8 minW=26 found cw of W=24: [3 4 14 15 16 20 23 24 33 38 40 46 49 51 55 59 75 93 96 103 109 116 120 131]\n# step=0 row=14 minW=24 found cw of W=20: [2 20 26 33 38 46 48 54 55 72 80 87 96 103 108 115 116 118 122 124]\n# step=0 row=16 minW=20 found cw of W=18: [20 25 28 31 33 38 45 55 60 67 74 98 101 102 103 108 109 115]\n# round=1000 of 10000 minW=18\n# round=2000 of 10000 minW=18\n# round=3000 of 10000 minW=18\n# round=4000 of 10000 minW=18\n# round=5000 of 10000 minW=18\n# round=6000 of 10000 minW=18\n# round=7000 of 10000 minW=18\n# round=8000 of 10000 minW=18\n# round=9000 of 10000 minW=18\n# round=10000 of 10000 minW=18\nRW algorithm upper bound for the distance d=18\n
[[36,4,9]]	36	4	9	0	0.24527958300313912	1	1	# step=0 row=0 minW=145 found cw of W=30: [1 4 5 15 17 28 31 41 42 45 53 54 58 63 65 66 71 78 87 90 94 103 107 109 112 117 135 136 137 138]\n# step=0 row=1 minW=30 found cw of W=20: [2 4 5 12 24 28 35 41 42 58 60 66 71 76 84 110 114 130 136 138]\n# step=2 row=49 minW=20 found cw of W=18: [17 19 22 25 30 46 50 55 64 67 82 94 97 100 103 122 125 138]\n# round=1000 of 10000 minW=18\n# round=2000 of 10000 minW=18\n# round=3000 of 10000 minW=18\n# round=4000 of 10000 minW=18\n# round=5000 of 10000 minW=18\n# round=6000 of 10000 minW=18\n# round=7000 of 10000 minW=18\n# round=8000 of 10000 minW=18\n# round=9000 of 10000 minW=18\n# round=10000 of 10000 minW=18\nRW algorithm upper bound for the distance d=18\n
[[37,4,9]]	37	4	9	0	0.25302387500414625	1	1	# step=0 row=0 minW=149 found cw of W=28: [1 3 11 17 18 26 28 30 33 63 71 75 76 77 86 87 106 107 113 122 123 124 128 129 139 141 143 145]\n# step=0 row=1 minW=28 found cw of W=22: [2 17 18 19 33 42 71 76 77 87 91 93 102 106 107 114 116 124 129 139 143 145]\n# step=0 row=9 minW=22 found cw of W=20: [6 15 17 18 21 26 28 33 63 86 91 93 102 107 117 123 126 129 130 132]\n# step=1 row=41 minW=20 found cw of W=18: [2 4 7 31 50 62 71 76 81 87 92 94 99 105 108 115 129 131]\n# round=1000 of 10000 minW=18\n# round=2000 of 10000 minW=18\n# round=3000 of 10000 minW=18\n# round=4000 of 10000 minW=18\n# round=5000 of 10000 minW=18\n# round=6000 of 10000 minW=18\n# round=7000 of 10000 minW=18\n# round=8000 of 10000 minW=18\n# round=9000 of 10000 minW=18\n# round=10000 of 10000 minW=18\nRW algorithm upper bound for the distance d=18\n
[[38,4,9]]	38	4	9	0	0.2692577919806354	1	1	# step=0 row=0 minW=153 found cw of W=26: [1 6 9 15 23 24 33 39 44 50 53 58 69 79 85 86 88 96 100 109 110 117 124 137 145 148]\n# step=0 row=13 minW=26 found cw of W=20: [6 7 9 12 20 22 23 24 31 33 82 85 88 96 98 100 109 121 137 145]\n# step=1 row=47 minW=20 found cw of W=18: [2 4 14 28 30 32 52 89 94 95 108 116 118 127 132 133 142 144]\n# round=1000 of 10000 minW=18\n# round=2000 of 10000 minW=18\n# round=3000 of 10000 minW=18\n# round=4000 of 10000 minW=18\n# round=5000 of 10000 minW=18\n# round=6000 of 10000 minW=18\n# round=7000 of 10000 minW=18\n# round=8000 of 10000 minW=18\n# round=9000 of 10000 minW=18\n# round=10000 of 10000 minW=18\nRW algorithm upper bound for the distance d=18\n
[[39,4,9]]	39	4	9	0	0.2754910000076052	1	1	# step=0 row=0 minW=157 found cw of W=38: [1 3 4 14 16 17 18 21 24 28 30 39 40 42 51 52 53 54 62 63 65 72 78 99 100 104 106 108 121 129 130 132 133 134 135 139 140 150]\n# step=0 row=1 minW=38 found cw of W=32: [4 5 16 18 21 26 28 30 42 46 51 52 53 54 55 56 59 81 82 85 96 98 99 104 106 108 122 129 130 131 132 134]\n# step=0 row=2 minW=32 found cw of W=28: [4 6 14 16 24 26 36 39 42 51 52 59 63 64 78 81 98 100 103 104 121 123 129 130 131 133 139 153]\n# step=0 row=8 minW=28 found cw of W=22: [3 11 13 14 16 21 24 42 53 55 56 63 72 85 89 96 99 124 130 134 135 150]\n# step=0 row=17 minW=22 found cw of W=20: [2 3 16 24 30 36 41 49 62 63 81 82 88 100 121 133 139 140 147 153]\n# step=0 row=61 minW=20 found cw of W=18: [4 17 26 30 36 42 46 52 56 65 78 81 85 108 117 121 130 153]\n# round=1000 of 10000 minW=18\n# round=2000 of 10000 minW=18\n# round=3000 of 10000 minW=18\n# round=4000 of 10000 minW=18\n# round=5000 of 10000 minW=18\n# round=6000 of 10000 minW=18\n# round=7000 of 10000 minW=18\n# round=8000 of 10000 minW=18\n# round=9000 of 10000 minW=18\n# round=10000 of 10000 minW=18\nRW algorithm upper bound for the distance d=18\n
[[40,5,9]]	40	5	9	0	0.28759308299049735	1	1	# step=0 row=0 minW=161 found cw of W=32: [1 7 16 21 25 26 30 37 46 55 56 59 64 65 73 77 82 86 87 89 94 95 106 121 122 129 134 139 141 144 150 153]\n# step=0 row=1 minW=32 found cw of W=30: [2 7 11 13 16 25 26 30 32 37 39 46 56 65 76 77 78 87 94 118 119 122 126 131 133 134 146 150 152 156]\n# step=0 row=5 minW=30 found cw of W=28: [5 7 8 21 24 27 30 32 48 67 73 76 78 86 87 94 113 114 118 125 126 134 141 144 150 152 154 156]\n# step=0 row=7 minW=28 found cw of W=22: [12 15 16 26 30 45 56 73 76 82 89 94 95 122 125 129 132 134 146 150 153 156]\n# step=1 row=5 minW=22 found cw of W=20: [10 19 27 28 34 39 50 67 69 83 101 105 108 119 123 139 141 145 149 154]\n# step=12 row=54 minW=20 found cw of W=18: [2 8 9 28 42 48 49 68 70 101 102 110 111 119 141 142 151 159]\n# round=1000 of 10000 minW=18\n# round=2000 of 10000 minW=18\n# round=3000 of 10000 minW=18\n# round=4000 of 10000 minW=18\n# round=5000 of 10000 minW=18\n# round=6000 of 10000 minW=18\n# round=7000 of 10000 minW=18\n# round=8000 of 10000 minW=18\n# round=9000 of 10000 minW=18\n# round=10000 of 10000 minW=18\nRW algorithm upper bound for the distance d=18\n
[[41,2,11]]	41	2	11	0	0.31146045902278274	1	1	# step=0 row=0 minW=165 found cw of W=34: [2 5 6 11 20 21 25 31 33 34 43 46 47 53 63 68 73 75 81 92 93 102 103 104 107 113 120 122 133 135 150 155 156 161]\n# step=0 row=9 minW=34 found cw of W=28: [5 17 19 20 21 25 32 44 46 53 68 75 77 81 85 92 99 101 102 103 107 116 118 122 133 135 150 155]\n# step=0 row=29 minW=28 found cw of W=26: [2 5 11 21 25 28 31 43 44 46 53 55 58 63 66 85 93 99 103 104 113 121 135 137 151 162]\n# step=1 row=52 minW=26 found cw of W=24: [1 2 7 12 13 25 26 34 46 53 86 95 97 107 113 116 124 125 127 128 130 138 149 154]\n# step=10 row=72 minW=24 found cw of W=22: [9 14 18 22 30 50 51 71 74 92 99 101 105 107 137 140 141 142 145 146 148 156]\n# round=1000 of 10000 minW=22\n# round=2000 of 10000 minW=22\n# round=3000 of 10000 minW=22\n# round=4000 of 10000 minW=22\n# round=5000 of 10000 minW=22\n# round=6000 of 10000 minW=22\n# round=7000 of 10000 minW=22\n# round=8000 of 10000 minW=22\n# round=9000 of 10000 minW=22\n# round=10000 of 10000 minW=22\nRW algorithm upper bound for the distance d=22\n
[[42,5,9]]	42	5	9	0	0.3262074579834007	1	1	# step=0 row=0 minW=169 found cw of W=30: [1 7 19 22 23 40 41 49 51 58 63 65 75 79 81 82 85 87 93 103 105 106 115 117 121 123 125 129 142 157]\n# step=0 row=2 minW=30 found cw of W=26: [7 8 18 19 22 23 41 45 49 50 51 57 58 60 63 65 75 93 100 103 105 106 125 129 141 159]\n# step=0 row=6 minW=26 found cw of W=24: [13 22 25 27 45 53 55 57 60 64 76 82 87 109 111 117 118 121 124 137 141 144 159 163]\n# step=0 row=12 minW=24 found cw of W=22: [11 21 25 27 45 57 75 79 83 105 109 111 115 117 123 125 129 137 141 157 163 165]\n# step=5 row=80 minW=22 found cw of W=20: [13 25 27 33 56 66 69 75 76 77 97 98 105 114 147 150 151 156 160 161]\n# step=17 row=13 minW=20 found cw of W=18: [2 14 16 17 21 45 49 51 52 86 98 100 101 105 129 133 135 136]\n# round=1000 of 10000 minW=18\n# round=2000 of 10000 minW=18\n# round=3000 of 10000 minW=18\n# round=4000 of 10000 minW=18\n# round=5000 of 10000 minW=18\n# round=6000 of 10000 minW=18\n# round=7000 of 10000 minW=18\n# round=8000 of 10000 minW=18\n# round=9000 of 10000 minW=18\n# round=10000 of 10000 minW=18\nRW algorithm upper bound for the distance d=18\n
[[43,6,9]]	43	6	9	0	0.3273594999918714	1	1	# step=0 row=0 minW=173 found cw of W=38: [1 3 4 7 10 13 15 21 22 23 32 35 37 44 46 53 54 60 64 65 66 71 74 75 82 85 90 101 114 117 123 128 136 140 142 146 164 168]\n# step=0 row=1 minW=38 found cw of W=36: [2 3 4 7 10 23 24 27 37 38 41 44 46 54 60 71 75 81 82 84 87 88 109 113 114 116 123 133 136 139 140 146 153 159 161 168]\n# step=0 row=2 minW=36 found cw of W=26: [5 11 22 23 37 38 44 54 64 65 66 67 69 81 82 85 87 88 91 123 128 131 150 153 155 168]\n# step=0 row=14 minW=26 found cw of W=24: [4 7 11 15 23 31 32 37 38 44 69 71 74 75 81 87 109 114 123 133 136 140 144 155]\n# step=0 row=33 minW=24 found cw of W=22: [7 10 24 28 41 44 53 64 68 69 84 87 90 101 114 133 136 144 150 153 154 155]\n# step=1 row=30 minW=22 found cw of W=20: [11 31 42 54 56 59 67 73 74 76 96 102 109 116 139 142 152 153 162 171]\n# step=22 row=46 minW=20 found cw of W=18: [12 22 29 38 42 49 53 64 65 70 72 81 85 92 96 141 150 156]\n# round=1000 of 10000 minW=18\n# round=2000 of 10000 minW=18\n# round=3000 of 10000 minW=18\n# round=4000 of 10000 minW=18\n# round=5000 of 10000 minW=18\n# round=6000 of 10000 minW=18\n# round=7000 of 10000 minW=18\n# round=8000 of 10000 minW=18\n# round=9000 of 10000 minW=18\n# round=10000 of 10000 minW=18\nRW algorithm upper bound for the distance d=18\n
[[44,6,9]]	44	6	9	0	0.3560344170255121	1	1	# step=0 row=0 minW=177 found cw of W=38: [2 4 7 17 20 23 26 27 42 50 51 60 65 69 71 78 82 87 92 93 98 104 105 108 111 124 126 130 131 134 137 138 142 153 157 158 166 168]\n# step=0 row=1 minW=38 found cw of W=30: [2 5 7 8 13 14 16 23 33 41 42 44 51 57 60 65 88 93 98 102 109 111 124 130 134 140 142 165 168 173]\n# step=0 row=7 minW=30 found cw of W=26: [14 18 26 33 54 62 71 93 94 102 105 108 115 117 119 130 137 138 142 149 152 158 161 163 165 174]\n# step=0 row=38 minW=26 found cw of W=20: [7 16 17 30 44 46 51 54 73 74 88 94 98 104 130 134 138 149 161 174]\n# step=11 row=57 minW=20 found cw of W=18: [3 4 8 29 32 45 48 70 76 89 112 117 123 135 140 156 158 167]\n# round=1000 of 10000 minW=18\n# round=2000 of 10000 minW=18\n# round=3000 of 10000 minW=18\n# round=4000 of 10000 minW=18\n# round=5000 of 10000 minW=18\n# round=6000 of 10000 minW=18\n# round=7000 of 10000 minW=18\n# round=8000 of 10000 minW=18\n# round=9000 of 10000 minW=18\n# round=10000 of 10000 minW=18\nRW algorithm upper bound for the distance d=18\n
[[45,6,9]]	45	6	9	0	0.35828766599297523	1	1	# step=0 row=0 minW=181 found cw of W=36: [1 6 9 11 13 25 29 32 35 37 39 54 58 61 63 77 79 80 81 82 101 110 124 126 130 131 136 141 151 153 155 160 164 174 175 176]\n# step=0 row=2 minW=36 found cw of W=30: [3 6 15 20 25 36 38 39 43 48 60 63 71 79 80 82 86 88 110 124 126 128 131 141 153 160 161 170 172 174]\n# step=0 row=4 minW=30 found cw of W=26: [5 13 17 20 32 35 37 38 39 44 58 81 86 88 89 110 126 128 133 140 152 167 170 172 174 176]\n# step=0 row=9 minW=26 found cw of W=24: [6 9 16 25 32 35 37 44 54 61 71 77 79 80 83 89 124 128 130 141 160 161 172 175]\n# step=0 row=50 minW=24 found cw of W=22: [15 19 25 32 33 44 54 63 77 82 83 89 99 105 110 128 153 154 155 160 168 172]\n# step=22 row=12 minW=22 found cw of W=20: [17 29 30 31 34 40 46 60 68 74 91 107 118 124 150 158 163 165 166 175]\n# step=26 row=67 minW=20 found cw of W=18: [13 17 35 39 64 77 94 103 107 117 121 122 125 129 139 154 162 166]\n# round=1000 of 10000 minW=18\n# round=2000 of 10000 minW=18\n# round=3000 of 10000 minW=18\n# round=4000 of 10000 minW=18\n# round=5000 of 10000 minW=18\n# round=6000 of 10000 minW=18\n# round=7000 of 10000 minW=18\n# round=8000 of 10000 minW=18\n# round=9000 of 10000 minW=18\n# round=10000 of 10000 minW=18\nRW algorithm upper bound for the distance d=18\n
[[46,7,9]]	46	7	9	0	0.39532237499952316	1	1	# step=0 row=0 minW=185 found cw of W=32: [1 8 10 16 17 29 42 56 58 62 65 74 81 83 93 100 106 123 125 127 131 150 152 155 157 166 167 169 171 175 177 180]\n# step=0 row=1 minW=32 found cw of W=30: [2 3 10 23 26 29 40 41 46 65 69 75 81 86 92 95 102 107 109 127 129 131 140 153 155 157 164 175 177 179]\n# step=0 row=25 minW=30 found cw of W=28: [2 10 16 21 29 40 44 58 62 75 77 84 87 90 102 106 107 113 123 131 132 140 150 152 153 176 177 179]\n# step=0 row=46 minW=28 found cw of W=24: [8 10 15 16 21 23 45 47 56 58 62 67 69 77 83 91 93 100 125 129 150 153 169 171]\n# step=1 row=43 minW=24 found cw of W=20: [7 11 19 23 47 53 56 57 58 72 79 93 102 104 105 115 118 125 151 157]\n# step=3 row=7 minW=20 found cw of W=18: [2 13 18 20 31 38 77 82 93 110 112 128 133 139 140 151 176 179]\n# round=1000 of 10000 minW=18\n# round=2000 of 10000 minW=18\n# round=3000 of 10000 minW=18\n# round=4000 of 10000 minW=18\n# round=5000 of 10000 minW=18\n# round=6000 of 10000 minW=18\n# round=7000 of 10000 minW=18\n# round=8000 of 10000 minW=18\n# round=9000 of 10000 minW=18\n# round=10000 of 10000 minW=18\nRW algorithm upper bound for the distance d=18\n
[[47,8,9]]	47	8	9	0	0.3947390420071315	1	1	# step=0 row=0 minW=189 found cw of W=32: [2 8 10 11 15 16 19 24 25 32 34 43 49 57 58 62 68 71 72 78 81 83 88 115 125 126 130 149 157 160 182 184]\n# step=0 row=5 minW=32 found cw of W=30: [11 12 14 19 32 34 35 39 43 58 69 73 78 81 88 91 106 108 125 130 137 138 160 163 167 173 176 177 180 182]\n# step=0 row=7 minW=30 found cw of W=28: [4 14 17 24 34 46 51 57 64 68 71 72 78 81 91 93 99 104 108 113 115 119 125 137 138 146 160 184]\n# step=0 row=14 minW=28 found cw of W=24: [4 24 25 26 30 34 44 62 68 71 72 73 77 81 88 91 93 98 109 115 137 140 182 184]\n# step=0 row=43 minW=24 found cw of W=22: [16 25 32 37 43 44 51 62 72 73 84 91 98 99 109 110 126 133 137 146 167 180]\n# step=0 row=93 minW=22 found cw of W=20: [10 11 16 25 26 34 39 58 72 77 78 81 83 104 125 133 157 167 171 177]\n# step=4 row=32 minW=20 found cw of W=18: [14 15 16 20 35 45 61 103 113 114 121 139 150 156 157 160 168 176]\n# round=1000 of 10000 minW=18\n# round=2000 of 10000 minW=18\n# round=3000 of 10000 minW=18\n# round=4000 of 10000 minW=18\n# round=5000 of 10000 minW=18\n# round=6000 of 10000 minW=18\n# round=7000 of 10000 minW=18\n# round=8000 of 10000 minW=18\n# round=9000 of 10000 minW=18\n# round=10000 of 10000 minW=18\nRW algorithm upper bound for the distance d=18\n
[[48,5,10]]	48	5	10	0	0.40725162500166334	1	1	# step=0 row=0 minW=193 found cw of W=44: [1 3 5 11 13 17 18 30 47 50 53 63 65 68 72 73 78 84 86 94 97 98 110 115 122 129 131 132 143 147 155 157 158 159 162 163 164 168 169 170 177 179 182 190]\n# step=0 row=1 minW=44 found cw of W=36: [2 3 5 18 26 28 30 37 39 40 53 61 68 78 84 85 86 88 98 104 115 116 120 122 135 138 147 152 157 162 163 168 172 180 182 186]\n# step=0 row=7 minW=36 found cw of W=34: [12 13 17 26 28 30 37 50 58 61 65 66 78 83 85 94 98 103 106 108 115 116 122 129 132 151 162 163 164 172 177 179 180 190]\n# step=0 row=18 minW=34 found cw of W=32: [5 9 11 13 26 28 32 37 40 50 53 56 68 71 85 88 98 104 122 128 129 132 138 153 155 157 164 167 172 177 180 186]\n# step=0 row=67 minW=32 found cw of W=30: [3 9 11 13 17 29 30 37 56 65 71 72 78 83 85 120 125 129 132 138 147 152 153 155 157 167 177 179 180 186]\n# step=0 row=68 minW=30 found cw of W=26: [9 18 28 31 47 49 58 66 71 72 97 103 104 106 120 127 131 132 143 151 152 153 167 172 179 180]\n# step=2 row=21 minW=26 found cw of W=24: [5 19 23 33 43 50 55 56 71 72 78 79 91 98 103 115 120 127 129 141 149 152 174 189]\n# step=3 row=36 minW=24 found cw of W=22: [9 26 46 56 65 72 74 79 80 88 99 104 105 113 114 120 128 136 147 162 175 190]\n# step=82 row=18 minW=22 found cw of W=20: [7 12 17 28 30 46 58 76 78 83 95 97 108 142 143 145 151 154 161 179]\n# round=1000 of 10000 minW=20\n# round=2000 of 10000 minW=20\n# round=3000 of 10000 minW=20\n# round=4000 of 10000 minW=20\n# round=5000 of 10000 minW=20\n# round=6000 of 10000 minW=20\n# round=7000 of 10000 minW=20\n# round=8000 of 10000 minW=20\n# round=9000 of 10000 minW=20\n# round=10000 of 10000 minW=20\nRW algorithm upper bound for the distance d=20\n
[[49,17,7]]	49	17	7	0	0.3752628329966683	1	1	# step=0 row=0 minW=197 found cw of W=30: [3 7 10 17 20 39 41 54 59 69 82 84 89 93 103 112 113 115 131 133 137 146 150 154 161 162 187 188 191 195]\n# step=0 row=2 minW=30 found cw of W=26: [2 8 20 29 31 41 52 69 72 77 89 100 106 113 115 127 146 150 162 164 170 175 178 187 188 195]\n# step=0 row=3 minW=26 found cw of W=24: [9 10 20 41 52 59 77 82 89 107 113 115 118 126 127 131 146 150 162 164 176 187 188 195]\n# step=0 row=35 minW=24 found cw of W=20: [2 23 29 41 44 61 69 72 100 110 112 118 126 146 161 175 176 188 191 195]\n# step=5 row=11 minW=20 found cw of W=18: [3 21 22 25 35 50 70 71 74 88 90 99 118 133 139 150 167 186]\n# step=15 row=33 minW=18 found cw of W=16: [25 36 43 45 53 63 88 90 92 102 112 134 137 143 172 188]\n# step=49 row=61 minW=16 found cw of W=14: [29 33 42 49 57 73 92 106 122 141 176 180 189 196]\n# round=1000 of 10000 minW=14\n# round=2000 of 10000 minW=14\n# round=3000 of 10000 minW=14\n# round=4000 of 10000 minW=14\n# round=5000 of 10000 minW=14\n# round=6000 of 10000 minW=14\n# round=7000 of 10000 minW=14\n# round=8000 of 10000 minW=14\n# round=9000 of 10000 minW=14\n# round=10000 of 10000 minW=14\nRW algorithm upper bound for the distance d=14\n
[[50,13,8]]	50	13	8	0	0.41980058400076814	1	1	# step=0 row=0 minW=201 found cw of W=38: [1 3 5 10 12 22 29 32 42 45 55 57 59 62 72 88 94 95 99 101 107 116 125 126 135 142 153 159 160 166 175 176 179 182 185 188 194 199]\n# step=0 row=2 minW=38 found cw of W=28: [2 3 6 10 12 22 29 40 45 49 52 56 62 72 83 90 98 109 127 133 153 159 160 177 179 195 198 199]\n# step=0 row=30 minW=28 found cw of W=26: [3 5 12 16 18 22 32 45 49 53 55 59 94 99 109 112 116 125 129 132 168 172 175 179 194 195]\n# step=0 row=91 minW=26 found cw of W=24: [3 22 29 49 59 72 75 90 94 99 104 116 127 135 140 153 154 159 166 175 177 179 185 194]\n# step=1 row=29 minW=24 found cw of W=22: [10 11 12 23 29 40 48 49 57 60 62 71 73 91 99 111 121 140 148 157 179 191]\n# step=1 row=46 minW=22 found cw of W=18: [17 18 20 31 32 78 88 91 117 120 128 138 140 168 181 182 190 191]\n# step=620 row=94 minW=18 found cw of W=16: [3 28 33 44 65 73 105 123 128 133 142 153 155 165 192 194]\n# round=1000 of 10000 minW=16\n# round=2000 of 10000 minW=16\n# round=3000 of 10000 minW=16\n# round=4000 of 10000 minW=16\n# round=5000 of 10000 minW=16\n# round=6000 of 10000 minW=16\n# round=7000 of 10000 minW=16\n# round=8000 of 10000 minW=16\n# round=9000 of 10000 minW=16\n# round=10000 of 10000 minW=16\nRW algorithm upper bound for the distance d=16\n
[[51,12,9]]	51	12	9	0	0.4460256659949664	1	1	# step=0 row=0 minW=205 found cw of W=38: [1 4 7 12 26 29 37 38 41 50 55 58 59 60 61 62 67 82 88 92 101 102 112 113 114 118 128 141 151 154 161 162 182 184 191 192 202 204]\n# step=0 row=1 minW=38 found cw of W=34: [2 4 7 14 18 26 29 30 34 44 55 58 59 61 62 63 67 74 112 113 114 116 118 120 128 141 155 161 176 182 183 187 192 197]\n# step=0 row=5 minW=34 found cw of W=30: [7 9 12 14 16 30 34 38 44 50 59 86 91 92 101 110 114 116 118 142 151 160 162 183 187 188 191 194 197 202]\n# step=0 row=18 minW=30 found cw of W=28: [4 6 26 29 30 31 38 41 55 57 59 60 77 86 95 113 116 161 162 164 167 182 183 184 188 191 194 197]\n# step=0 row=20 minW=28 found cw of W=26: [12 21 34 35 37 38 41 44 62 88 101 102 113 114 136 141 151 174 188 191 192 194 197 202 203 204]\n# step=0 row=55 minW=26 found cw of W=20: [12 38 41 44 54 59 61 63 67 95 101 105 112 116 118 161 167 191 194 203]\n# step=3 row=41 minW=20 found cw of W=18: [3 7 8 12 26 33 57 63 75 77 83 84 105 108 110 160 177 185]\n# round=1000 of 10000 minW=18\n# round=2000 of 10000 minW=18\n# round=3000 of 10000 minW=18\n# round=4000 of 10000 minW=18\n# round=5000 of 10000 minW=18\n# round=6000 of 10000 minW=18\n# round=7000 of 10000 minW=18\n# round=8000 of 10000 minW=18\n# round=9000 of 10000 minW=18\n# round=10000 of 10000 minW=18\nRW algorithm upper bound for the distance d=18\n
[[52,10,10]]	52	10	11	1	0.48365287500200793	1	1	# step=0 row=0 minW=209 found cw of W=32: [1 3 5 15 16 17 18 23 37 51 57 60 63 75 76 91 105 112 116 119 121 122 154 155 159 167 168 172 180 193 195 206]\n# step=0 row=31 minW=32 found cw of W=28: [3 9 16 17 18 35 52 55 61 63 83 91 104 110 112 115 116 121 122 135 139 150 162 164 168 172 195 202]\n# step=3 row=22 minW=28 found cw of W=26: [2 9 21 32 38 52 59 61 67 71 77 84 104 121 125 147 148 158 163 171 173 175 181 194 199 200]\n# step=5 row=29 minW=26 found cw of W=22: [1 6 28 33 43 51 52 53 64 80 82 95 116 134 141 144 162 189 193 196 207 208]\n# round=1000 of 10000 minW=22\n# round=2000 of 10000 minW=22\n# round=3000 of 10000 minW=22\n# round=4000 of 10000 minW=22\n# round=5000 of 10000 minW=22\n# round=6000 of 10000 minW=22\n# round=7000 of 10000 minW=22\n# round=8000 of 10000 minW=22\n# round=9000 of 10000 minW=22\n# round=10000 of 10000 minW=22\nRW algorithm upper bound for the distance d=22\n
[[53,6,11]]	53	6	11	0	0.5099404169886839	1	1	# step=0 row=0 minW=213 found cw of W=32: [1 2 26 33 37 40 42 45 48 55 62 63 66 79 92 104 107 115 119 123 139 145 146 151 157 158 169 176 196 201 207 211]\n# step=0 row=25 minW=32 found cw of W=30: [12 13 17 26 34 36 38 40 45 46 51 55 62 66 100 104 107 115 118 132 146 160 161 176 193 195 197 204 205 206]\n# step=2 row=6 minW=30 found cw of W=26: [4 19 22 41 47 53 55 62 68 83 108 111 136 145 152 159 163 164 168 174 178 181 198 200 205 206]\n# step=59 row=50 minW=26 found cw of W=22: [7 31 40 42 45 76 80 97 98 107 111 129 137 141 148 160 164 166 186 194 199 203]\n# round=1000 of 10000 minW=22\n# round=2000 of 10000 minW=22\n# round=3000 of 10000 minW=22\n# round=4000 of 10000 minW=22\n# round=5000 of 10000 minW=22\n# round=6000 of 10000 minW=22\n# round=7000 of 10000 minW=22\n# round=8000 of 10000 minW=22\n# round=9000 of 10000 minW=22\n# round=10000 of 10000 minW=22\nRW algorithm upper bound for the distance d=22\n
[[54,12,10]]	54	12	10	0	0.5168565000058152	1	1	# step=0 row=0 minW=217 found cw of W=30: [1 3 13 15 16 17 44 48 69 76 80 83 87 94 101 109 111 124 125 126 134 155 175 180 184 191 195 202 206 210]\n# step=0 row=11 minW=30 found cw of W=28: [13 14 16 21 36 58 66 69 75 76 83 90 94 101 112 118 122 123 124 135 155 172 174 175 184 189 191 202]\n# step=0 row=49 minW=28 found cw of W=26: [3 16 36 37 39 48 52 66 70 83 91 93 101 105 111 135 137 143 155 159 174 189 197 198 210 214]\n# step=5 row=116 minW=26 found cw of W=22: [17 25 32 44 46 54 55 102 109 123 125 130 135 140 177 184 187 189 206 208 210 216]\n# step=76 row=44 minW=22 found cw of W=20: [21 22 31 41 71 75 76 106 109 125 126 127 132 160 163 180 181 186 193 203]\n# round=1000 of 10000 minW=20\n# round=2000 of 10000 minW=20\n# round=3000 of 10000 minW=20\n# round=4000 of 10000 minW=20\n# round=5000 of 10000 minW=20\n# round=6000 of 10000 minW=20\n# round=7000 of 10000 minW=20\n# round=8000 of 10000 minW=20\n# round=9000 of 10000 minW=20\n# round=10000 of 10000 minW=20\nRW algorithm upper bound for the distance d=20\n
[[55,5,12]]	55	5	12	0	0.5484286249848083	1	1	# step=0 row=0 minW=221 found cw of W=38: [1 2 7 9 20 27 47 53 54 63 70 75 89 95 102 108 111 114 117 118 119 120 124 131 137 150 154 165 167 169 175 179 180 186 199 209 219 220]\n# step=0 row=37 minW=38 found cw of W=36: [9 20 24 26 34 40 53 60 64 67 71 74 79 83 89 92 102 108 116 129 131 138 147 150 152 154 170 171 177 181 185 186 191 207 209 212]\n# step=0 row=76 minW=36 found cw of W=34: [6 7 9 34 54 67 74 77 87 88 92 108 114 117 119 120 129 142 143 147 152 153 158 169 171 175 177 187 199 207 208 213 218 219]\n# step=1 row=40 minW=34 found cw of W=32: [3 13 24 28 31 36 44 51 68 69 76 86 91 92 99 102 106 120 124 125 132 134 138 159 168 175 180 186 187 202 212 214]\n# step=2 row=38 minW=32 found cw of W=30: [12 14 20 30 31 32 39 40 53 57 75 78 79 85 86 87 94 95 98 134 135 152 153 163 167 177 179 188 190 207]\n# step=6 row=55 minW=30 found cw of W=28: [5 21 31 34 49 50 52 54 55 59 60 77 89 95 97 110 114 131 132 134 152 162 189 196 205 214 215 219]\n# step=9 row=29 minW=28 found cw of W=26: [7 15 36 37 53 60 62 71 86 91 93 102 106 115 144 147 151 161 180 181 196 199 203 206 212 218]\n# step=89 row=68 minW=26 found cw of W=24: [1 2 6 9 13 30 40 55 68 75 85 94 95 96 103 111 130 158 167 171 174 204 206 220]\n# round=1000 of 10000 minW=24\n# round=2000 of 10000 minW=24\n# round=3000 of 10000 minW=24\n# round=4000 of 10000 minW=24\n# round=5000 of 10000 minW=24\n# round=6000 of 10000 minW=24\n# round=7000 of 10000 minW=24\n# round=8000 of 10000 minW=24\n# round=9000 of 10000 minW=24\n# round=10000 of 10000 minW=24\nRW algorithm upper bound for the distance d=24\n
[[56,5,12]]	56	5	12	0	0.5643751670140773	1	1	# step=0 row=0 minW=225 found cw of W=40: [1 8 13 15 17 22 30 40 44 45 49 51 52 54 57 64 73 92 101 109 117 119 125 143 156 163 164 166 168 173 175 183 190 198 199 204 208 217 221 224]\n# step=0 row=3 minW=40 found cw of W=36: [5 15 17 40 41 44 49 73 88 92 95 98 105 109 119 130 138 143 149 151 153 154 168 173 175 183 186 194 199 200 204 205 208 212 221 224]\n# step=0 row=38 minW=36 found cw of W=30: [24 32 38 40 41 45 57 76 80 95 109 117 119 132 143 153 154 165 168 169 173 175 199 200 206 207 208 210 213 224]\n# step=2 row=59 minW=30 found cw of W=28: [2 10 31 59 62 75 87 94 95 96 98 112 118 119 128 130 150 151 152 168 170 171 175 178 184 186 187 210]\n# step=38 row=28 minW=28 found cw of W=26: [1 17 18 29 40 52 53 62 74 75 94 96 104 108 113 116 129 142 150 172 174 187 197 198 216 221]\n# step=75 row=26 minW=26 found cw of W=24: [1 6 19 32 40 41 57 65 71 76 85 95 97 115 121 132 141 144 152 171 174 183 187 207]\n# round=1000 of 10000 minW=24\n# round=2000 of 10000 minW=24\n# round=3000 of 10000 minW=24\n# round=4000 of 10000 minW=24\n# round=5000 of 10000 minW=24\n# round=6000 of 10000 minW=24\n# round=7000 of 10000 minW=24\n# round=8000 of 10000 minW=24\n# round=9000 of 10000 minW=24\n# round=10000 of 10000 minW=24\nRW algorithm upper bound for the distance d=24\n
[[57,4,13]]	57	4	13	0	0.57957383300527	1	1	# step=0 row=0 minW=229 found cw of W=50: [1 4 5 8 13 22 30 33 34 36 39 46 47 49 51 57 61 71 78 83 84 89 90 93 102 103 104 106 108 111 115 122 127 128 136 140 141 144 155 158 159 171 176 192 203 205 210 212 215 225]\n# step=0 row=3 minW=50 found cw of W=48: [6 8 10 14 22 30 34 36 37 47 51 57 67 68 71 72 74 78 79 90 93 96 97 101 102 104 111 116 119 120 131 144 147 151 159 173 176 179 182 186 192 205 210 211 215 222 225 228]\n# step=0 row=4 minW=48 found cw of W=46: [7 8 10 11 14 36 37 46 49 51 55 67 71 74 89 90 93 96 101 103 108 111 112 119 131 135 147 151 155 158 163 164 170 171 176 178 179 182 192 203 210 212 221 225 227 228]\n# step=0 row=6 minW=46 found cw of W=44: [7 8 10 14 15 22 37 46 49 51 55 67 68 71 72 79 96 97 101 102 103 108 112 115 116 119 135 151 159 163 164 170 172 173 176 178 179 182 192 210 211 215 221 227]\n# step=0 row=12 minW=44 found cw of W=38: [5 8 14 23 30 36 37 39 49 55 72 78 89 93 96 97 106 108 112 119 122 128 135 137 144 151 152 155 164 171 186 203 209 211 212 221 222 228]\n# step=0 row=24 minW=38 found cw of W=36: [7 8 13 30 34 43 51 59 79 84 89 96 101 102 105 106 108 109 127 136 141 144 158 159 162 163 164 166 173 178 179 203 205 210 214 221]\n# step=0 row=93 minW=36 found cw of W=34: [4 7 22 36 37 51 55 61 73 74 89 90 93 105 112 115 116 122 131 136 147 151 158 162 171 172 173 178 179 187 203 215 222 228]\n# step=1 row=36 minW=34 found cw of W=30: [8 14 19 22 30 40 61 66 71 74 75 76 85 91 111 112 123 129 131 136 142 144 148 175 179 186 189 211 225 226]\n# step=24 row=34 minW=30 found cw of W=28: [16 25 38 54 61 62 69 82 92 99 107 110 126 130 138 152 156 160 166 175 176 195 206 217 221 223 224 225]\n# step=35 row=3 minW=28 found cw of W=26: [6 10 20 37 46 54 56 57 60 94 109 112 113 117 120 142 143 160 168 169 181 191 199 200 223 228]\n# round=1000 of 10000 minW=26\n# round=2000 of 10000 minW=26\n# round=3000 of 10000 minW=26\n# round=4000 of 10000 minW=26\n# round=5000 of 10000 minW=26\n# round=6000 of 10000 minW=26\n# round=7000 of 10000 minW=26\n# round=8000 of 10000 minW=26\n# round=9000 of 10000 minW=26\n# round=10000 of 10000 minW=26\nRW algorithm upper bound for the distance d=26\n
[[58,12,10]]	58	12	10	0	0.5918586250045337	1	1	# step=0 row=0 minW=233 found cw of W=44: [1 12 13 17 25 26 30 32 45 48 57 65 66 84 85 86 93 100 101 103 106 117 122 123 124 141 143 144 146 148 152 159 169 171 173 180 186 187 191 209 210 216 227 229]\n# step=0 row=1 minW=44 found cw of W=40: [2 3 4 17 23 26 30 32 38 45 61 65 75 87 92 93 96 98 100 103 106 123 139 141 145 146 148 152 169 176 178 199 200 208 209 210 214 216 222 227]\n# step=0 row=4 minW=40 found cw of W=38: [4 8 17 25 26 30 32 35 38 44 45 48 65 69 75 76 93 96 100 103 122 123 124 127 134 137 141 146 148 171 178 180 195 200 216 218 222 229]\n# step=0 row=8 minW=38 found cw of W=36: [6 12 13 15 23 30 38 65 69 76 85 86 87 92 96 100 111 122 123 127 134 139 143 144 145 146 152 158 171 186 187 189 208 210 227 229]\n# step=0 row=21 minW=36 found cw of W=28: [2 6 12 17 30 40 46 55 57 66 75 76 87 98 101 111 124 134 145 159 171 173 176 180 186 204 220 227]\n# step=0 row=47 minW=28 found cw of W=26: [4 6 23 26 30 32 45 55 57 66 75 90 98 103 120 124 139 146 158 171 173 180 191 200 214 216]\n# step=8 row=30 minW=26 found cw of W=24: [27 37 53 59 64 82 100 101 102 108 117 122 134 151 153 159 166 169 192 198 201 209 216 218]\n# step=17 row=72 minW=24 found cw of W=20: [2 14 15 20 26 47 58 60 67 84 99 102 105 125 131 174 188 194 215 218]\n# round=1000 of 10000 minW=20\n# round=2000 of 10000 minW=20\n# round=3000 of 10000 minW=20\n# round=4000 of 10000 minW=20\n# round=5000 of 10000 minW=20\n# round=6000 of 10000 minW=20\n# round=7000 of 10000 minW=20\n# round=8000 of 10000 minW=20\n# round=9000 of 10000 minW=20\n# round=10000 of 10000 minW=20\nRW algorithm upper bound for the distance d=20\n
[[59,12,10]]	59	12	10	0	0.6210968749946915	1	1	# step=0 row=0 minW=237 found cw of W=44: [1 15 23 24 30 34 39 51 64 66 70 78 80 89 90 93 100 103 104 113 115 119 121 123 124 137 142 149 162 163 172 176 180 183 184 188 192 198 200 216 218 228 233 235]\n# step=0 row=1 minW=44 found cw of W=36: [2 3 5 7 14 20 23 29 30 34 45 56 60 65 66 73 78 79 88 89 91 93 103 119 123 124 137 150 155 162 163 179 180 200 214 233]\n# step=0 row=7 minW=36 found cw of W=34: [7 11 15 20 21 24 30 34 39 42 48 64 70 72 78 79 89 100 107 115 123 131 135 142 184 192 194 196 198 211 216 218 219 233]\n# step=0 row=17 minW=34 found cw of W=26: [3 5 7 23 27 39 42 70 80 83 103 121 123 124 137 142 162 183 184 188 196 198 200 204 216 219]\n# step=6 row=36 minW=26 found cw of W=24: [15 21 45 52 53 56 68 69 80 84 90 112 127 141 143 152 174 187 192 200 208 211 222 229]\n# step=13 row=19 minW=24 found cw of W=20: [3 34 37 44 62 69 81 86 93 103 115 129 140 156 174 187 188 204 214 215]\n# round=1000 of 10000 minW=20\n# round=2000 of 10000 minW=20\n# round=3000 of 10000 minW=20\n# round=4000 of 10000 minW=20\n# round=5000 of 10000 minW=20\n# round=6000 of 10000 minW=20\n# round=7000 of 10000 minW=20\n# round=8000 of 10000 minW=20\n# round=9000 of 10000 minW=20\n# round=10000 of 10000 minW=20\nRW algorithm upper bound for the distance d=20\n
[[60,10,11]]	60	10	11	0	0.641095208004117	1	1	# step=0 row=1 minW=241 found cw of W=42: [2 7 13 14 15 21 54 56 58 60 61 62 67 73 88 98 101 103 106 120 121 134 135 137 142 147 148 158 161 163 164 174 176 177 178 197 201 202 207 224 226 237]\n# step=0 row=5 minW=42 found cw of W=40: [9 14 18 21 32 38 47 58 60 61 62 74 76 90 98 101 106 108 120 121 136 138 147 148 152 154 161 164 166 168 178 182 189 201 207 208 210 214 224 227]\n# step=0 row=12 minW=40 found cw of W=36: [6 15 16 18 23 38 60 61 62 70 76 77 78 88 98 104 106 108 120 121 126 130 135 137 154 168 169 178 182 203 208 214 224 226 229 238]\n# step=0 row=14 minW=36 found cw of W=34: [6 7 25 27 32 38 54 58 67 74 77 85 88 94 101 104 107 134 142 143 152 158 161 174 178 186 197 202 203 207 208 214 224 227]\n# step=0 row=21 minW=34 found cw of W=30: [32 38 39 54 58 60 61 62 88 94 98 107 108 114 120 126 137 143 148 152 168 181 182 186 197 203 214 219 227 238]\n# step=2 row=35 minW=30 found cw of W=26: [5 10 32 37 52 55 68 75 85 94 109 115 128 135 145 148 152 167 185 190 208 214 217 227 229 232]\n# step=14 row=31 minW=26 found cw of W=24: [7 27 49 61 82 99 102 108 126 127 136 158 169 178 181 186 196 202 207 218 219 222 228 238]\n# step=354 row=40 minW=24 found cw of W=22: [12 14 16 17 21 42 57 71 72 74 76 77 92 96 102 117 131 145 152 201 205 216]\n# round=1000 of 10000 minW=22\n# round=2000 of 10000 minW=22\n# round=3000 of 10000 minW=22\n# round=4000 of 10000 minW=22\n# round=5000 of 10000 minW=22\n# round=6000 of 10000 minW=22\n# round=7000 of 10000 minW=22\n# round=8000 of 10000 minW=22\n# round=9000 of 10000 minW=22\n# round=10000 of 10000 minW=22\nRW algorithm upper bound for the distance d=22\n
[[61,10,11]]	61	10	11	0	0.6679942089831457	1	1	# step=0 row=0 minW=245 found cw of W=36: [1 4 21 34 35 40 41 48 56 57 67 74 90 99 106 110 116 117 118 126 135 136 157 160 162 171 184 189 197 204 212 217 224 228 231 238]\n# step=0 row=7 minW=36 found cw of W=34: [14 33 35 41 48 49 50 66 74 90 94 95 97 99 103 110 111 114 116 135 136 143 157 160 164 175 188 204 212 217 219 224 231 238]\n# step=0 row=37 minW=34 found cw of W=28: [15 16 21 25 34 35 41 57 74 76 77 86 93 95 97 98 118 135 143 157 158 159 160 177 215 221 224 238]\n# step=7 row=35 minW=28 found cw of W=26: [13 42 43 45 67 73 74 78 92 106 110 113 118 119 130 164 171 174 179 189 191 195 200 214 226 241]\n# step=83 row=85 minW=26 found cw of W=24: [3 16 20 25 26 41 49 54 59 90 110 125 138 142 151 158 178 208 209 219 224 237 239 242]\n# step=140 row=92 minW=24 found cw of W=22: [2 11 25 26 29 51 73 80 86 102 112 118 124 148 163 177 179 194 195 202 212 238]\n# round=1000 of 10000 minW=22\n# round=2000 of 10000 minW=22\n# round=3000 of 10000 minW=22\n# round=4000 of 10000 minW=22\n# round=5000 of 10000 minW=22\n# round=6000 of 10000 minW=22\n# round=7000 of 10000 minW=22\n# round=8000 of 10000 minW=22\n# round=9000 of 10000 minW=22\n# round=10000 of 10000 minW=22\nRW algorithm upper bound for the distance d=22\n
[[62,16,10]]	62	16	10	0	0.6707383330212906	1	1	# step=0 row=0 minW=249 found cw of W=30: [1 9 14 27 31 32 36 42 56 57 76 81 111 123 143 151 155 166 168 172 185 187 195 218 222 230 234 235 242 243]\n# step=0 row=59 minW=30 found cw of W=28: [22 32 42 48 52 56 73 75 81 84 95 97 100 111 114 116 143 157 159 162 166 172 178 197 199 218 235 242]\n# step=0 row=69 minW=28 found cw of W=26: [32 35 45 48 52 54 57 73 75 108 114 115 116 117 131 159 169 177 179 193 197 199 218 232 234 243]\n# step=11 row=7 minW=26 found cw of W=24: [8 13 23 29 33 45 61 62 70 77 88 94 107 123 139 158 186 199 209 212 215 218 219 220]\n# step=47 row=68 minW=24 found cw of W=22: [11 12 19 34 55 57 58 61 80 86 118 120 123 136 142 143 180 181 197 210 220 241]\n# step=72 row=34 minW=22 found cw of W=20: [7 8 10 22 45 61 65 68 88 111 127 130 131 132 146 169 196 212 235 247]\n# round=1000 of 10000 minW=20\n# round=2000 of 10000 minW=20\n# round=3000 of 10000 minW=20\n# round=4000 of 10000 minW=20\n# round=5000 of 10000 minW=20\n# round=6000 of 10000 minW=20\n# round=7000 of 10000 minW=20\n# round=8000 of 10000 minW=20\n# round=9000 of 10000 minW=20\n# round=10000 of 10000 minW=20\nRW algorithm upper bound for the distance d=20\n
