One-click analysis every bid and every card played during a game
using the new URL-schema to specify simulations

NEW! The probabilistic problem of the bridge player !NEW
or `What is the point of this site'

			NORTH
				MIN	MAX
			HONOR POINTS:
WEST						EAST
	MIN	MAX					MIN	MAX
HONOR POINTS:						HONOR POINTS:
			SOUTH
				MIN	MAX
			HONOR POINTS:

Enter known cards and properties of each hand. Enter for example: AT67 at of NORTH to say that you know that north has the ace, the ten, the 6 and the 7 of spades. Use A,K,Q and J for the honor cards. To say that you know positively that north does not have another spade enter both a min and a max of 4, except if you enter all the cards in north's hand.

Click the button below to compute the probabilities for each card to be in each hand, each hand to have any length in any colour or any number of honour points.

Contact me if you encounter any problem or if you have any suggestion on how this site might be improved.

Source code for this application is available here under the GNU GPL. An explanation of the principle after which this calculator works is here.

NUMBER OF TRIES:

10,000 20,000 50,000 100,000 200,000