If you want to offer me a job please write me.

Bridge studio

Introduction.

This program is fast and powerful solver of bridge double dummy problems and preference (Russian card game, sometimes found in an online casino) problems solver. The basic features are
  • full tree investigation to the end, the solver always will find the exact solution, which includes best move and number of tricks in optimal game for [north/south] and [east/west]
  • option of estimation of all moves. Program can estimate not only best move, but all other moves and show number of tricks for them.
  • one can setup not only double dummy problems, but problems with any number of cards, for example double dummy problem without very first turn
  • loading problems from pbn (portable bridge notation) files
  • loading problems from *.txt,*.dat files which were stored by deep finesse.
  • save problem to html file in ansi or unicode formats for publication on the web, or add the problem to the existing html file
  • save/add problem to html file with best move and/or number of tricks in optimal game
  • skin support
  • the solver will find the second, third etc moves much faster than the first one, because of storing positions which already have been calculated
  • multilanguage support, english and russian interfaces are available now. You can add some other languages by creating new language file
  • one can download problems library which uncludes about 840 of double dummy problems. The library creating from double dummy corner webpage of Hugh Darwen. download bridge double dummy problems archive
Please be free to write me.

Screenshot

Click on the picture to see it with a whole size.
small screenshot

Interface language

By default language of the interface is english. There are russian and english languages available at the moment. You can manipulate by the language using Options/load language file submenu. Language is stored in special lng file which has simple format. So if you want to add new language please create your own lng file and send it to me
Note Current language will be stored automatically on exit.

Setup new problem

To setup new problem select menu item Problem/New or press Ctrl N. After it all of the cards will be on the West. Now click on the cards which you want to move to the north. When north will have 13 cards click on the cards which you want to move to the east. Finally click on the cards which you want to move to the south. If you click on the card which has north, east or south then card will move to the west. As well you can drag the cards to north, east, south or to the absent region. After it setup trump or non-trump game by clicking on the picture of trump and player who will make first move by clicking on the arrow on the table. If the first move already have done then drag current card to inner rectangle. An arrow in the inner rectangle will show on the next player. You can do the second move etc.
Note. It's possible to setup the problem where each player have 1..13 cards. For example each player can have 8 cards or it's possible to setup double dummy problem with no first very first turn.
If you press ctrl+left mouse button then the card move to the player to whom you move last card. Let you need drag cards 2 3 9 10 6 to north. You can drag every card to north, but it's possible to do it easier. Drag 2 of spades to north, after point to 3 of diamonds and press ctrl+left mouse button. 3 will go to north. The same you can do with other cards.

Problem analysis

Press button or click right mouse button to find best move. The solver will show you best move, time of calculation, number of tricks for each side if they will play optimally. Now you can press or right mouse button second time or do the move yourself, by dragging the card from current player to inner rectangle. You can undo the moves, just click on the inside card. One can undo several moves by clicking on the not very last card. There are helpful buttons undo all, undo, redo, redo all.

Problem edit

One can change all problem parameters such as trump, card position in the middle of the game. Press menu problem/edit problem. After it you can move cards, change trump and first turn.

Estimate all turns

This feature is very useful for problem analisys. The option is in option menu and has five possibilities.
  • don't rate turns - Computer finds best move and will not estimate any turns.
  • rate only best turn (partial tricks) - Computer finds best move and shows estimation of best turn and all other cards with the same sequence. Tricks which current side already has taken will not be added to estimation.
  • rate only best turn (total tricks) - Computer finds best move and shows estimation of best turn and all other cards with the same sequence. Tricks which current side already has taken will be added to estimation.
  • rate all turns (parital tricks) - Computer finds best move and shows estimation of all possible moves. Tricks which current side already has taken will not be added to estimation. It's take time to estimate all possible moves.
  • rate all turns (total tricks) This options is used by default. - Computer finds best move and shows estimation of all possible moves. Tricks which current side already has taken will be added to estimation. It's take time to estimate all possible moves.

Autoplay modes

One can setup autoplay mode using menu options/autoplaymodes.
  • never - program will never do moves automatically
  • sequences - program plays automatically if all possible turns are in sequence

Browse pbn and deep finesse files

The solver has feature load the problems from pbn (portable bridge notation) or deep finesse files. Pbn format is the international standart for bridge notation. Usually pbn file includes several double dummy problems. If you'll browse pbn file the solver show you dialog panel which includes number of the problems in the file. The dialog has first/last next/previous buttons for navigation. Current problem is showed in the main window. Chose the problem which you want to solve and close the dialog.

Save/Add problem to html file

This option is useful for publication problems in the internet, and for printing. It's possible to store problem using ansi or unicode format. If you use ansi format and want to publish problem don't forget copy pictures . The advantage of storing using unicode format is that you don't need use pictures, the language will be correctly displayed on every computer as well.

problem102
trump
saved by bridge studio
North
A 8 5 4
A 7 6 5 4 3
2
3 2
WestEast
Q J 7 6 -
-  7 K Q J 10 9 8
K Q J 10 9 8 7
K Q J 10 9 8 A 6
South
K 10 9 3 2
2
A 6 5 4 3
5 4
When the solver stores the problem it's add html-tag <p> to file, for example, for this problem it's add <p id=102> to html file. So you can refer to task. You can store the problem with best move and/or number of tricks in optimal game. Below you can see the same problem, but stored with best move and number of tricks.

problem102
trump
best move 3
tricks8/5
saved by bridge studio
North
A 8 5 4
A 7 6 5 4 3
2
3 2
WestEast
Q J 7 6 -
-  7 K Q J 10 9 8
K Q J 10 9 8 7
K Q J 10 9 8 A 6
South
K 10 9 3 2
2
A 6 5 4 3
5 4
Note. If you store the problem with best move or with number of tricks then you should wait until program find best move. It can take some time.

If you want to store more than one problem to one html file you should use menu item problem/add problem to html file and select required html file.

Useful links with problems

  • The link includes a lot of problems, in addition all of them have exact estimation, description and difficulty level from 1 to 8. Hugh Darwen homepage
  • You can download problems library which uncludes about 840 of double dummy problems with howework and difficulty rate. The library creating from double dummy corner webpage of Hugh Darwen. download bridge double dummy problems archive

    Versions history

    Version 1.0 15 january 2003
    Version 1.0116 january 2003
    Version 1.1 5 february 2003
    Version 1.2 28 april 2003
    Version 2.0 2 june 2003
    Version 2.1 16 june 2003
    Version 2.2 1 july 2003
    Version 2.3 18 july 2003
    Version 2.4 3 september 2003
    Version 2.5 4 november 2003
    Version 2.6 7 february 2005
    Version 2.7 1 october 2006
    Version 2.8 31 october 2006
    Version 2.9 9 december 2006
    Version 2.1014 march 2007
    Version 2.1130 march 2007
    Version 2.1231 may 2007
    Version 2.134 july 2007
    Version 2.1417 july 2007
    Version 2.1530 july 2007
    Version 2.1616 august 2007
    Version 2.1713 december 2007
    Version 2.1826 april 2008
    Version 2.1910 june 2008