Accessible Unlicensed Requires Authentication Published by De Gruyter November 5, 2010

Reformed Permutations in Mousetrap and Its Generalizations

Alberto Maria Bersani
From the journal

Abstract

We study a card game called Mousetrap, together with its generalization He Loves Me, He Loves Me Not. We first present some results for the latter game, based, on one hand, on theoretical considerations and, on the other one, on Monte Carlo trials. Furthermore, we introduce a combinatorial algorithm, which allows us to obtain the best result at least for French card decks (52 cards with 4 suits). We then apply the algorithm to the study of Mousetrap and Modular Mousetrap, improving recent results. Finally, by means of our algorithm, we study the reformed permutations in Mousetrap, Modular Mousetrap and He Loves Me, He Loves Me Not, attaining new results which give some answers to several questions posed by Cayley and by Guy and Nowakowski in their papers.

Received: 2009-07-23
Revised: 2010-04-07
Accepted: 2010-06-05
Published Online: 2010-11-05
Published in Print: 2010-November

© de Gruyter 2010