aramis erak
Legend
did a bit of programmatic analysis...
with "a" having skill 7, and "b" having 17...
HW a= 42 b= 312 t= 7 both f= 39
LW a= 112 b= 242 t= 7 both f= 39
Note that high wins vs low wins is a significant change.
Low wins means low will win roughly 1/4 of the time, instead of 1/10th, given the 7 vs 17.
lets see an 8 vs 13
HW a= 84 b= 224 t= 8 f= 84
LW a= 124 b= 184 t= 8 f= 84
That's still pretty profound.
While the game doesn't permit ties (the active wins ties), by checking them separately, the program becomes active agnostic.
with "a" having skill 7, and "b" having 17...
HW a= 42 b= 312 t= 7 both f= 39
LW a= 112 b= 242 t= 7 both f= 39
Note that high wins vs low wins is a significant change.
Low wins means low will win roughly 1/4 of the time, instead of 1/10th, given the 7 vs 17.
lets see an 8 vs 13
HW a= 84 b= 224 t= 8 f= 84
LW a= 124 b= 184 t= 8 f= 84
That's still pretty profound.
While the game doesn't permit ties (the active wins ties), by checking them separately, the program becomes active agnostic.
Python:
## low = [1,2,3,4,5, 6, 7, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
## high = [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,0,0,0]
low = [1,2,3,4,5,6,7,8,0,0,0,0,0,0,0,0,0,0,0,0]
high = [1,2,3,4,5,6,7,8,9,10,11,12,13,0,0,0,0,0,0,0]
na = 0 ## high wins
nb = 0
nt = 0
oa = 0 ## low wins
ob = 0
nf = 0
for a in low:
for b in high:
if (a > 0) and (b > 0):
if a > b:
ob += 1
na += 1
elif b > a:
oa += 1
nb += 1
else:
nt += 1
elif a > 0:
na += 1
oa += 1
elif b > 0:
nb += 1
ob += 1
else:
nf += 1
print ("HW\ta=",na,"\tb=",nb,"\tt=",nt,"\tf=",nf)
print ("LW\ta=",oa,"\tb=",ob,"\tt=",nt,"\tf=",nf)