Files
ioccc/2018/giles
Landon Curt Noll d414b6d71f add quick-readme2index.sh, improve all-run.sh and readme2index.sh
Improved `all-run.sh` and `readme2index.sh` so that
certain command line options (e.g., -p, -P, -u, -U ...)
are only passed along to other tools if they are
given on the command line.

all-run.sh VERSION changed from "1.1.1 2024-01-19"
to "1.1.2 2024-01-20",

readme2index.sh VERSION changed from "1.1 2024-01-16"
to "1.1.1 2024-01-20".

Added `quick-readme2index.sh` that only calls
`readme2index.sh` if the `index.html` is not
a non-empty file, or of either `.winner.json`
and/or `README.md` is newer than `index.html`.

Updated all `index.html` files because the
the file contains a comment that includes
the newly modified readme2index.sh VERSION.
2024-01-21 00:21:40 -08:00
..
2020-12-30 16:57:03 -08:00
2023-12-26 09:00:03 -08:00
2020-12-30 16:57:03 -08:00
2023-07-06 21:49:38 -07:00
2024-01-15 04:29:39 -08:00
2023-03-07 20:24:32 -08:00
2020-12-30 16:57:03 -08:00

To build:

This entry requires SDL2 to be installed. See FAQ 3.8: How do I compile an IOCCC winner that requires SDL1 or SDL2? if you don't have it installed and don't know how to do so.

make

To use:

./prog

Try:

./prog ioccc.txt
./prog prog.c
./prog sand.txt
./prog sand.alt.txt

Judges' remarks:

Can you explain the behavior of the program when ioccc.txt is given to it as input?

How would the description of the state machine look like when translated from Polynomish to English?

Author's remarks:

Remarks

This entry graphically displays a simulation of sand falling. It uses SDL to draw the interface.

The code makes the following assumptions about the underlying system:

  • SDL2 is installed from https://libsdl.org or your package manager.
  • double is an IEEE 754 floating-point type and sizeof(double)==8.
  • The compiler supports the C99 standard.

In order to simulate the motion of the sand, a cellular automaton is used. The state transition table is not stored directly. Instead, the program stores the coefficients of a polynomial that map each state to the correct one. These coefficients are stored as raw hexadecimal in the V[] array, and they are reinterpreted as doubles when used. This allows more numeric precision in fewer characters (base 16 > base 10), and makes the purpose of the array less clear.

The code is laid out graphically as a bucket pouring sand, and it is far easier to observe this high-level layout than the code's actual function.

The preprocessor is used to both obfuscate the code as a whole and abbreviate the calls to SDL. Additionally, throughout the code, the variables were named so that they are short and easily confused with each other.

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/