Introduction

In this article, we explore optimal batting orders in the one-day cricket scene. A common theme
in these articles is that teams would be better served by scoring at a higher rate early in the
innings. Simply view a team's scoring results in different batting orders and choose the batting
order that produces the highest number of runs in a play. Our approach to optimal closing is
based on simulation where we can generate the number of runs recorded per turn in any
recommended batting order.

The generation of cricket runs in a day is facilitated by the fact that there is a minimum number
of batting results on any given ball thrown in and a smaller number of balls. Surprisingly, the
simulation techniques in one-day cricket are still not fully explored. Non-geometrically
distributed wood for individual runs scored based on results from test cricket. Kimber and
Hansford argued against geometric distributions and obtained probabilities for individual score
ranges selected in cricket using a product bounds estimator.

We simulate matches against an average opponent by first estimating the batting

characteristics of team members based on their detailed performance in previous matches. Once
the simulation technique has been developed, we turn to the problem of determining the optimal
or near-optimal batting order at the start of a team's first inning. In Part 2, we explain the basic
characteristics of one-day cricket with specific emphasis on how runs are scored. In Part 3, we
describe a simple simulation technique that generates first sets of runs on a ball-by-ball basis.

One day cricket basics

An exception to this is that the second team stops hitting the ball whenever their score exceeds
that of the first team. Conventional wisdom now puts the hitter 'poor' at the end of the batting
order, and the team always scores 300 runs in the first inning because the first partnership is
still intact, scoring 1 run on each handball. However, if we put the bad hitter at the top of the
batting order, the expected number of runs the team scored in the first turn is + + + + · · + 300
+ 300 ≈ 304.

Simulation In this run

, we look at simulating first inning runs for a particular batting order. For the sake of simplicity,
we investigate the first run because the second batting team's batting strategy depends on the
first batting team's number of runs.

To estimate q1, we look at first inning results from 239 ODI games
dating back to May

Over these 239 games, we calculate q̂1 as the total number of runs awarded as wideball or
zero in turn divided by the total number of balls thrown in these first innings.

Powered by TCPDF (www.tcpdf.org)