On the Game of Hand Cricket

Athreya Shankar
February 21, 2015

Introduction

Hand cricket is a game commonly played among school students in India. It is a game loosely based on the more
popularly known game of rock, paper, scissors. The rules of the game are quite straightforward. It is a two-player
game where each player uses one hand to cast a number with his hand. While one player bats, the other bowls
and vice-versa. Each player can cast a number in the range 1 to 6. The numbers 1 to 5 are cast by displaying the
relevant number of fingers, whereas 6 is denoted by a thumbs up sign. If, while playing, both the players cast the
same number, then the batsman is deemed out. But if the batsman and the bowler cast different numbers, then the
number cast by the batsman is added to his existing score, which is taken to be 0 at the beginning of the game. This
way, the batsman accumulates runs until he gets out. Then, it is the turn of the second player (who bowled first) to
bat now, while the first player (who batted first) bowls. The objective of the second player now is to surpass the score
made by the first player. If he succeeds, then he wins the game, otherwise the first player is the winner. If they end up
on the same score, then the game is said to have been tied. Who gets to bat or bowl first is either decided by a round
of traditional rock, paper, scissors, or by a round of odd or even, wherein the sum of the numbers that will be cast
by the two players- again each between 1 to 6- is predicted in advance by one of the players, and if he predicts right,
he gets to choose to bat or bowl first.
While the game is pretty simple to play, it lends itself to some very interesting statistical analysis. In order to
analyze the game, I assume that the game is played between two ideal players who each cast a number between 1
to 6 with equal probability 1/6. Then, the sample space, and the probability of each outcome, is the same as a pair of
dice rolled together, a problem encountered often in elementary probability textbooks. First, lets look at some trivial
calculations.

Getting out probability and average score

As mentioned earlier, the batsman is out when the batsman and bowler cast the same number. From the sample space,
it is clear that there are 6 possible ways that this can happen. This means that in any one round (henceforth called a
shot), the probability of getting out q is 1/6. Thus, the survival probability p is then 5/6. In order to get out on the nth
trial, a batsman must survive in each of the previous n 1 trials and get out on the nth trial. Thus, G(n), the probability
of getting out on the nth trial is a geometric distribution given by
G(n) = pn1 q,

(1)

with p = 5/6 and q = 1/6. The average number of shots that the batsman takes to get out is then 1/q = 6. This means
that on an average, the batsman has 5 scoring shots. On each shot, he is equally likely to score anywhere between 1 to
6 runs, which amounts to an average of 3.5 runs per shot. Thus, the average score, in a game of hand cricket is 17.5.

Score probability

Now I address the following more interesting question: What is the probability P(X) of the batsman scoring a total of
X runs in a game of hand cricket? Note that a score of X can be scored in a variety of different ways: The number of
trials n taken to score X can vary widely, so can the pattern of single-shot scores for a given number of trials. As an
illustration, the score 7 can be scored in two shots as 3+4, in three shots as 3+3+1 and so on. But, so can it be scored
1

as 5+2 in two shots and 2+2+3 in three shots. Thus any attempt to calculate P(X) must take into account the multiple
ways in which X can be scored. For higher scores, it becomes very difficult to list down every possibility by hand, but
a numerical program can solve the problem quite easily.
The philosophy is as follows. A score of X can be scored in the slowest possible way using X shots in which 1 run
is scored in each shot. Thus, the maximum number of trials required (nmax (X)) is X. It can be scored in the fastest way
by scoring 6 runs of every shot to get as close to the score as possible and then score the remaining runs in the final
shot. This means the minimum number of turns required nmin (X) is X/6 if X is a perfect multiple of 6, and X/6 + 1 if
it is not (Here / denotes integer division). Thus, we need to consider all n such that X/6 n X or X/6 + 1 n X
as the case may be. P(X, n), the probability of scoring X runs in n shots, can be found in a recursive manner as
1
1
1
(2)
P(X, n) = P(X 1, n 1) + P(X 2, n 1) + . . . + P(X 6, n 1).
6
6
6
Ultimately, the successive recursions boil down to summing suitably over the single-shot probabilities P(1, 1), . . . ,
P(6, 1) which are all of course, 16 . Then, the total probability of scoring X runs in a single innings of hand cricket P(X)
is given by
nmax (X)

P(X) =

(3)

P(X, n).

n=nmin (X)

Results

0.18

0.18

0.16

0.16

0.14

0.14

0.12

0.12

Probability

Probability

Figure 1a shows the probability P(X) of scoring X runs in a single innings of hand cricket. It is somewhat of a suprise
that the most probable score is, in fact, 0, with a probability of 16 . This amounts to getting out on the first shot itself.
Considering the non-zero scores, we see that the most probable score is 6. This is most likely an artefact of the fact
that 6 is the maximum number of runs that can be scored in a single shot. Further, since 6 can be scored in more ways
than scores of 1,2,. . .,5, it ends up having a higher probability than any of these scores. For X > 6, we see the effects
of an interesting trade-off between the increasing number of ways to score X and the decreasing probabilities of each
of these ways. As a result, the curve is a series of bumps in the region X > 6, with the bumps becoming progressively
smoother until the curve looks like a smoothly decreasing function. Each of these bumps too appear to have a width
of around 6 runs, which is again likely an artefact of the game design.

0.1
0.08

0.1
0.08

0.06

0.06

0.04

0.04

0.02

0.02

20

40

60

80

100

120

10

15

Score

Score

(b) Enlarged view of the region X [0, 20]

(a) P(X) versus X

Figure 1: Probability P(X) of scoring X runs in a single innings of hand cricket as a function of the score X.
2

20

Figure 2 shows the number of ways in which X runs can be scored in a single innings of hand cricket on a semi-log
plot. We see that there are roughly 2X ways to score X runs, as indicated by the near perfect linear fit shown in figure
2. This is a mind-boggling result: As an example, there are 1024 ways to score a paltry 10 runs, and 1.126 1015
ways to score a half-century, that is 50 runs!

160

linear fit: f(x) = 0.988*x -0.942

140
120

log2(N(X))

100
80
60
40
20
0
-20

20

40

60

80

100 120 140 160

Score X
Figure 2: Log to the base 2 of the total number of ways N(X) to score X runs in a single innings of hand cricket. A
linear fit with slope 1 shows that the number of ways to score X is roughly 2X .

Conclusion

In this article, I have analyzed the statistics of the game of hand cricket. First, we saw that the probability of getting
out in the nth trial follows a geometric distribution. From this it was trivially shown that the average number of scoring
shots before getting out is 5, and that the average score is 17.5 in a single innings of hand cricket. Next, I considered
the question of calculating the probability of scoring X runs in a single innings of hand cricket, and I presented a
recursive model for solving this problem. The most probable score is surprisingly found to be 0- a result that is borne
out by the math, but is not very intuitive. The most probable non-zero score is found to be 6, and the profile of the
probability distribution was briefly discussed. Finally, we see that the number of ways in which X runs can be scored
is 2X , which is a staggering number of possibilities for even X mathcalO(10). Thus, we see that the game of hand
cricket, just like the game of cricket itself, is bursting with numbers and statistics that provide for interesting analysis
even in the simplest case of an ideal game where the two players are just random number generators. When played
between humans who are second-guessing the opponents move at every turn, the possibilies are truly endless.

Supplementary data
Total probability and number of ways of scoring X runs in a single innings of hand cricket

Score
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73

Probability
0.166667
0.0231481
0.0263632
0.0300247
0.0341948
0.0389441
0.044353
0.027365
0.0279507
0.0281712
0.0279137
0.0270413
0.0253882
0.0227542
0.0221138
0.0213031
0.0203492
0.0192986
0.0182232
0.0172281
0.0164605
0.0156754
0.0148937
0.014136
0.013419
0.0127518
0.0121301
0.0115286
0.0109527
0.0104053
0.00988715
0.00939661
0.00893061
0.00848625
0.00806369
0.00766245
0.00728149
0.0069196
0.00657557
0.00624848
0.00593768
0.0056424
0.00536184
0.00509522
0.00484183
0.00460103
0.00437222
0.0041548
0.00394819
0.00375184
0.00356527
0.00338796
0.00321948
0.00305938
0.00290724
0.00276266
0.00262528
0.00249472
0.00237066
0.00225277
0.00214074
0.00203428
0.00193312
0.00183699
0.00174563
0.00165882
0.00157633
0.00149794
0.00142345
0.00135266
0.00128539
0.00122147
0.00116073
0.00110301

Number o f Ways
1
1
2
4
8
16
32
63
125
248
492
976
1936
3840
7617
15109
29970
59448
117920
233904
463968
920319
1 . 8 2 5 5 3 e +06
3 . 6 2 1 0 9 e +06
7 . 1 8 2 7 3 e +06
1 . 4 2 4 7 5 e +07
2 . 8 2 6 1 2 e +07
5 . 6 0 5 8 4 e +07
1 . 1 1 1 9 6 e +08
2 . 2 0 5 6 7 e +08
4 . 3 7 5 1 4 e +08
8 . 6 7 8 4 4 e +08
1 . 7 2 1 4 4 e +09
3 . 4 1 4 6 2 e +09
6 . 7 7 3 1 8 e +09
1 . 3 4 3 5 2 e +10
2 . 6 6 4 9 8 e +10
5 . 2 8 6 2 e +10
1 . 0 4 8 5 6 e +11
2 . 0 7 9 9 1 e +11
4 . 1 2 5 6 7 e +11
8 . 1 8 3 6 2 e +11
1 . 6 2 3 2 9 e +12
3 . 2 1 9 9 3 e +12
6 . 3 8 6 9 9 e +12
1 . 2 6 6 9 1 e +13
2 . 5 1 3 0 3 e +13
4 . 9 8 4 8 e +13
9 . 8 8 7 7 5 e +13
1 . 9 6 1 3 2 e +14
3 . 8 9 0 4 4 e +14
7 . 7 1 7 e +14
1 . 5 3 0 7 3 e +15
3 . 0 3 6 3 3 e +15
6 . 0 2 2 8 2 e +15
1 . 1 9 4 6 8 e +16
2 . 3 6 9 7 4 e +16
4 . 7 0 0 5 7 e +16
9 . 3 2 3 9 7 e +16
1 . 8 4 9 4 9 e +17
3 . 6 6 8 6 1 e +17
7 . 2 7 7 e +17
1 . 4 4 3 4 5 e +18
2 . 8 6 3 2 1 e +18
5 . 6 7 9 4 1 e +18
1 . 1 2 6 5 6 e +19
2 . 2 3 4 6 2 e +19
4 . 4 3 2 5 6 e +19
8 . 7 9 2 3 4 e +19
1 . 7 4 4 0 3 e +20
3 . 4 5 9 4 4 e +20
6 . 8 6 2 0 8 e +20
1 . 3 6 1 1 5 e +21
2 . 6 9 9 9 5 e +21

Score
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149

Probability
0.000946498
0.00089943
0.000854701
0.000812197
0.000771807
0.000733426
0.000696953
0.000662294
0.000629358
0.00059806
0.000568319
0.000540057
0.0005132
0.000487679
0.000463427
0.000440381
0.000418481
0.00039767
0.000377894
0.000359102
0.000341244
0.000324274
0.000308148
0.000292824
0.000278262
0.000264424
0.000251274
0.000238779
0.000226904
0.00021562
0.000204898
0.000194708
0.000185025
0.000175824
0.000167081
0.000158772
0.000150876
0.000143373
0.000136243
0.000129468
0.00012303
0.000116911
0.000111097
0.000105573
0.000100322
9 . 5 3 3 3 5 e 05
9 . 0 5 9 2 6 e 05
8 . 6 0 8 7 5 e 05
8 . 1 8 0 6 4 e 05
7 . 7 7 3 8 2 e 05
7 . 3 8 7 2 3 e 05
7 . 0 1 9 8 7 e 05
6 . 6 7 0 7 7 e 05
6 . 3 3 9 0 4 e 05
6 . 0 2 3 8 e 05
5 . 7 2 4 2 4 e 05
5 . 4 3 9 5 8 e 05
5 . 1 6 9 0 7 e 05
4 . 9 1 2 0 1 e 05
4 . 6 6 7 7 4 e 05
4 . 4 3 5 6 2 e 05
4 . 2 1 5 0 4 e 05
4 . 0 0 5 4 2 e 05
3 . 8 0 6 2 4 e 05
3 . 6 1 6 9 5 e 05
3 . 4 3 7 0 8 e 05
3 . 2 6 6 1 6 e 05
3 . 1 0 3 7 4 e 05
2 . 9 4 9 3 9 e 05
2 . 8 0 2 7 2 e 05
2 . 6 6 3 3 4 e 05
2 . 5 3 0 8 9 e 05
2 . 4 0 5 0 3 e 05
2 . 2 8 5 4 3 e 05

Number o f Ways
2 . 1 0 7 2 1 e +22
4 . 1 7 9 8 2 e +22
8 . 2 9 1 0 2 e +22
1 . 6 4 4 5 9 e +23
3 . 2 6 2 1 9 e +23
6 . 4 7 0 8 2 e +23
1 . 2 8 3 5 4 e +24
2 . 5 4 6 0 1 e +24
5 . 0 5 0 2 2 e +24
1 . 0 0 1 7 5 e +25
1 . 9 8 7 0 6 e +25
3 . 9 4 1 5 e +25
7 . 8 1 8 2 8 e +25
1 . 5 5 0 8 2 e +26
3 . 0 7 6 1 8 e +26
6 . 1 0 1 8 6 e +26
1 . 2 1 0 3 5 e +27
2 . 4 0 0 8 4 e +27
4 . 7 6 2 2 6 e +27
9 . 4 4 6 3 4 e +27
1 . 8 7 3 7 6 e +28
3 . 7 1 6 7 6 e +28
7 . 3 7 2 5 e +28
1 . 4 6 2 4 e +29
2 . 9 0 0 7 8 e +29
5 . 7 5 3 9 5 e +29
1 . 1 4 1 3 4 e +30
2 . 2 6 3 9 5 e +30
4 . 4 9 0 7 3 e +30
8 . 9 0 7 7 3 e +30
1 . 7 6 6 9 2 e +31
3 . 5 0 4 8 4 e +31
6 . 9 5 2 1 4 e +31
1 . 3 7 9 0 1 e +32
2 . 7 3 5 3 9 e +32
5 . 4 2 5 8 7 e +32
1 . 0 7 6 2 7 e +33
2 . 1 3 4 8 6 e +33
4 . 2 3 4 6 8 e +33
8 . 3 9 9 8 3 e +33
1 . 6 6 6 1 8 e +34
3 . 3 0 5 e +34
6 . 5 5 5 7 4 e +34
1 . 3 0 0 3 9 e +35
2 . 5 7 9 4 2 e +35
5 . 1 1 6 5 e +35
1 . 0 1 4 9 e +36
2 . 0 1 3 1 4 e +36
3 . 9 9 3 2 2 e +36
7 . 9 2 0 8 9 e +36
1 . 5 7 1 1 7 e +37
3 . 1 1 6 5 5 e +37
6 . 1 8 1 9 4 e +37
1 . 2 2 6 2 4 e +38
2 . 4 3 2 3 5 e +38
4 . 8 2 4 7 6 e +38
9 . 5 7 0 3 2 e +38
1 . 8 9 8 3 5 e +39
3 . 7 6 5 5 4 e +39
7 . 4 6 9 2 6 e +39
1 . 4 8 1 5 9 e +40
2 . 9 3 8 8 6 e +40
5 . 8 2 9 4 6 e +40
1 . 1 5 6 3 2 e +41
2 . 2 9 3 6 6 e +41
4 . 5 4 9 6 7 e +41
9 . 0 2 4 6 4 e +41
1 . 7 9 0 1 1 e +42
3 . 5 5 0 8 4 e +42
7 . 0 4 3 3 8 e +42
1 . 3 9 7 1 1 e +43
2 . 7 7 1 2 9 e +43
5 . 4 9 7 0 8 e +43
1 . 0 9 0 3 9 e +44

74
75

0.00104815
0.000996031

5 . 3 5 5 5 8 e +21
1 . 0 6 2 3 2 e +22

150

2 . 1 7 1 7 8 e 05

2 . 1 6 2 8 8 e +44