Bridge double dummy solver
Find a file
2026-02-15 08:28:49 +01:00
build/libs touch jar 2026-02-13 15:00:50 +01:00
src some minor changes 2026-02-15 08:28:49 +01:00
.gitignore initial commit 2026-02-13 14:33:17 +01:00
build.gradle make runnable jar 2026-02-13 14:58:49 +01:00
CLAUDE.md initial commit 2026-02-13 14:33:17 +01:00
Opening1M.lin initial commit 2026-02-13 14:33:17 +01:00
README.md initial commit 2026-02-13 14:33:17 +01:00
settings.gradle initial commit 2026-02-13 14:33:17 +01:00

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.