Skip to content

Releases: dds-bridge/dds

v1.1.16

25 Nov 13:03
Compare
Choose a tag to compare
  • DDS 1.1.16 adds Mingw compiled DLLs and makes a number of code improvements.
  • The 1.1.16 Mingw DLLs are about 5% faster than the 1.1.15 DLLs.

When using Mingw DDS DLLs, supporting DLLs need to be present in the same folder where the DDS DLL is situated. Those DLLs implement functions used by the DDS DLL. They are included in the Mingw C++ compiler package which can be downloaded from the Mingw main site.

For convenience, the "supporting DLLs" are available in this release as dds1116-supporting-dlls.zip

v1.1.15

25 Nov 13:03
Compare
Choose a tag to compare
  • DDS 1.1.15 is about 7% faster than 1.1.14.
  • Fixed case where rel table missed initialization for absRank and relRank when all cards in a suit are missing.

v1.1.14

25 Nov 13:03
Compare
Choose a tag to compare
  • Corrected fault in using the Windows function to detect RAM memory size that could cause DDS termination.

v1.1.13

25 Nov 13:05
Compare
Choose a tag to compare
  • 1.1.13 is 5-10% faster than 1.1.12.
  • DDS used a deficient function in Windows to detect RAM memory size, which could cause too few threads to be allocated. DDS now uses a correct Windows function to detect the RAM size.

v1.1.12

25 Nov 13:03
Compare
Choose a tag to compare
  • 1.1.12 is about 15-20% faster than 1.1.11.
  • 2 new callable functions have been added: SolveBoardPBN and CalcDDtablePBN. They both accept PBN format for the remaining cards in the deal information instead of the bit codes.
  • Code improvements have been done concerning quick tricks detection and move ordering.

v1.1.9

25 Nov 13:05
Compare
Choose a tag to compare
  • Speed increase 10-15% compared to 1.1.8.
  • Much faster initialization of variable rel struct type relRanksType. Implementation done by Thomas Andrews.
  • If the hand-to-play is trick leading hand, the first positions in the move list now come each from a different suit. (In 1.1.8, the first positions were groups of 2 cards from each suit.)
  • DismissX renamed to NextMove. A bug was corrected in NextMove, increasing performance. (The bug was found by Joël Bradmetz, although it did not give incorrect result.)
  • The function CountOnes replaced by a table look up. Implementation by Thomas Andrews.
  • The handStore variable was replaced by a macro. Based on an implementation by Thomas Andrews.
  • The WinAdapt function was replaced by a table look up.
  • A new table highestRank gives the highest rank from a bitmap of ranks. Makes functions UpdateWinner, UpdateSecondBest and QuickTricks slightly faster.