make
There is an unobfuscated version of this entry. See Alternate code below.
./konno N
./try.sh
# you can also specify numbers to try before the random and preselected ones:
./try.sh 111 222 333 444 555 666 777 888 999
Try running try.sh a number of times as the first part randomly selects ten numbers to try.
An alternate version of this entry, konno.alt.c, is provided. This alternate code is an unobfuscated version of the winning code.
make alt
Use konno.alt
as you would konno
above.
This entry is a good one-liner to analyze completely.
For extra credit, what are the minimal changes to convert it to 64-bit integers so that it could print 32 lines?
This program outputs elementary cellular automaton patterns.
Try:
./konno 30
./konno 90
./konno 102
./konno 109
./konno 165
There are 256 (from 0 through 255) possible rules.
This program uses bit operations. I think
7&O<<!o>>!o+29
is an interesting operation. This isn’t equal to
7&O>>29
operation. What is the operation doing?
This program assumes that the size of int
is 4.