Leiden University logo.

nl en

Thomas de Mol

‘I am a student Mathematics and Computer Science and my bachelor project was about the game Cherries. This is a two-player game in which the players repeatedly remove cherries of their own colour of a segment of black and white cherries. Played as a combinatorial game (players alternate taking turns), there is a simple method for determining the winner of any Cherries game. However, if we play Cherries as a synchronised game (the players pick their cherries at the same time), this is not the case.'

Why can you determine the winner of a Cherries game in some cases and in other cases not?

Analysing the game

'In my thesis, I first analysed a simpler version of Cherries called Stack Cherries. This game behaves very nicely in the synchronised world. I laid out an efficient method for determining the winner of any synchronised Stack Cherries game. Afterwards, I proposed the winner of any synchronised Cherries game can be found by reducing it to a Stack Cherries game. However, the proof of this reduction is still incomplete.

Continuing the research

Together with my supervisors we currently are trying to complete the proof on the reduction from Cherries to Stack Cherries. When this is figured out we hope our results can be published.’

This website uses cookies.