Authors: Mattia Furlin
In this short article, we will discuss a card game, from now on namely Solitaire modulo 3. After having described how it works, through a probabilistic calculation, we will arrive at determining the probability of victory. In particular, we will use the rook polynomials, which will allow us to finally obtain a closed form for calculating the probability of winning at Solitaire modulo 3. Finally, we will study the case where the number of cards in play is much more greater than the number of constraints present in the game format. Under this assumption, the Solitaire modulo 3 mechanism becomes asymptotically equivalent to a binomial distribution.
Comments: 5 Pages.
Download: PDF
[v1] 2026-01-22 21:20:43
Unique-IP document downloads: 201 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.