Skull and Roses is a game of bluff played with 2 kind of cards: skulls and roses. The players successively place hidden cards on their own pile till one of them bets. The bet consists in announcing how many roses you think that you can reveal without encountering a skull in the process. After a bet isset, as in poker, the other players can either pass (definitively) or bet higher, if the challenger meet his bet, he wins one point, otherwise he looses one card.In our study, we introduce the game, compare its structure with other classical games, and show its interest from a computer science point of view. Then we describe the game in a formalway, in order to obtain boundaries and average values on the game length, state-space size, and the game tree size. We also provide more analytical results and data to improve future studyof the game.