Files
ioccc/2004/burley
Landon Curt Noll ecabb73bf6 add tools to compare entry's manifest with its files
Added `bin/bin/tar-entry.sh` to build a compressed tarball for an
entry.  The compressed tarball is formed by gnu tar with options
so that the same entry file content will always produce the same
compressed tarball, byte for byte.

As some files are missing from some entries, one should
use the `-W` option as in:

```sh
bin/tar-entry.sh -v 5 -W 2020/ferguson1
```

Added `make form_entry_tarball` to the top level `Makefile`
to build entry tarballs even when files are still missing.

Added `make verify_entry_files` to verify that all entries have all
of their files listed in their manifest, plus the top level ioccc.css
and var.mk files.  As file entry files are still missing (due to
HTML files that need to be built), the overall `make quick_www` and
`make www` do **NOT** (yet) exit when the `make verify_entry_files`
fails.

Improved `bin/chk-entry.sh` by removing some variables
that were not needed.

TODO: Improve `bin/` tool exit codes as the current use is a bit silly.

TODO: Clean out some variables used in `bin/` tools as some of then
are only set printed in debug statements.

TODO: Clean up usage messages, some of the options listed to not
match the `getopts(1)` parsing.  In some cases the option needs to
be parsed but needs to be ignored by the tool because another tool
automatically passes along certain options that really have no
effect.  Such ignored options need to be show as "This option is
ignored" in the usage message.
2024-02-13 03:29:54 -08:00
..
2024-02-01 14:35:49 -08:00
2023-07-04 08:41:12 -07:00
2023-07-06 21:49:38 -07:00
2023-12-26 09:00:03 -08:00

To build:

make

NOTE: We FORCE the use of -O0 even if someone overrides it because this entry will not work with it enabled.

To use:

./burley

NOTE: you need to input a number first. See judges' remarks below for information on how to play.

Judges' remarks:

This is a draw poker program. You start with $100. Input alternates between your bet and which cards to keep. Example:

5		<== you enter a bet of $5 (defaults to $1)
J Q J 9 5	<== your hand is Jack of Clubs, Queen of Hearts,
C H D S C	    Jack of Diamonds, 9 of Spades, 5 of Clubs
123		<== you enter which cards you want to keep
		    (enter 0 to 5 digits between 1 and 5)
J Q J J Q	<== your new hand is Jack of Clubs, Queen of Hearts,
C H D S C	    Jack of Diamonds, Jack of Spaces, Queen of clubs
$145 (45)	<== Your new balance is now $145.  You had a Full House
		    so your payoff is 9 times your bet == 45

The payout is according to "Vegas rules":

Straight Flush     50 times your bet
Four of a Kind     25 times your bet
Full House          9 times your bet
Flush               6 times your bet
Straight            4 times your bet
3 of a Kind         3 times your bet
2 Pair              2 times your bet
Jacks or Better     1 times your bet

The program allows you to go into debt. However I'm sure you would never control-C to kill the program just because you got behind, right? On the other hand the program never willingly exits, so you have to leave even when you are ahead. :-)

Can you figure out a winning betting "strategy"? Then can you modify the program so this "strategy" no longer works?

Notice the clever use of setjmp(3) and longjmp(3) calls. Can you keep track of what state is being saved and restored?

NOTE: the author talks about how it is a single statement. This might not be strictly true in 2023 for the fixes for it to work so you can look at the original file burley.orig.c to see what is meant.

Author's remarks:

This program plays draw poker. What is unusual about it is that it is written as a single statement -- count the semicolons! (OK, there are really three statements if you count the variable declarations.) To keep things simple, I have avoided the C preprocessor and tricky statements such as if, for, do, while, switch, and goto.

This file is Copyright (c) 2023 by Landon Curt Noll. All Rights Reserved. You are free to share and adapt this file under the terms of this license:

Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)

For more information, see: https://creativecommons.org/licenses/by-sa/4.0/