Two persons are dividing a piece of cheese. The first person cuts it into two pieces, then the second person cuts one of these pieces into two, then again the first person cuts one of the pieces into two, and so until they have 5 pieces. After that the first person chooses one of the pieces, then the second person chooses one of remaining pieces and so on until all pieces are taken. For each of the players, what is the maximal amount of cheese he can get for certain, regardless of the other's actions?
Problem
Source: Tournament of towns, Junior A-Level paper, Fall 2004
Tags: combinatorics unsolved, combinatorics