cddsolve project is a double dummy bridge solver.
It utilizes alpha-beta pruning and minimax searching to find the number of tricks a given side can take under the assumption of optimal play.
While the complexity of the problem may be enormous depending on the given deal and contract, cddsolve is fast enough to be actually helpfull for many double dummy bridge problems.
cddsolve has an predecessor called ddsolve which is implemented in python and also available on this page.
ddsolve is considered to be a prototypical implementation to demonstrate the basic algorithms and quantify the impact of different optimizations.
What's New in This Release:
· cleaned up the preprocessor macros and added some bogus return values to make recent gccs happy.
· incremented the TPBUCKETCOUNT in ddtranspos.c, trading computational speed against memory footprint. shoe size is about 10mb larger now.
· released 0.9.