This preview shows pages 1–2. Sign up to view the full content.
Sheet1
Page 1
Matching Warriors
 
The Kingdom of Irfrissable Polytudinous Warriors (KIPW)
has a tournament every year between its two tribes, the
Kay (K), and the Kaykay (KK).
This consists of contests
between individual warriors, each tribe having the same
number, and the tribe with the most winning warriors
wins the coveted thud cup.
Its up to the tribe that lost last year (currently the
K) to choose which warriors will fight each other.
The
K are using science to do this, and have derived the
following method of determining the probability that
warrior i will defeat warrior j.
To this end the K have
assigned scores for 6 skills to each warrior, so the
scores for warrior i are s[i][k] for k = 0,1,2,3,4,5.
Then the probability of warrior i defeating warrior j
is
I / (I + J)
where
I
= max{I',0}
I' = max{ s[i][k]  s[j][k] : k=0,1,2,3,4,5 }
J
= max{J',0}
J' = max{ s[j][k]  s[i][k] : k=0,1,2,3,4,5 }
and in the special case that I = J = 0, the probability
is 0.5.
It is your task to compute for K the matching of
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 04/29/2011 for the course IT 201 taught by Professor K.v.arya during the Spring '11 term at IIT Kanpur.
 Spring '11
 k.v.arya

Click to edit the document details