Linux and UNIX Man Pages

Linux & Unix Commands - Search Man Pages

dealer(6) [debian man page]

DEALER(6)							User Documentation							 DEALER(6)

NAME
dealer - bridge hand generator SYNOPSIS
dealer [-023ehuvmqV] [-p n] [-g n] [-s seed] [-l n] [inputfile] DESCRIPTION AND EXAMPLE
The program dealer can be used to generate hands for partnerships bidding training or for generating statistics that can be used to design conventions, or win postmortems. Running the program involves 3 steps. First, the user has to write an input file containing hand-descriptions and action. A very simple example would look something like: condition shape(north, any 4333 + any 4423) and hcp(north)>=19 action printall The first line specifies a condition for the north hand, in this case, a hand with 4333 or 4432 shape and at least 19 high card points. The second line tells the program to print the 4 hands. The program reads from standard input, so in principle, it is possible to enter the conditions directly into the program. Using a file is a lot more practical though, as it allows the user to re-use conditions and fine-tune the conditions. Then the program has to be run, it reads the file, looks at the various command line switches and then produces a number of hands. The output appears on the screen but can be re-directed to a file. Finally, the user has to look at output and analyze the produced hands. Alternatively, the output can be used for a playing program. OPTIONS
-e Exhaust mode (alpha version). -g number Maximum number of hands to generate (default is 1000000). -l number Instead of shuffling, deals are read from the file library.dat by M. Ginsberg (see [1]). When using this, the tricks() function is quite fast and bridge.exe from GIB is not used. [1] ftp://ftp.cirl.uoregon.edu/pub/users/ginsberg/bridge/ -m Shows a progress meter. -p number Maximum number of hands to produce (default is 40). -q Suppress PBN output (useful for testing, then switch it back on when generating the "final" sample). -s number Uses number as the seed for the random generator, running the program twice with the same seed will produce the same sequence of hands. -u Select uppercase for the symbols "AKQJT" (default is lowercase). -v Toggle verbose output, prints statistics at the end of the run (default is on). -V Emit a version-identification string and exit. -h Help, prints the syntax. -0 No swapping, each deal is generated normally (shuffling) (default). -2 2-way swapping, after each shuffle another deal is generated by permuting E and W, leaving N and S in place (NB: not fully compatible with predeal). -3 3-way swapping, after each shuffle another 5 deals are generated by permuting E, W, and S every which way, leaving N in place (NB: not fully compatible with predeal). BUGS
I would prefer if you did not use this program for generating hands for tournaments. I have not investigated the random number generation closely enough for me to be comfortable with that thought. SEE ALSO
/usr/share/doc/dealer/Manual, dealer.dpp(6), deal(6). AUTHORS
Hans van Staveren <sater@sater.home.cs.vu.nl> Henk Uijterwaal <henk@ripe.net> Manpage: Christoph Berg <cb@df7cb.de> COPYRIGHT AND LICENSE
This program is hereby put in the public domain. Do with it whatever you want, but I would like you not to redistribute it in modified form without mentioning the fact of modification. I will accept bug reports and modification requests, without any obligation of course, but fixing bugs someone else put in is beyond me. Dealer 2012-03-04 DEALER(6)

Check Out this Related Man Page

CRIBBAGE(6)							 BSD Games Manual						       CRIBBAGE(6)

NAME
cribbage -- the card game cribbage SYNOPSIS
cribbage [-eqr] DESCRIPTION
cribbage plays the card game cribbage, with the program playing one hand and the user the other. The program will initially ask the user if the rules of the game are needed - if so, it will print out the appropriate section from According to Hoyle with more(1). cribbage options include: -e When the player makes a mistake scoring his hand or crib, provide an explanation of the correct score. (This is especially useful for beginning players.) -q Print a shorter form of all messages - this is only recommended for users who have played the game without specifying this option. -r Instead of asking the player to cut the deck, the program will randomly cut the deck. cribbage first asks the player whether he wishes to play a short game ( ``once around'', to 61) or a long game ( ``twice around'', to 121). A response of 's' will result in a short game, any other response will play a long game. At the start of the first game, the program asks the player to cut the deck to determine who gets the first crib. The user should respond with a number between 0 and 51, indicating how many cards down the deck is to be cut. The player who cuts the lower ranked card gets the first crib. If more than one game is played, the loser of the previous game gets the first crib in the current game. For each hand, the program first prints the player's hand, whose crib it is, and then asks the player to discard two cards into the crib. The cards are prompted for one per line, and are typed as explained below. After discarding, the program cuts the deck (if it is the player's crib) or asks the player to cut the deck (if it's its crib); in the latter case, the appropriate response is a number from 0 to 39 indicating how far down the remaining 40 cards are to be cut. After cutting the deck, play starts with the non-dealer (the person who doesn't have the crib) leading the first card. Play continues, as per cribbage, until all cards are exhausted. The program keeps track of the scoring of all points and the total of the cards on the table. After play, the hands are scored. The program requests the player to score his hand (and the crib, if it is his) by printing out the appro- priate cards (and the cut card enclosed in brackets). Play continues until one player reaches the game limit (61 or 121). A carriage return when a numeric input is expected is equivalent to typing the lowest legal value; when cutting the deck this is equivalent to choosing the top card. Cards are specified as rank followed by suit. The ranks may be specified as one of: 'a', '2', '3', '4', '5', '6', '7', '8', '9', 't', 'j', 'q', and 'k', or alternatively, one of: 'ace', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight', 'nine', 'ten', 'jack', 'queen', and 'king'. Suits may be specified as: 's', 'h', 'd', and 'c', or alternatively as: 'spades', 'hearts', 'diamonds', and 'clubs'. A card may be specified as: ``<rank> <suit>'', or: ``<rank> of <suit>''. If the single letter rank and suit designations are used, the space separating the suit and rank may be left out. Also, if only one card of the desired rank is playable, typing the rank is sufficient. For example, if your hand was ``2H, 4D, 5C, 6H, JC, and KD'' and it was desired to discard the king of diamonds, any of the following could be typed: 'k', 'king', 'kd', 'k d', 'k of d', 'king d', 'king of d', 'k diamonds', 'k of diamonds', 'king diamonds', 'king of diamonds'. FILES
/usr/games/cribbage /var/games/criblog /usr/share/games/cribbage.instr AUTHORS
Earl T. Cohen wrote the logic. Ken Arnold added the screen oriented interface. BSD
May 31, 1993 BSD
Man Page