The nondeterministic polynomial (NP) class of problems are those for which resource requirements scale exponentially in relation to input data size, but for which a solution can be verified in polynomial (non-exponential time). An interesting feature of the NP problem set is that while it is proven that a polynomial time algorithm exists to transform any problem (say optimum graph traversal, or bin packing) in to any other in the set—that is solving any one of them in polynomial time solves them all—no such polynomial-time solution has been found; but there is no proof either way as to whether one may or may not exist. In research funded by the Australian Cricket Foundation in regard to a novel problem (finding the optimum mix of sporting content to fill the remainder of a five-day cricket “test match” schedule when the actual match ends in fewer than three days—the so-called Batting Collapse Problem) this group proposes a polynomial time algorithm that solves BCP and a tentative proof that BCP ∈ NP. In this paper we