一栗仆直/契約界限 Border of Contact

從 Luzi82_wiki

跳到: 導航, 搜尋

目錄

Current State

The program is now able to solve the 9 cards game in a reasonable time. However, more effort should be put to make the program solve 13 cards game quickly.

This project is now suspended for a while. Luzi have been enough of it... He wanna start playing bridge in order to get more idea for this project.

Technique

Alpha-beta pruning

Alpha-beta pruning in Wikipedia

Case storage

The program would store cases in memory in order to speed up the process.

Equivalent card negligent

Relative cards are the card which the values are closed. For example, C7,8,9,T.

Relative cards have the same effect. So when they are on one hand, we only consider one of them.

Notice that when C3,4,5,6,7,8,9 are out, C2 and CT should be considered as the relative cards too.

It help to ignore some cards and speed up the process.

Equivalent case negligent

For example, when there is C2,4,5,7 on the table, the result will not be affected when we exchange them by C2,3,4,5, or CJ,Q,K,A.

Non-trump suit are equivalent: when two of non-trump suit are exchanged, the result would not be affected.

It helps to reduce the size of the database, it also help to solve equivalent cases quickly.

TODO

  • Minimum win/lose trick estimation
  • Make it human-useable

License

The software is under GPL

Source

svn co svn://luzi82.servehttp.com/wings/BridgePath/trunk/BridgePath

Reference

Building a Fast Double-Dummy Bridge Solver

個人工具