Mathematical and Physical Journal
for High Schools
Issued by the MATFUND Foundation
 Already signed up? New to KöMaL?

# Problem A. 646. (May 2015)

A. 646. Ginger and Rocky play the following game. First Ginger hides two bones in the corners of a rectangular garden. She may dig 45 cm deep altogether, that is, she may either hide the two bones in two different corners, where the sum of their depths may be at most 45 cm, or she may hide them in the same place, both bones at a maximum depth of 45 cm. She levels the ground carefully so that it is impossible to see where she has dug. Then Rocky may dig holes with a total depth of 1 m. Rocky's goal is to maximize the probability of finding both bones, while Ginger's goal is to maximize the probability of keeping at least one for herself.

$\displaystyle (a)$ Show that if Ginger plays well she can achieve a probability of more than $\displaystyle 1/2$ for at least one bone remaining hidden, independently of Rocky's search strategy.

$\displaystyle (b)$ What are the chances of Ginger's success if both dogs play optimally?

Proposed by: Endre Csóka, Warwick

(5 pont)

Deadline expired on June 10, 2015.

### Statistics:

 3 students sent a solution. 4 points: Janzer Barnabás. 0 point: 2 students.

Problems in Mathematics of KöMaL, May 2015