Bridge double dummy solver
- Java 100%
| build/libs | ||
| src | ||
| .gitignore | ||
| build.gradle | ||
| CLAUDE.md | ||
| Opening1M.lin | ||
| README.md | ||
| settings.gradle | ||
This program that finds the best possible bridge hands given a specific set of cards. It will go through all possible hands.
n the lower right corner there is a list of how many tricks NS or EW can take depending on which trump and if you play without a trump (N). When it says NS, the result is the same whether North or South is declarer, but when it says E or W on different rows, the result is different depending on who is declarer. East can take 8 tricks without a trump but West only 7.