For a given deal of cards, the simulator performs an arbitrary number of random matches of some card games.
At present, two Italian card games are implemented, Tressette and Beccaccino. Tressette
and
Beccaccino
are somewhat similar to other card games such as Whist, Spades and Hearts.
The simulator below computes the frequency distribution of the scores.
The moves are consistent with the rules of the games and are determined randomly. Artificial Intelligence is not implemented yet.
The simulator can help answer questions such as:
What would the score have been if another trump was picked?
What was the minimum/maximum possible score for the given deal?
What would the score have been if another player started the game?
How could a small variation of the deal have affected the score?
INPUT
Insert the number of cards per suit [3-13]:
Choose the game:
The couples are Player 0 - Player 2 and Player 1 - Player 3.
Insert the card numbers in the table below for each player and each suit (the first index of each suit is 1).
It doesn't matter what and how many characters you use between the numbers.
It doesn't even matter the order in which you write down the numbers.
Player 0
hide
a (spade)
b (bastoni)
c (coppe)
d (denari)
Player 1
hide
a (spade)
b (bastoni)
c (coppe)
d (denari)
Player 2
hide
a (spade)
b (bastoni)
c (coppe)
d (denari)
Player 3
hide
a (spade)
b (bastoni)
c (coppe)
d (denari)
In the Beccaccino case, choose the trump for the match (set by Player 0):
The maximum number of matches with this number of cards is
(then in the Beccaccino case multiply by the number of suits to account for the choices of the trump)
The number of possible card deals is
The score of a match goes from 0 to
OUTPUT
number of matches:
Score distribution for the couple Player 0 - Player 2
Enable text output (check it only for debugging purposes)