Format, typo, consistency check YYYY/README.md

There are many fixes made but a few questions remain so when I reach
those years I will address those then. Unfortunately, due to
infrastructure work right now, this is all I can say even though there
are a number of things I'd like to say.
This commit is contained in:
Cody Boone Ferguson committed 2024-06-26 07:28:38 -07:00
1 parent 778f57b318
commit ffdd724032
47 files changed
+326 -556

No files matched your search

-3
View File
@@ -5,9 +5,6 @@ on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author's remarks for even more details.
Instructions for use: Run `make` to compile entries (it is possible that on
System V or non-Unix systems the Makefile needs to be changed).
The Makefile for [Best self modifying program](fubar/index.html) always uses
the most portable version because there is no loss of functionality in
using it. In the case of the [Best game](tromp/index.html) entry, however, some
-2
View File
@@ -391,8 +391,6 @@
on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author’s remarks for even more details.</p>
<p>Instructions for use: Run <code>make</code> to compile entries (it is possible that on
System V or non-Unix systems the Makefile needs to be changed).</p>
<p>The Makefile for <a href="fubar/index.html">Best self modifying program</a> always uses
the most portable version because there is no loss of functionality in
using it. In the case of the <a href="tromp/index.html">Best game</a> entry, however, some
+1 -1
View File
@@ -5,7 +5,7 @@ on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author's remarks for even more details.
This year, the Grand Prize won a standing ovation at USENIX.
This year, the [Best of Show](theorem/index.html) won a standing ovation at USENIX.
The [Strangest abuse of the rules](stig/index.html) award was given this
year to stress the fact that starting in [1991](../years.html#1991), entries
+1 -1
View File
@@ -391,7 +391,7 @@
on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author’s remarks for even more details.</p>
<p>This year, the Grand Prize won a standing ovation at USENIX.</p>
<p>This year, the <a href="theorem/index.html">Best of Show</a> won a standing ovation at USENIX.</p>
<p>The <a href="stig/index.html">Strangest abuse of the rules</a> award was given this
year to stress the fact that starting in <a href="../years.html#1991">1991</a>, entries
should be shell-specific.</p>
-3
View File
@@ -5,9 +5,6 @@ on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author's remarks for even more details.
Instructions for use: Run `make` to compile entries. It is possible that
on BSD or non-Unix systems the Makefile needs to be changed.
This year, we did not single out an entry that was better than all of
the rest. We selected 3 entries that, in our opinion, went beyond
all of the other entries this year:
-2
View File
@@ -391,8 +391,6 @@
on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author’s remarks for even more details.</p>
<p>Instructions for use: Run <code>make</code> to compile entries. It is possible that
on BSD or non-Unix systems the Makefile needs to be changed.</p>
<p>This year, we did not single out an entry that was better than all of
the rest. We selected 3 entries that, in our opinion, went beyond
all of the other entries this year:</p>
+1 -6
View File
@@ -5,12 +5,7 @@ on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author's remarks for even more details.
Use `make` to compile entries. It is possible that on BSD or non-Unix
systems the Makefile needs to be changed. See the Makefile for details.
Read over the Makefile for compile/build issues. Your system may require
certain changes (add or remove a library, add or remove a `#define` i.e. the
`-D` flag). A number of compilers had problems optimizing certain entries.
A number of compilers had problems optimizing certain entries.
Some compilers do optimize, but the resulting program does not work. By default
we have left off `-O` from compile lines. You might want to add `-O` back, or
add it back for certain entries where performance is important. (This was
+1 -5
View File
@@ -391,11 +391,7 @@
on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author’s remarks for even more details.</p>
<p>Use <code>make</code> to compile entries. It is possible that on BSD or non-Unix
systems the Makefile needs to be changed. See the Makefile for details.</p>
<p>Read over the Makefile for compile/build issues. Your system may require
certain changes (add or remove a library, add or remove a <code>#define</code> i.e. the
<code>-D</code> flag). A number of compilers had problems optimizing certain entries.
<p>A number of compilers had problems optimizing certain entries.
Some compilers do optimize, but the resulting program does not work. By default
we have left off <code>-O</code> from compile lines. You might want to add <code>-O</code> back, or
add it back for certain entries where performance is important. (This was
-8
View File
@@ -5,14 +5,6 @@ on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author's remarks for even more details.
Use `make` to compile entries. It is possible that on BSD or non-Unix
systems the Makefile needs to be changed. See the Makefiles and/or `README.md`
(that are used to build the `index.html` web page) files for details.
Read over the Makefile and/or `README.md` files for compile/build issues. Your
system may require certain changes (add or remove a library, add or remove a
`#define` i.e. the `-D` flag).
Name and address information are separated from the actual program
prior to judging. This eliminates any chance that we would bias our
judging for/against any person or group.
-6
View File
@@ -391,12 +391,6 @@
on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author’s remarks for even more details.</p>
<p>Use <code>make</code> to compile entries. It is possible that on BSD or non-Unix
systems the Makefile needs to be changed. See the Makefiles and/or <code>README.md</code>
(that are used to build the <code>index.html</code> web page) files for details.</p>
<p>Read over the Makefile and/or <code>README.md</code> files for compile/build issues. Your
system may require certain changes (add or remove a library, add or remove a
<code>#define</code> i.e. the <code>-D</code> flag).</p>
<p>Name and address information are separated from the actual program
prior to judging. This eliminates any chance that we would bias our
judging for/against any person or group.</p>
-7
View File
@@ -5,13 +5,6 @@ on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author's remarks for even more details.
Use `make` to compile entries. It is possible that on BSD or non-Unix
systems the Makefile needs to be changed. See the Makefile for details.
Read over the Makefile for compile/build issues. Your system may
require certain changes (add or remove a library, add or remove a
`#define` i.e. the `-D` flag).
Name and address information are separated from the actual program
prior to judging. This eliminates any chance that we would bias our
judging for/against any person or group.
-5
View File
@@ -391,11 +391,6 @@
on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author’s remarks for even more details.</p>
<p>Use <code>make</code> to compile entries. It is possible that on BSD or non-Unix
systems the Makefile needs to be changed. See the Makefile for details.</p>
<p>Read over the Makefile for compile/build issues. Your system may
require certain changes (add or remove a library, add or remove a
<code>#define</code> i.e. the <code>-D</code> flag).</p>
<p>Name and address information are separated from the actual program
prior to judging. This eliminates any chance that we would bias our
judging for/against any person or group.</p>
+35 -47
View File
@@ -9,13 +9,6 @@ The IOCCC has an official home page, [www.ioccc.org](https://www.ioccc.org), whi
previous winning entries, information about the judges, announcements and much
more.
Use `make` to compile entries. It is possible that on BSD or non-Unix
systems the `Makefile` needs to be changed. See the `Makefile` for details.
Read over the `Makefile` for compile/build issues. Your system may
require certain changes (add or remove a library, add or remove a
`#define` i.e. the `-D` flag).
This year [Sriram Srinivasan](http://www.malhar.net/sriram/) joined the judging.
The moderator of
@@ -84,66 +77,61 @@ Obfuscated C Contest dinners were:
### Session One:
Antipasti: Crudites, olive selection, pickles, cheese selection
Soup: Homemade mushroom and green onion soup
Salad: artichoke, red bell peppers, Italian onions, cucumbers
and Greek olives with mustard vinaigrette
Main Course: Pizzas, with a variety of toppings
Dessert: Chocolate torte
**Antipasti**: Crudites, olive selection, pickles, cheese selection<br>
**Soup**: Homemade mushroom and green onion soup<br>
**Salad**: artichoke, red bell peppers, Italian onions, cucumbers and Greek olives with mustard vinaigrette<br>
**Main Course**: Pizzas, with a variety of toppings<br>
**Dessert**: Chocolate torte
### Session Two:
Antipasti: crudites, olives, roasted red peppers, cheese selection
Salad: Mixed greens with vinaigrette
Main Course: Spaghetti with tomato sauce containing mushrooms and black olives
selection of hot and mild Italian sausages
Bread: Fresh French bread
Dessert: Cookie selection, featuring chocolate chocolate chip cookies and
chocolate butter cookies
**Antipasti**: crudites, olives, roasted red peppers, cheese selection<br>
**Salad**: Mixed greens with vinaigrette<br>
**Main Course**: Spaghetti with tomato sauce containing mushrooms and black olives selection of hot and mild Italian sausages<br>
**Bread**: Fresh French bread<br>
**Dessert**: Cookie selection, featuring chocolate chocolate chip cookies and chocolate butter cookies
### Session Three
Antipasti: Crudites, olive selection
Salad: Mixed greens with mustard vinaigrette
Main Course: Broiled salmon with lemon pepper mayonnaise, chard, mixture
of white and wild rices
Bread: Cheese bread with herbs
Dessert: Chocolate cheesecake (Courtesy of Elizabeth Watson)
**Antipasti**: Crudites, olive selection<br>
**Salad**: Mixed greens with mustard vinaigrette<br>
**Main Course**: Broiled salmon with lemon pepper mayonnaise, chard, mixture of white and wild rices<br>
**Bread**: Cheese bread with herbs<br>
**Dessert**: Chocolate cheesecake (Courtesy of Elizabeth Watson)
### Session Four:
Antipasti: Crudites, olive selection, roasted red peppers, cheese selection
Bread: Sourdough
Salad: Mixed spring greens with flowers, and mustard vinaigrette
Main Course: Surf and Turf--Grilled steaks of salmon and New York steak
grilled vegetables--onions, peppers, portobello mushrooms
wild rice
Dessert: Chocolate mousse
**Antipasti**: Crudites, olive selection, roasted red peppers, cheese selection<br>
**Bread**: Sourdough<br>
**Salad**: Mixed spring greens with flowers, and mustard vinaigrette<br>
**Main Course**: Surf and Turf--Grilled steaks of salmon and New York steak grilled
vegetables--onions, peppers, portobello mushrooms wild rice<br>
**Dessert**: Chocolate mousse
### Session Five:
Antipasti: Crudites, olive selection, pickles
Salad: Mixed spring greens with mustard vinaigrette
Main Course: Linguini with a cream sauce of shiitake mushrooms and smoked
salmon
Bread: Garlic bread
Dessert: Flour-less chocolate torte
**Antipasti**: Crudites, olive selection, pickles<br>
**Salad**: Mixed spring greens with mustard vinaigrette<br>
**Main Course**: Linguini with a cream sauce of shiitake mushrooms and smoked
salmon<br>
**Bread**: Garlic bread<br>
**Dessert**: Flour-less chocolate torte
### Session Six:
Antipasti: Carrot and celery sticks with cheese spread, olive selection,
pickles
Bread: Focaccia with black olives and mozzarella cheeses
Salad: Mixed spring greens with flowers and mustard vinaigrette
Soup: Homemade butternut squash soup with mushrooms
Main Course: Cracked Dungeness crab with lemon mayonnaise, broccoli,
mixture of white and brown rice
Dessert: Key lime pie
**Antipasti**: Carrot and celery sticks with cheese spread, olive selection,
pickles<br>
**Bread**: Focaccia with black olives and mozzarella cheeses<br>
**Salad**: Mixed spring greens with flowers and mustard vinaigrette<br>
**Soup**: Homemade butternut squash soup with mushrooms<br>
**Main Course**: Cracked Dungeness crab with lemon mayonnaise, broccoli, mixture of
white and brown rice<br>
**Dessert**: Key lime pie
<!--
+35 -45
View File
@@ -394,11 +394,6 @@ try to figure how it does what it does! You may then wish to look at the
<p>The IOCCC has an official home page, <a href="https://www.ioccc.org">www.ioccc.org</a>, which contains
previous winning entries, information about the judges, announcements and much
more.</p>
<p>Use <code>make</code> to compile entries. It is possible that on BSD or non-Unix
systems the <code>Makefile</code> needs to be changed. See the <code>Makefile</code> for details.</p>
<p>Read over the <code>Makefile</code> for compile/build issues. Your system may
require certain changes (add or remove a library, add or remove a
<code>#define</code> i.e. the <code>-D</code> flag).</p>
<p>This year <a href="http://www.malhar.net/sriram/">Sriram Srinivasan</a> joined the judging.</p>
<p>The moderator of
<a href="https://groups.google.com/g/comp.unix.wizards">comp.unix.wizards</a> did not feel
@@ -446,51 +441,46 @@ appreciated the opportunity to serve as official taste testers. And as
usual, the food was excellent. The official menus of the 1995
Obfuscated C Contest dinners were:</p>
<h3 id="session-one">Session One:</h3>
<p>Antipasti: Crudites, olive selection, pickles, cheese selection
Soup: Homemade mushroom and green onion soup
Salad: artichoke, red bell peppers, Italian onions, cucumbers
and Greek olives with mustard vinaigrette
Main Course: Pizzas, with a variety of toppings
Dessert: Chocolate torte</p>
<p><strong>Antipasti</strong>: Crudites, olive selection, pickles, cheese selection<br>
<strong>Soup</strong>: Homemade mushroom and green onion soup<br>
<strong>Salad</strong>: artichoke, red bell peppers, Italian onions, cucumbers and Greek olives with mustard vinaigrette<br>
<strong>Main Course</strong>: Pizzas, with a variety of toppings<br>
<strong>Dessert</strong>: Chocolate torte</p>
<h3 id="session-two">Session Two:</h3>
<p>Antipasti: crudites, olives, roasted red peppers, cheese selection
Salad: Mixed greens with vinaigrette
Main Course: Spaghetti with tomato sauce containing mushrooms and black olives
selection of hot and mild Italian sausages
Bread: Fresh French bread
Dessert: Cookie selection, featuring chocolate chocolate chip cookies and
chocolate butter cookies</p>
<p><strong>Antipasti</strong>: crudites, olives, roasted red peppers, cheese selection<br>
<strong>Salad</strong>: Mixed greens with vinaigrette<br>
<strong>Main Course</strong>: Spaghetti with tomato sauce containing mushrooms and black olives selection of hot and mild Italian sausages<br>
<strong>Bread</strong>: Fresh French bread<br>
<strong>Dessert</strong>: Cookie selection, featuring chocolate chocolate chip cookies and chocolate butter cookies</p>
<h3 id="session-three">Session Three</h3>
<p>Antipasti: Crudites, olive selection
Salad: Mixed greens with mustard vinaigrette
Main Course: Broiled salmon with lemon pepper mayonnaise, chard, mixture
of white and wild rices
Bread: Cheese bread with herbs
Dessert: Chocolate cheesecake (Courtesy of Elizabeth Watson)</p>
<p><strong>Antipasti</strong>: Crudites, olive selection<br>
<strong>Salad</strong>: Mixed greens with mustard vinaigrette<br>
<strong>Main Course</strong>: Broiled salmon with lemon pepper mayonnaise, chard, mixture of white and wild rices<br>
<strong>Bread</strong>: Cheese bread with herbs<br>
<strong>Dessert</strong>: Chocolate cheesecake (Courtesy of Elizabeth Watson)</p>
<h3 id="session-four">Session Four:</h3>
<p>Antipasti: Crudites, olive selection, roasted red peppers, cheese selection
Bread: Sourdough
Salad: Mixed spring greens with flowers, and mustard vinaigrette
Main Course: Surf and Turf–Grilled steaks of salmon and New York steak
grilled vegetables–onions, peppers, portobello mushrooms
wild rice
Dessert: Chocolate mousse</p>
<p><strong>Antipasti</strong>: Crudites, olive selection, roasted red peppers, cheese selection<br>
<strong>Bread</strong>: Sourdough<br>
<strong>Salad</strong>: Mixed spring greens with flowers, and mustard vinaigrette<br>
<strong>Main Course</strong>: Surf and Turf–Grilled steaks of salmon and New York steak grilled
vegetables–onions, peppers, portobello mushrooms wild rice<br>
<strong>Dessert</strong>: Chocolate mousse</p>
<h3 id="session-five">Session Five:</h3>
<p>Antipasti: Crudites, olive selection, pickles
Salad: Mixed spring greens with mustard vinaigrette
Main Course: Linguini with a cream sauce of shiitake mushrooms and smoked
salmon
Bread: Garlic bread
Dessert: Flour-less chocolate torte</p>
<p><strong>Antipasti</strong>: Crudites, olive selection, pickles<br>
<strong>Salad</strong>: Mixed spring greens with mustard vinaigrette<br>
<strong>Main Course</strong>: Linguini with a cream sauce of shiitake mushrooms and smoked
salmon<br>
<strong>Bread</strong>: Garlic bread<br>
<strong>Dessert</strong>: Flour-less chocolate torte</p>
<h3 id="session-six">Session Six:</h3>
<p>Antipasti: Carrot and celery sticks with cheese spread, olive selection,
pickles
Bread: Focaccia with black olives and mozzarella cheeses
Salad: Mixed spring greens with flowers and mustard vinaigrette
Soup: Homemade butternut squash soup with mushrooms
Main Course: Cracked Dungeness crab with lemon mayonnaise, broccoli,
mixture of white and brown rice
Dessert: Key lime pie</p>
<p><strong>Antipasti</strong>: Carrot and celery sticks with cheese spread, olive selection,
pickles<br>
<strong>Bread</strong>: Focaccia with black olives and mozzarella cheeses<br>
<strong>Salad</strong>: Mixed spring greens with flowers and mustard vinaigrette<br>
<strong>Soup</strong>: Homemade butternut squash soup with mushrooms<br>
<strong>Main Course</strong>: Cracked Dungeness crab with lemon mayonnaise, broccoli, mixture of
white and brown rice<br>
<strong>Dessert</strong>: Key lime pie</p>
<!--
Copyright © 1984-2024 by Landon Curt Noll. All Rights Reserved.
+4 -10
View File
@@ -12,12 +12,6 @@ The IOCCC has an official home page: [www.ioccc.org](https://www.ioccc.org),
containing previous winning entries, information about the judges,
announcements and much more.
Use `make` to compile entries. It is possible that on BSD or non-Unix
systems the Makefile needs to be changed. See the Makefile for details.
Read over the Makefile for compile/build issues. Your system may
require certain changes (add or remove a library, add or remove a
`#define` i.e. the `-D` flag).
## Where are Larry Bassel and Barbara Frezza?
@@ -50,7 +44,7 @@ Schweikhardt around, this lead could fall fast.
As we stated in the [guidelines](guidelines.txt), the authors of the winning entries are
as much news to us as they are to you because we keep authorship separate from
rest of the entry. Some people have it, we guess!
the rest of the entry. Some people have it, we guess!
There were a few very good entries that might have won if it were not
for the fact that they didn't work. If you didn't win, but think you
@@ -62,15 +56,15 @@ had a chance: test your program, fix it and submit it next year!
There will be no 1997 contest.
The next contest will not open until sometime in March 1998, and will
close sometime around the end of May 1998. The rules for the 1998
contest have not been formed at this time and are not expected to be
close sometime around the end of May 1998. The [rules for the 1998
contest](../1998/rules.txt) have not been formed at this time and are not expected to be
ready for distribution until late February 1998.
So what happened to 1997? Well the next USENIX Technical Conference
will be held Jun 15-19, 1998 (in New Orleans, US). The 18 month
span between conferences will cause the IOCCC to skip over 1997.
Be sure to wait until the 1998 rules are posted before submitting entries.
Be sure to wait until the [1998 rules](../1998/rules.txt) are posted before submitting entries.
Rules differ from year to year, sometimes in significant ways.
Please send us comments and suggestions what we have expressed above.
+4 -9
View File
@@ -395,11 +395,6 @@ You may then wish to look at the Author’s remarks for even more details.</p>
<p>The IOCCC has an official home page: <a href="https://www.ioccc.org">www.ioccc.org</a>,
containing previous winning entries, information about the judges,
announcements and much more.</p>
<p>Use <code>make</code> to compile entries. It is possible that on BSD or non-Unix
systems the Makefile needs to be changed. See the Makefile for details.</p>
<p>Read over the Makefile for compile/build issues. Your system may
require certain changes (add or remove a library, add or remove a
<code>#define</code> i.e. the <code>-D</code> flag).</p>
<h2 id="where-are-larry-bassel-and-barbara-frezza">Where are Larry Bassel and Barbara Frezza?</h2>
<p>It is not true that Larry Bassel avoided the 13th IOCCC on grounds of
superstition! Larry (as well as Landon) is fond of prime numbers.
@@ -423,20 +418,20 @@ winning entry, twice the number of the next highest count. But with people like
Schweikhardt around, this lead could fall fast.</p>
<p>As we stated in the <a href="guidelines.txt">guidelines</a>, the authors of the winning entries are
as much news to us as they are to you because we keep authorship separate from
rest of the entry. Some people have it, we guess!</p>
the rest of the entry. Some people have it, we guess!</p>
<p>There were a few very good entries that might have won if it were not
for the fact that they didn’t work. If you didn’t win, but think you
had a chance: test your program, fix it and submit it next year!</p>
<h2 id="a-few-notes-regarding-future-contests">A few notes regarding future contests</h2>
<p>There will be no 1997 contest.</p>
<p>The next contest will not open until sometime in March 1998, and will
close sometime around the end of May 1998. The rules for the 1998
contest have not been formed at this time and are not expected to be
close sometime around the end of May 1998. The <a href="../1998/rules.txt">rules for the 1998
contest</a> have not been formed at this time and are not expected to be
ready for distribution until late February 1998.</p>
<p>So what happened to 1997? Well the next USENIX Technical Conference
will be held Jun 15-19, 1998 (in New Orleans, US). The 18 month
span between conferences will cause the IOCCC to skip over 1997.</p>
<p>Be sure to wait until the 1998 rules are posted before submitting entries.
<p>Be sure to wait until the <a href="../1998/rules.txt">1998 rules</a> are posted before submitting entries.
Rules differ from year to year, sometimes in significant ways.</p>
<p>Please send us comments and suggestions what we have expressed above.
Also include anything else that you would like to see in future contests.
+11 -17
View File
@@ -8,20 +8,12 @@ on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author's remarks for even more details.
The IOCCC has its own domain. The IOCCC has an official home page:
[www.ioccc.org](https://www.ioccc.org).
Use `make` to compile entries. It is possible that on BSD or non-Unix
systems the Makefile needs to be changed. See the Makefile for details.
Read over the Makefile for compile/build issues. Your system may
require certain changes (add or remove a library, add or remove a
`#define` i.e. the `-D` flag).
Some ANSI C compilers are not quite as good as they should be. If
yours is lacking, you may need to compile using gcc instead of your
local compiler.
The IOCCC has an official home page: [www.ioccc.org](https://www.ioccc.org).
## New Judges
@@ -48,11 +40,11 @@ The number of judges now is only 2, Landon Curt Noll and Leonid A. Broukhis.
## Remarks on some of the entries
This year, [Jens
Schweikhardt](https://www.ioccc.org/authors.html#Jens_Schweikhardt) won 3 times
Schweikhardt](../../authors.html#Jens_Schweikhardt) won 3 times
... AGAIN! He is the only person who was able to do this, let alone do it in
two contests in a row. [Bas de
Bakker](https://www.ioccc.org/authors.html#Bas_de_Bakker) and [David
Lowe](https://www.ioccc.org/authors.html#J_David_Lowe) won twice this year as
Bakker](../../authors.html#Bas_de_Bakker) and [David
Lowe](../../authors.html#J_David_Lowe) won twice this year as
well.
As we stated in the [guidelines](guidelines.txt), the authors of the winning entries are
@@ -68,13 +60,15 @@ look at all of the winning entries. The list of winning entries is a bit too lo
say something about every entry. On the other hand a partial mention
of a few is in order:
- Audiences were very impressed with the Best of Show entry.
- Audiences were very impressed with the [Best of Show
entry](banks/index.html).
- The judges were amused that for the first time we received an entry
that caused gcc to give the assembler bad input in some cases.
- The poot entries got a good laugh from the USENIX IOCCC BOF (Birds Of a Feather) crowd.
- The `poot` entries ([dlowe](dlowe/index.html),
[dloweneil](dloweneil/index.html) got a good laugh from the USENIX IOCCC BOF (Birds Of a Feather) crowd.
- Those with Functional Programming knowledge as well as those
impressed with CPP code expansion liked the entry that translated
lambda expressions into combinator expressions.
impressed with CPP code expansion like [the entry that translates
lambda expressions into combinator expressions](fanf/index.html).
- Logic minded folks will get somewhat twisted up while following the
flow of the [Best Flow Control entry](schnitzi/index.html).
- Those who know the PostScript language will be 'bemused' by
+10 -14
View File
@@ -392,16 +392,10 @@
on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author’s remarks for even more details.</p>
<p>The IOCCC has its own domain. The IOCCC has an official home page:
<a href="https://www.ioccc.org">www.ioccc.org</a>.</p>
<p>Use <code>make</code> to compile entries. It is possible that on BSD or non-Unix
systems the Makefile needs to be changed. See the Makefile for details.</p>
<p>Read over the Makefile for compile/build issues. Your system may
require certain changes (add or remove a library, add or remove a
<code>#define</code> i.e. the <code>-D</code> flag).</p>
<p>Some ANSI C compilers are not quite as good as they should be. If
yours is lacking, you may need to compile using gcc instead of your
local compiler.</p>
<p>The IOCCC has an official home page: <a href="https://www.ioccc.org">www.ioccc.org</a>.</p>
<h2 id="new-judges">New Judges</h2>
<p>Larry Bassel is now a graduate student in number theory at UC San Diego.
Barbara Frezza also went to San Diego to enter into law school at the
@@ -418,11 +412,11 @@ thru-out the 1998 IOCCC season.</p>
<h3 id="note-about-judges">2023 note about judges:</h3>
<p>The number of judges now is only 2, Landon Curt Noll and Leonid A. Broukhis.</p>
<h2 id="remarks-on-some-of-the-entries">Remarks on some of the entries</h2>
<p>This year, <a href="https://www.ioccc.org/authors.html#Jens_Schweikhardt">Jens
<p>This year, <a href="../../authors.html#Jens_Schweikhardt">Jens
Schweikhardt</a> won 3 times
… AGAIN! He is the only person who was able to do this, let alone do it in
two contests in a row. <a href="https://www.ioccc.org/authors.html#Bas_de_Bakker">Bas de
Bakker</a> and <a href="https://www.ioccc.org/authors.html#J_David_Lowe">David
two contests in a row. <a href="../../authors.html#Bas_de_Bakker">Bas de
Bakker</a> and <a href="../../authors.html#J_David_Lowe">David
Lowe</a> won twice this year as
well.</p>
<p>As we stated in the <a href="guidelines.txt">guidelines</a>, the authors of the winning entries are
@@ -436,13 +430,15 @@ look at all of the winning entries. The list of winning entries is a bit too lon
say something about every entry. On the other hand a partial mention
of a few is in order:</p>
<ul>
<li>Audiences were very impressed with the Best of Show entry.</li>
<li>Audiences were very impressed with the <a href="banks/index.html">Best of Show
entry</a>.</li>
<li>The judges were amused that for the first time we received an entry
that caused gcc to give the assembler bad input in some cases.</li>
<li>The poot entries got a good laugh from the USENIX IOCCC BOF (Birds Of a Feather) crowd.</li>
<li>The <code>poot</code> entries (<a href="dlowe/index.html">dlowe</a>,
<a href="dloweneil/index.html">dloweneil</a> got a good laugh from the USENIX IOCCC BOF (Birds Of a Feather) crowd.</li>
<li>Those with Functional Programming knowledge as well as those
impressed with CPP code expansion liked the entry that translated
lambda expressions into combinator expressions.</li>
impressed with CPP code expansion like <a href="fanf/index.html">the entry that translates
lambda expressions into combinator expressions</a>.</li>
<li>Logic minded folks will get somewhat twisted up while following the
flow of the <a href="schnitzi/index.html">Best Flow Control entry</a>.</li>
<li>Those who know the PostScript language will be ‘bemused’ by
+6 -13
View File
@@ -8,13 +8,6 @@ on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author's remarks for even more details.
Use `make` to compile entries. It is possible that on non-Unix / non-Linux
systems the Makefile needs to be changed. See the Makefile for details.
Read over the Makefile for compile/build issues. Your system may
require certain changes (add or remove a library, add or remove a
`#define`).
Some ANSI C compilers are not quite as good as they should be. If
yours is lacking, you may need to compile using gcc instead of your
local compiler.
@@ -44,17 +37,17 @@ them for the next IOCCC.
We believe you will be impressed with this year's winning entries. The [Best of
Show](jarijyrki/index.html) is a fine example of compact obfuscation. But don't
ignore the shorter entries. The [Best Small Program](natori/index.html), [Best
Abuse of User](briddlebane/index.html) and [Most Complete Program](tomx/index.html)
ignore the shorter entries. The [Best small program](natori/index.html), [Best
abuse of user](briddlebane/index.html) and [Most complete program](tomx/index.html)
are well worth studying in detail.
The [Worst Abuse of the Rules](dlowe/index.html) is technically allowed by the
The [Worst abuse of the rules](dlowe/index.html) is technically allowed by the
rules. We gave it an award this year, but don't assume you can get away with
using it next time ... :-)
Speaking of time, be sure to check out the [Astronomically
Obfuscated](rince/index.html) and the [Most Timely
Output](schneiderwent/index.html) entries.
obfuscated](rince/index.html) and the [Most timely
output](schneiderwent/index.html) entries.
## There was no 1999 contest
@@ -74,7 +67,7 @@ scheduled start of the contest). That is why there is no 1999 contest.
**NOTE**: The above has been mentioned in an Amici Curiae for the
DeCSS case. See [BRIEF OF AMICI CURIAE N SUPPORT OF APPELLANTS AND
REVERSAL ..](https://web.archive.org/web/20231021211330/http://cryptome.org/mpaa-v-2600-bac.htm).
REVERSAL](https://web.archive.org/web/20231021211330/http://cryptome.org/mpaa-v-2600-bac.htm).
## Final Comments
+6 -11
View File
@@ -392,11 +392,6 @@
on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author’s remarks for even more details.</p>
<p>Use <code>make</code> to compile entries. It is possible that on non-Unix / non-Linux
systems the Makefile needs to be changed. See the Makefile for details.</p>
<p>Read over the Makefile for compile/build issues. Your system may
require certain changes (add or remove a library, add or remove a
<code>#define</code>).</p>
<p>Some ANSI C compilers are not quite as good as they should be. If
yours is lacking, you may need to compile using gcc instead of your
local compiler.</p>
@@ -418,15 +413,15 @@ that was not supplied with the entry.</li>
them for the next IOCCC.</p>
<p>We believe you will be impressed with this year’s winning entries. The <a href="jarijyrki/index.html">Best of
Show</a> is a fine example of compact obfuscation. But don’t
ignore the shorter entries. The <a href="natori/index.html">Best Small Program</a>, <a href="briddlebane/index.html">Best
Abuse of User</a> and <a href="tomx/index.html">Most Complete Program</a>
ignore the shorter entries. The <a href="natori/index.html">Best small program</a>, <a href="briddlebane/index.html">Best
abuse of user</a> and <a href="tomx/index.html">Most complete program</a>
are well worth studying in detail.</p>
<p>The <a href="dlowe/index.html">Worst Abuse of the Rules</a> is technically allowed by the
<p>The <a href="dlowe/index.html">Worst abuse of the rules</a> is technically allowed by the
rules. We gave it an award this year, but don’t assume you can get away with
using it next time … :-)</p>
<p>Speaking of time, be sure to check out the <a href="rince/index.html">Astronomically
Obfuscated</a> and the <a href="schneiderwent/index.html">Most Timely
Output</a> entries.</p>
obfuscated</a> and the <a href="schneiderwent/index.html">Most timely
output</a> entries.</p>
<h2 id="there-was-no-1999-contest">There was no 1999 contest</h2>
<p>So what happened to 1999? Landon Curt Noll was scheduled to take a
vacation from the IOCCC this year. The remaining judges were
@@ -440,7 +435,7 @@ and Leonid A. Broukhis the judging was completed in Dec 2000.</p>
scheduled start of the contest). That is why there is no 1999 contest.</p>
<p><strong>NOTE</strong>: The above has been mentioned in an Amici Curiae for the
DeCSS case. See <a href="https://web.archive.org/web/20231021211330/http://cryptome.org/mpaa-v-2600-bac.htm">BRIEF OF AMICI CURIAE N SUPPORT OF APPELLANTS AND
REVERSAL ..</a>.</p>
REVERSAL</a>.</p>
<h2 id="final-comments">Final Comments</h2>
<p>Please send us comments and suggestions what we have expressed above.
Also include anything else that you would like to see in future contests.
+1 -8
View File
@@ -11,13 +11,6 @@ You may then wish to look at the Author's remarks for even more details.
The IOCCC has a website and now has a number of international mirrors. The
primary site can be found at [www.ioccc.org](https://www.ioccc.org).
Use `make` to compile entries. It is possible that on non-Unix / non-Linux
systems the Makefile needs to be changed. See the Makefile for details.
Read over the Makefile for compile/build issues. Your system may
require certain changes (add or remove a library, add or remove a
`#define` i.e. the `-D` flag).
Some ANSI C compilers are not quite as good as they should be. If
yours is lacking, you may need to compile using gcc instead of your
local compiler.
@@ -41,7 +34,7 @@ Show](ollinger/index.html) is a fine example of obfuscation. But don't ignore
the other entries! There are games, programs that speak, ones that compile code
and [one that _might_ run binaries you already have](anonymous/index.html).
The [Best/Worst Abuse of the Rules](bellard/index.html) is technically allowed by the
The [Best abuse of the rules](bellard/index.html) is technically allowed by the
[rules](rules.txt). This year we awarded it again, but don't assume you can get
away with using the same technique next time ... :-)
+1 -6
View File
@@ -394,11 +394,6 @@ Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author’s remarks for even more details.</p>
<p>The IOCCC has a website and now has a number of international mirrors. The
primary site can be found at <a href="https://www.ioccc.org">www.ioccc.org</a>.</p>
<p>Use <code>make</code> to compile entries. It is possible that on non-Unix / non-Linux
systems the Makefile needs to be changed. See the Makefile for details.</p>
<p>Read over the Makefile for compile/build issues. Your system may
require certain changes (add or remove a library, add or remove a
<code>#define</code> i.e. the <code>-D</code> flag).</p>
<p>Some ANSI C compilers are not quite as good as they should be. If
yours is lacking, you may need to compile using gcc instead of your
local compiler.</p>
@@ -417,7 +412,7 @@ them for the next IOCCC.</p>
Show</a> is a fine example of obfuscation. But don’t ignore
the other entries! There are games, programs that speak, ones that compile code
and <a href="anonymous/index.html">one that <em>might</em> run binaries you already have</a>.</p>
<p>The <a href="bellard/index.html">Best/Worst Abuse of the Rules</a> is technically allowed by the
<p>The <a href="bellard/index.html">Best abuse of the rules</a> is technically allowed by the
<a href="rules.txt">rules</a>. This year we awarded it again, but don’t assume you can get
away with using the same technique next time … :-)</p>
<p>This year there were several repeat authors. This is understating the
+5 -12
View File
@@ -8,29 +8,22 @@ on how to compile the entry and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author's remarks for even more details.
The IOCCC has a website and now has a number of international mirrors.
The primary site can be found at <https://www.ioccc.org/>.
Use `make(1)` to compile entries. It is possible that on non-Unix / non-Linux
systems the `Makefile` needs to be changed. See the `Makefile` for details.
Read over the `Makefile` for compile/build issues. Your system may
require certain changes (add or remove a library, add or remove a
`#define`).
Some ANSI C compilers are not quite as good as they should be. If
yours is lacking, you may need to compile using `gcc` instead of your
local compiler.
The IOCCC has a website and now has a number of international mirrors.
The primary website can be found at <https://www.ioccc.org/>.
## Remarks on some of the entries
We believe you will be impressed with this year's winning entries. The [Best of
Show](%%REPO_URL%%/2004/gavin/gavin.c) is a fine example of obfuscation. But don't ignore the
Show](gavin/index.html) is a fine example of obfuscation. But don't ignore the
other entries! There are games, utilities, programs that output images and a
one-liner that is incredibly compact for what it can do.
The [Best Abuse of the Guidelines](%%REPO_URL%%/2004/hibachi/hibachi.c) is technically allowed by
The [Best abuse of the guidelines](hibachi/index.html) is technically allowed by
the rules. This year we allowed it due to the functionality of the program.
This entry is one of the easiest to read! Don't assume you can win using
similar techniques next time ... :-)
+4 -9
View File
@@ -392,22 +392,17 @@
on how to compile the entry and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author’s remarks for even more details.</p>
<p>The IOCCC has a website and now has a number of international mirrors.
The primary site can be found at <a href="https://www.ioccc.org/" class="uri">https://www.ioccc.org/</a>.</p>
<p>Use <code>make(1)</code> to compile entries. It is possible that on non-Unix / non-Linux
systems the <code>Makefile</code> needs to be changed. See the <code>Makefile</code> for details.</p>
<p>Read over the <code>Makefile</code> for compile/build issues. Your system may
require certain changes (add or remove a library, add or remove a
<code>#define</code>).</p>
<p>Some ANSI C compilers are not quite as good as they should be. If
yours is lacking, you may need to compile using <code>gcc</code> instead of your
local compiler.</p>
<p>The IOCCC has a website and now has a number of international mirrors.
The primary website can be found at <a href="https://www.ioccc.org/" class="uri">https://www.ioccc.org/</a>.</p>
<h2 id="remarks-on-some-of-the-entries">Remarks on some of the entries</h2>
<p>We believe you will be impressed with this year’s winning entries. The <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2004/gavin/gavin.c">Best of
<p>We believe you will be impressed with this year’s winning entries. The <a href="gavin/index.html">Best of
Show</a> is a fine example of obfuscation. But don’t ignore the
other entries! There are games, utilities, programs that output images and a
one-liner that is incredibly compact for what it can do.</p>
<p>The <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2004/hibachi/hibachi.c">Best Abuse of the Guidelines</a> is technically allowed by
<p>The <a href="hibachi/index.html">Best abuse of the guidelines</a> is technically allowed by
the rules. This year we allowed it due to the functionality of the program.
This entry is one of the easiest to read! Don’t assume you can win using
similar techniques next time … :-)</p>
+7 -12
View File
@@ -8,21 +8,15 @@ on how to compile the entry and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author's remarks for even more details.
The IOCCC has a website and now has a number of international mirrors.
The primary site can be found at <https://www.ioccc.org/>.
Use `make(1)` to compile entries. It is possible that on non-Unix / non-Linux
systems the `Makefile` needs to be changed. See the `Makefile` for details.
Some ANSI C compilers are not quite as good as they should be. If
yours is lacking, you may need to compile using `gcc` instead of your
local compiler.
This year we included most of the information included by the submitters
in the `README.md` files (that were used to build the `index.html` web pages).
Read over the `Makefile` for compile/build issues. Your system may require
certain changes (add or remove a library, add or remove a `#define`).
Some ANSI C compilers are not quite as good as they should be. If
yours is lacking, you may need to compile using `gcc` instead of your
local compiler.
The IOCCC has a website and now has a number of international mirrors.
The primary website can be found at <https://www.ioccc.org/>.
## Remarks on some of the entries
@@ -52,7 +46,7 @@ parenthesis](mikeash/index.html) is self reproducing).
+ The [Most sonorous output - 2005/jetro](jetro/index.html) might `sound` :-) like a good idea.
+ The [Best 2D puzzle - 2005/giljade](giljade/index.html) takes editorial license with expressions as well as the
with the [vi editor](https://en.wikipedia.org/wiki/Vi).
with the [vi editor](https://en.wikipedia.org/wiki/Vi_&#x28;text_editor&#x29;).
+ The [Most ambiguous language - 2005/chia](chia/index.html) entry is really a C program.
@@ -69,6 +63,7 @@ discourteous interpreter - 2005/timwi](timwi/index.html) entry.
+ The [Most ingenious puzzle solution - 2005/aidan](aidan/index.html) might puzzle you more while it
puzzles out some puzzles: all in a puzzling way! :-)
### Remarks on some of the losing entries
There were some outstanding entries that did not win. Unfortunately
+5 -9
View File
@@ -392,17 +392,13 @@
on how to compile the entry and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author’s remarks for even more details.</p>
<p>The IOCCC has a website and now has a number of international mirrors.
The primary site can be found at <a href="https://www.ioccc.org/" class="uri">https://www.ioccc.org/</a>.</p>
<p>Use <code>make(1)</code> to compile entries. It is possible that on non-Unix / non-Linux
systems the <code>Makefile</code> needs to be changed. See the <code>Makefile</code> for details.</p>
<p>This year we included most of the information included by the submitters
in the <code>README.md</code> files (that were used to build the <code>index.html</code> web pages).</p>
<p>Read over the <code>Makefile</code> for compile/build issues. Your system may require
certain changes (add or remove a library, add or remove a <code>#define</code>).</p>
<p>Some ANSI C compilers are not quite as good as they should be. If
yours is lacking, you may need to compile using <code>gcc</code> instead of your
local compiler.</p>
<p>This year we included most of the information included by the submitters
in the <code>README.md</code> files (that were used to build the <code>index.html</code> web pages).</p>
<p>The IOCCC has a website and now has a number of international mirrors.
The primary website can be found at <a href="https://www.ioccc.org/" class="uri">https://www.ioccc.org/</a>.</p>
<h2 id="remarks-on-some-of-the-entries">Remarks on some of the entries</h2>
<p>We believe you will be impressed with this year’s winning entries.</p>
<p>In particular:</p>
@@ -420,7 +416,7 @@ whitespace in their source code and during execution.</p></li>
parenthesis</a> is self reproducing).</p></li>
<li><p>The <a href="jetro/index.html">Most sonorous output - 2005/jetro</a> might <code>sound</code> :-) like a good idea.</p></li>
<li><p>The <a href="giljade/index.html">Best 2D puzzle - 2005/giljade</a> takes editorial license with expressions as well as the
with the <a href="https://en.wikipedia.org/wiki/Vi">vi editor</a>.</p></li>
with the <a href="https://en.wikipedia.org/wiki/Vi_(text_editor)">vi editor</a>.</p></li>
<li><p>The <a href="chia/index.html">Most ambiguous language - 2005/chia</a> entry is really a C program.</p></li>
<li><p>The <a href="boutines/index.html">Most superfluous output - 2005/boutines</a> entry is simply
<a href="https://en.wikipedia.org/wiki/Voronoi_diagram">Voronoi</a>-lific!</p></li>
+5 -11
View File
@@ -8,21 +8,15 @@ on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author's remarks for even more details.
The IOCCC has a website and now has a number of international mirrors.
The primary site can be found at [www.ioccc.org](https://www.ioccc.org).
Use `make` to compile entries. It is possible that on non-Unix / non-Linux
systems the Makefile needs to be changed. See the Makefile for details.
Some ANSI C compilers are not quite as good as they should be. If
yours is lacking, you may need to compile using gcc instead of your
local compiler.
This year we included most of the information included by the submitters
in the `README.md` files (that were used to build the `index.html` web pages).
Read over the Makefile for compile/build issues. Your system may require
certain changes (add or remove a library, add or remove a `#define`).
Some ANSI C compilers are not quite as good as they should be. If
yours is lacking, you may need to compile using gcc instead of your
local compiler.
The IOCCC has a website and now has a number of international mirrors.
The primary website can be found at [www.ioccc.org](https://www.ioccc.org).
## Remarks on some of the entries
+4 -8
View File
@@ -392,17 +392,13 @@
on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author’s remarks for even more details.</p>
<p>The IOCCC has a website and now has a number of international mirrors.
The primary site can be found at <a href="https://www.ioccc.org">www.ioccc.org</a>.</p>
<p>Use <code>make</code> to compile entries. It is possible that on non-Unix / non-Linux
systems the Makefile needs to be changed. See the Makefile for details.</p>
<p>This year we included most of the information included by the submitters
in the <code>README.md</code> files (that were used to build the <code>index.html</code> web pages).</p>
<p>Read over the Makefile for compile/build issues. Your system may require
certain changes (add or remove a library, add or remove a <code>#define</code>).</p>
<p>Some ANSI C compilers are not quite as good as they should be. If
yours is lacking, you may need to compile using gcc instead of your
local compiler.</p>
<p>This year we included most of the information included by the submitters
in the <code>README.md</code> files (that were used to build the <code>index.html</code> web pages).</p>
<p>The IOCCC has a website and now has a number of international mirrors.
The primary website can be found at <a href="https://www.ioccc.org">www.ioccc.org</a>.</p>
<h2 id="remarks-on-some-of-the-entries">Remarks on some of the entries</h2>
<p>There were some outstanding entries that did not win. Unfortunately
some very good entries lost because they:</p>
+12 -20
View File
@@ -6,24 +6,16 @@
View the `index.html` web page for the given winning entry for information on how
on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author's remarks for even more details.
The IOCCC has a website and now has a number of international mirrors.
The primary site can be found at [www.ioccc.org](https://www.ioccc.org).
Use `make` to compile entries. It is possible that on non-Unix / non-Linux
systems the Makefile needs to be changed. See the Makefile for details.
This year we included most of the information included by the submitters
in the `README.md` files (that were used to build the `index.html` web pages).
Read over the Makefile for compile/build issues. Your system may require
certain changes (add or remove a library, add or remove a `#define`).
You may then wish to look at the Author's remarks for even more details (this
year we included most of the information by the submitters).
Some ANSI C compilers are not quite as good as they should be. If
yours is lacking, you may need to compile using gcc instead of your
local compiler.
The IOCCC has a website and now has a number of international mirrors.
The primary website can be found at [www.ioccc.org](https://www.ioccc.org).
## Remarks on some of the entries
@@ -39,15 +31,15 @@ some very good entries lost because they:
We hope the authors of some of those entries will fix and re-submit
them for the next IOCCC.
We believe you will be impressed with this year's winning entries. The Best
of Show is a fine example of character stitching. But don't ignore the other
entries! There are games, puzzle solvers, utilities, eye candy, calculators and
graphical and audio tools.
We believe you will be impressed with this year's winning entries. The [Best of
Show - Most Shrinkable](akari/index.html) is a fine example of character
stitching. But don't ignore the other entries! There are games, puzzle
solvers, utilities, eye candy, calculators and graphical and audio tools.
This year all authors are different, and there is a authors from a new country -
China! Many authors won for the first time. (Please note that judging is done
completely anonymously. Be warned that we may disqualify entries that reveal
the identity of the submitter).
[China](../location.html#CN)! Many authors won for the first time. (Please
note that judging is done completely anonymously. Be warned that we may
disqualify entries that reveal the identity of the submitter).
## Final Comments
+11 -16
View File
@@ -391,18 +391,13 @@
<p>View the <code>index.html</code> web page for the given winning entry for information on how
on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author’s remarks for even more details.</p>
<p>The IOCCC has a website and now has a number of international mirrors.
The primary site can be found at <a href="https://www.ioccc.org">www.ioccc.org</a>.</p>
<p>Use <code>make</code> to compile entries. It is possible that on non-Unix / non-Linux
systems the Makefile needs to be changed. See the Makefile for details.</p>
<p>This year we included most of the information included by the submitters
in the <code>README.md</code> files (that were used to build the <code>index.html</code> web pages).</p>
<p>Read over the Makefile for compile/build issues. Your system may require
certain changes (add or remove a library, add or remove a <code>#define</code>).</p>
You may then wish to look at the Author’s remarks for even more details (this
year we included most of the information by the submitters).</p>
<p>Some ANSI C compilers are not quite as good as they should be. If
yours is lacking, you may need to compile using gcc instead of your
local compiler.</p>
<p>The IOCCC has a website and now has a number of international mirrors.
The primary website can be found at <a href="https://www.ioccc.org">www.ioccc.org</a>.</p>
<h2 id="remarks-on-some-of-the-entries">Remarks on some of the entries</h2>
<p>There were some outstanding entries that did not win. Unfortunately
some very good entries lost because they:</p>
@@ -413,14 +408,14 @@ some very good entries lost because they:</p>
</ul>
<p>We hope the authors of some of those entries will fix and re-submit
them for the next IOCCC.</p>
<p>We believe you will be impressed with this year’s winning entries. The Best
of Show is a fine example of character stitching. But don’t ignore the other
entries! There are games, puzzle solvers, utilities, eye candy, calculators and
graphical and audio tools.</p>
<p>We believe you will be impressed with this year’s winning entries. The <a href="akari/index.html">Best of
Show - Most Shrinkable</a> is a fine example of character
stitching. But don’t ignore the other entries! There are games, puzzle
solvers, utilities, eye candy, calculators and graphical and audio tools.</p>
<p>This year all authors are different, and there is a authors from a new country -
China! Many authors won for the first time. (Please note that judging is done
completely anonymously. Be warned that we may disqualify entries that reveal
the identity of the submitter).</p>
<a href="../location.html#CN">China</a>! Many authors won for the first time. (Please
note that judging is done completely anonymously. Be warned that we may
disqualify entries that reveal the identity of the submitter).</p>
<h2 id="final-comments">Final Comments</h2>
<p><strong>IMPORTANT NOTE</strong>: See <a href="../contact.html">contact.html</a> for up to date contact details
as well as details on how to provide fixes to any of the entries.
+20 -20
View File
@@ -8,19 +8,14 @@ on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author's remarks for even more details.
The IOCCC has a website and now has a number of international mirrors.
The primary site can be found at [www.ioccc.org](https://www.ioccc.org).
Use `make` to compile entries. It is possible that on non-Unix / non-Linux
systems the Makefile needs to be changed. See the Makefile for details.
Read over the Makefile for compile/build issues. Your system may require
certain changes (add or remove a library, add or remove a `#define`).
Some ANSI C compilers are not quite as good as they should be. If
yours is lacking, you may need to compile using gcc instead of your
local compiler.
The IOCCC has a website and now has a number of international mirrors.
The primary website can be found at [www.ioccc.org](https://www.ioccc.org).
## Remarks on some of the entries
@@ -30,40 +25,45 @@ because the overall quality of the submissions were so high.
This year we selected the top 4 entries for particularly high honors:
* Gold award - Balanced use of obfuscation
* [Balanced use of obfuscation - Gold Award](zeitak/index.html)
A very extremely subtle and twisted piece of source code!
Even if you start with the zeitak.alt.c source,
you will still have a very challenging time to understand it!
* Silver award - Most elementary use of C
* [Most elementary use of C - Silver Award](hamano/index.html)
A fun program that could also have won "Best abuse of
Ghostscript" because it managed to create some PDF files
that Ghostscript could not read.
* Bronze award - Best use of cocoa
* [Best use of cocoa - Bronze Award](vik/index.html)
A picture within a picture is worth more than a
thousand (4 byte) words. :-)
* Honorable mention - Most complex ASCII fluid
* [Most complex ASCII fluid - Honorable mention](endoh1/index.html)
When you see this program in action, you too will
very likely say [wow](http://bit.ly/R6ALpK) as we did!
very likely say
[wow](https://web.archive.org/web/20240626134108/https://twitter.com/ioccc/status/247140812683628545)
as we did!
But don't ignore the other winning entries! There are games, utilities,
eye candy, calculators and graphical tools to explore.
This year, Yusuke Endoh won with two entries, one of which
([endoh1](endoh1/index.html) entry) won the special Honorable mention award. Eight of
This year, [Yusuke Endoh](../authors.html#Yusuke_Endoh) won with two entries, one of which
([endoh1](endoh1/index.html)) won the special [Honorable
mention](endoh1/index.html) award. Eight of
the winning entries were from people who won in previous years.
This year we had a number of authors from Asia. We saw our second
authors from China and first from Korea. We are pleased to see
This year we had a number of authors from Asia. We saw [our second
entry from China](hou/index.html) and [our first from Korea](kang/index.html). We are pleased to see
outstanding entries from areas of the world that have not been
active in past contests. Will we see an upswing of entries
from South America, Africa and Antarctica next year? :-)
active [in past contests](../years.html). Will we see an upswing of entries
from [South America](https://en.wikipedia.org/wiki/South_America),
[Africa](https://en.wikipedia.org/wiki/Africa) and
[Antarctica](https://en.wikipedia.org/wiki/Antarctica) next year? :-)
Please note that judging is done completely anonymously. Please
do NOT reveal your identity in your source code. In the future we
+18 -17
View File
@@ -392,46 +392,47 @@
on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author’s remarks for even more details.</p>
<p>The IOCCC has a website and now has a number of international mirrors.
The primary site can be found at <a href="https://www.ioccc.org">www.ioccc.org</a>.</p>
<p>Use <code>make</code> to compile entries. It is possible that on non-Unix / non-Linux
systems the Makefile needs to be changed. See the Makefile for details.</p>
<p>Read over the Makefile for compile/build issues. Your system may require
certain changes (add or remove a library, add or remove a <code>#define</code>).</p>
<p>Some ANSI C compilers are not quite as good as they should be. If
yours is lacking, you may need to compile using gcc instead of your
local compiler.</p>
<p>The IOCCC has a website and now has a number of international mirrors.
The primary website can be found at <a href="https://www.ioccc.org">www.ioccc.org</a>.</p>
<h2 id="remarks-on-some-of-the-entries">Remarks on some of the entries</h2>
<p>We believe you will be impressed with this year’s winning entries. We had
a very difficult time picking a single best from among the other entries
because the overall quality of the submissions were so high.</p>
<p>This year we selected the top 4 entries for particularly high honors:</p>
<ul>
<li><p>Gold award - Balanced use of obfuscation</p>
<li><p><a href="zeitak/index.html">Balanced use of obfuscation - Gold Award</a></p>
<p>A very extremely subtle and twisted piece of source code!
Even if you start with the zeitak.alt.c source,
you will still have a very challenging time to understand it!</p></li>
<li><p>Silver award - Most elementary use of C</p>
<li><p><a href="hamano/index.html">Most elementary use of C - Silver Award</a></p>
<p>A fun program that could also have won “Best abuse of
Ghostscript” because it managed to create some PDF files
that Ghostscript could not read.</p></li>
<li><p>Bronze award - Best use of cocoa</p>
<li><p><a href="vik/index.html">Best use of cocoa - Bronze Award</a></p>
<p>A picture within a picture is worth more than a
thousand (4 byte) words. :-)</p></li>
<li><p>Honorable mention - Most complex ASCII fluid</p>
<li><p><a href="endoh1/index.html">Most complex ASCII fluid - Honorable mention</a></p>
<p>When you see this program in action, you too will
very likely say <a href="http://bit.ly/R6ALpK">wow</a> as we did!</p></li>
very likely say
<a href="https://web.archive.org/web/20240626134108/https://twitter.com/ioccc/status/247140812683628545">wow</a>
as we did!</p></li>
</ul>
<p>But don’t ignore the other winning entries! There are games, utilities,
eye candy, calculators and graphical tools to explore.</p>
<p>This year, Yusuke Endoh won with two entries, one of which
(<a href="endoh1/index.html">endoh1</a> entry) won the special Honorable mention award. Eight of
<p>This year, <a href="../authors.html#Yusuke_Endoh">Yusuke Endoh</a> won with two entries, one of which
(<a href="endoh1/index.html">endoh1</a>) won the special <a href="endoh1/index.html">Honorable
mention</a> award. Eight of
the winning entries were from people who won in previous years.</p>
<p>This year we had a number of authors from Asia. We saw our second
authors from China and first from Korea. We are pleased to see
<p>This year we had a number of authors from Asia. We saw <a href="hou/index.html">our second
entry from China</a> and <a href="kang/index.html">our first from Korea</a>. We are pleased to see
outstanding entries from areas of the world that have not been
active in past contests. Will we see an upswing of entries
from South America, Africa and Antarctica next year? :-)</p>
active <a href="../years.html">in past contests</a>. Will we see an upswing of entries
from <a href="https://en.wikipedia.org/wiki/South_America">South America</a>,
<a href="https://en.wikipedia.org/wiki/Africa">Africa</a> and
<a href="https://en.wikipedia.org/wiki/Antarctica">Antarctica</a> next year? :-)</p>
<p>Please note that judging is done completely anonymously. Please
do NOT reveal your identity in your source code. In the future we
may disqualify entries that reveal the identity of the submitter!</p>
+11 -18
View File
@@ -8,20 +8,14 @@ compile the entry and how to run the winning program. Look at the winning
source and try to figure how it does what it does! You may then wish to look at
the Author's remarks for even more details.
The IOCCC has a website and now has a number of international mirrors.
The primary site can be found at [www.ioccc.org](https://www.ioccc.org).
Use `make` to compile entries. It is possible that on non-Unix / non-Linux
systems the Makefile needs to be changed. See the Makefile for details.
Read over the Makefile for compile/build issues. Your system might require
certain changes (add or remove a library, add or remove a `#define` i.e. `-D`
flag).
Some ANSI C compilers are not quite as good as they should be. If
yours is lacking, you may need to compile using gcc instead of your
local compiler.
The IOCCC has a website and now has a number of international mirrors.
The primary website can be found at [www.ioccc.org](https://www.ioccc.org).
## Remarks on some of the entries
@@ -31,13 +25,14 @@ This year, 9 won 15 awards. For the first time in the history of the contest,
one person, [Yusuke Endoh](../authors.html#Yusuke_Endoh) won
4 times while [Adrian Cable](../authors.html#Adrian_Cable)
won 3 times! It is also worth noting that [Chris
Mills](../authors.html#Christopher_Mills) last win was in 1993.
Mills](../authors.html#Christopher_Mills)' last win was in
[1993](../years.html#1993).
Welcome back Chris!
We, the judges, were very surprised by this as many of the multiple
authors submitted very different styles of entries.
This year was the first time the IOCCC size tool was used. Entries
This year was the first time the [IOCCC size tool](%%REPO_URL%%/2013/iocccsize.c) was used. Entries
had to print a value 2053 or less when the `-i` flag was used.
Several people discovered an undocumented feature in that
@@ -57,13 +52,11 @@ or:
were not correctly parsed by the tool. The guidelines stated:
```
In cases where the above summary and the algorithm implemented by
the IOCCC size tool source code conflict, the algorithm implemented
by the IOCCC size tool source code is preferred by the judges.
```
> In cases where the above summary and the algorithm implemented by the IOCCC
size tool source code conflict, the algorithm implemented by the IOCCC size tool
source code is preferred by the judges.
so this abuse was allowed (and encouraged). The judges hope that
... so this abuse was allowed (and encouraged). The judges hope that
the IOCCC size tool author will patch the tool to block this kind
of size abuse in future contests.
+11 -13
View File
@@ -392,27 +392,23 @@
compile the entry and how to run the winning program. Look at the winning
source and try to figure how it does what it does! You may then wish to look at
the Author’s remarks for even more details.</p>
<p>The IOCCC has a website and now has a number of international mirrors.
The primary site can be found at <a href="https://www.ioccc.org">www.ioccc.org</a>.</p>
<p>Use <code>make</code> to compile entries. It is possible that on non-Unix / non-Linux
systems the Makefile needs to be changed. See the Makefile for details.</p>
<p>Read over the Makefile for compile/build issues. Your system might require
certain changes (add or remove a library, add or remove a <code>#define</code> i.e. <code>-D</code>
flag).</p>
<p>Some ANSI C compilers are not quite as good as they should be. If
yours is lacking, you may need to compile using gcc instead of your
local compiler.</p>
<p>The IOCCC has a website and now has a number of international mirrors.
The primary website can be found at <a href="https://www.ioccc.org">www.ioccc.org</a>.</p>
<h2 id="remarks-on-some-of-the-entries">Remarks on some of the entries</h2>
<p>We believe you will again be impressed with this year’s winning entries.</p>
<p>This year, 9 won 15 awards. For the first time in the history of the contest,
one person, <a href="../authors.html#Yusuke_Endoh">Yusuke Endoh</a> won
4 times while <a href="../authors.html#Adrian_Cable">Adrian Cable</a>
won 3 times! It is also worth noting that <a href="../authors.html#Christopher_Mills">Chris
Mills</a> last win was in 1993.
Mills</a>’ last win was in
<a href="../years.html#1993">1993</a>.
Welcome back Chris!</p>
<p>We, the judges, were very surprised by this as many of the multiple
authors submitted very different styles of entries.</p>
<p>This year was the first time the IOCCC size tool was used. Entries
<p>This year was the first time the <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2013/iocccsize.c">IOCCC size tool</a> was used. Entries
had to print a value 2053 or less when the <code>-i</code> flag was used.</p>
<p>Several people discovered an undocumented feature in that
certain comments such as:</p>
@@ -421,10 +417,12 @@ certain comments such as:</p>
<pre><code> *\
/</code></pre>
<p>were not correctly parsed by the tool. The guidelines stated:</p>
<pre><code> In cases where the above summary and the algorithm implemented by
the IOCCC size tool source code conflict, the algorithm implemented
by the IOCCC size tool source code is preferred by the judges.</code></pre>
<p>so this abuse was allowed (and encouraged). The judges hope that
<blockquote>
<p>In cases where the above summary and the algorithm implemented by the IOCCC
size tool source code conflict, the algorithm implemented by the IOCCC size tool
source code is preferred by the judges.</p>
</blockquote>
<p>… so this abuse was allowed (and encouraged). The judges hope that
the IOCCC size tool author will patch the tool to block this kind
of size abuse in future contests.</p>
<p>There were some outstanding entries that did not win. Unfortunately
+6 -16
View File
@@ -8,24 +8,13 @@ compile the entry and how to run the winning program. Look at the winning
source and try to figure how it does what it does! You may then wish to look at
the Author's remarks for even more details.
The IOCCC has a website and now has a number of international mirrors.
The primary site can be found at [www.ioccc.org](https://www.ioccc.org).
Use make to compile entries. It is possible that on non-Unix / non-Linux
systems the Makefile needs to be changed. See the Makefile for details.
Look at the source and try to figure out what the programs do, and run
them with various inputs. If you want to, look at the hints files for
spoilers - this year we included most of the information included
by the submitter.
Read over the README.md for compile/build issues. Your system may require
certain changes (add or remove a library, add or remove a `#define`).
Some ANSI C compilers are not quite as good as they should be. If
yours is lacking, you may need to compile using gcc instead of your
local compiler.
The IOCCC has a website and now has a number of international mirrors.
The primary website can be found at [www.ioccc.org](https://www.ioccc.org).
## Remarks on some of the entries
@@ -36,7 +25,8 @@ This year, 2014:
We, the judges, were very surprised by this as many of the multiple
authors submitted very different styles of entries.
This year was the second time the IOCCC size tool was used. Rule 2
This [year](index.html) was the second time [the IOCCC size
tool](%%REPO_URL%%/2014/iocccsize.c) was used. Rule 2
required that when program source is fed as input to the current IOCCC size
tool, and the IOCCC size tool `-i` command line option is used, the value
printed should be less than or equal to 2053.
@@ -80,7 +70,7 @@ and to post the edited entries to the website. It is our intent that
these changes made during those delays will make releasing future winning IOCCC
entries a faster procedure.
p.s. The final advice given to Landon by his mom: "Have fun."
p.s. The final advice given to Landon by his mom: "_Have fun._"
We recommend following this advice where possible.
+5 -12
View File
@@ -392,25 +392,18 @@
compile the entry and how to run the winning program. Look at the winning
source and try to figure how it does what it does! You may then wish to look at
the Author’s remarks for even more details.</p>
<p>The IOCCC has a website and now has a number of international mirrors.
The primary site can be found at <a href="https://www.ioccc.org">www.ioccc.org</a>.</p>
<p>Use make to compile entries. It is possible that on non-Unix / non-Linux
systems the Makefile needs to be changed. See the Makefile for details.</p>
<p>Look at the source and try to figure out what the programs do, and run
them with various inputs. If you want to, look at the hints files for
spoilers - this year we included most of the information included
by the submitter.</p>
<p>Read over the README.md for compile/build issues. Your system may require
certain changes (add or remove a library, add or remove a <code>#define</code>).</p>
<p>Some ANSI C compilers are not quite as good as they should be. If
yours is lacking, you may need to compile using gcc instead of your
local compiler.</p>
<p>The IOCCC has a website and now has a number of international mirrors.
The primary website can be found at <a href="https://www.ioccc.org">www.ioccc.org</a>.</p>
<h2 id="remarks-on-some-of-the-entries">Remarks on some of the entries</h2>
<p>We believe you will again be impressed with this year’s winning entries.</p>
<p>This year, 2014:</p>
<p>We, the judges, were very surprised by this as many of the multiple
authors submitted very different styles of entries.</p>
<p>This year was the second time the IOCCC size tool was used. Rule 2
<p>This <a href="index.html">year</a> was the second time <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2014/iocccsize.c">the IOCCC size
tool</a> was used. Rule 2
required that when program source is fed as input to the current IOCCC size
tool, and the IOCCC size tool <code>-i</code> command line option is used, the value
printed should be less than or equal to 2053.</p>
@@ -444,7 +437,7 @@ some of the tools needed to package the source for the winning entries to review
and to post the edited entries to the website. It is our intent that
these changes made during those delays will make releasing future winning IOCCC
entries a faster procedure.</p>
<p>p.s. The final advice given to Landon by his mom: “Have fun.”
<p>p.s. The final advice given to Landon by his mom: “<em>Have fun.</em>”
We recommend following this advice where possible.</p>
<h2 id="final-comments">Final Comments</h2>
<p>Please feel free to send us comments and suggestions about the
+12 -25
View File
@@ -9,22 +9,13 @@ source and try to figure how it does what it does! You may then wish to look at
the Author's remarks for even more details. This year we included most of the
information included by the submitter.
The IOCCC has a website and now has a number of international mirrors.
The primary site can be found at [www.ioccc.org](https://www.ioccc.org).
Use `make` to compile entries. It is possible that on non-Unix / non-Linux
systems the Makefile needs to be changed. See the Makefile for details.
Look at the source and try to figure out what the programs do, and run
them with various inputs.
Read over the Makefile for compile/build issues. Your system may require
certain changes (add or remove a library, add or remove a `#define`).
Some ANSI C compilers are not quite as good as they should be. If
yours is lacking, you may need to compile using gcc instead of your
local compiler.
The IOCCC has a website and now has a number of international mirrors.
The primary website can be found at [www.ioccc.org](https://www.ioccc.org).
## Remarks on some of the winning entries
@@ -66,25 +57,21 @@ and 22 (one third of 666).
Rule 22, now known as **Catch 22** states:
```
22) Your source code, data files, remarks and program output must NOT
identify the authors of your code. The judges STRONGLY prefer to
not know who is submitting entries to the IOCCC.
The "Peter Honeyman is exempt" guideline also applies to this rule.
Identifying yourself, in an obvious way in your code, data, remarks
or program output, unless you are Peter Honeyman or pretending
to be Peter Honeyman, will be grounds for disqualification of your entry.
```
> 22) Your source code, data files, remarks and program output must NOT identify
> the authors of your code. The judges STRONGLY prefer to not know who is
> submitting entries to the IOCCC.
>
> The "Peter Honeyman is exempt" guideline also applies to this rule.
> Identifying yourself, in an obvious way in your code, data, remarks or program
> output, unless you are Peter Honeyman or pretending to be Peter Honeyman, will
> be grounds for disqualification of your entry.
A number of other entries were based on [iocccsize.c](%%REPO_URL%%/2015/iocccsize.c), making
derivative works rather than original works.
Still other entries were too large, violating the first line of rule 2:
```
2) The size of your program source must be <= 4096 bytes in length.
```
> 2) The size of your program source must be <= 4096 bytes in length.
While these entries might have passed under the 2053 limit for iocccsize,
they were larger than <= 4096 bytes, sometimes by an order or magnitude.
+18 -17
View File
@@ -393,17 +393,11 @@ compile the entry and how to run the winning program. Look at the winning
source and try to figure how it does what it does! You may then wish to look at
the Author’s remarks for even more details. This year we included most of the
information included by the submitter.</p>
<p>The IOCCC has a website and now has a number of international mirrors.
The primary site can be found at <a href="https://www.ioccc.org">www.ioccc.org</a>.</p>
<p>Use <code>make</code> to compile entries. It is possible that on non-Unix / non-Linux
systems the Makefile needs to be changed. See the Makefile for details.</p>
<p>Look at the source and try to figure out what the programs do, and run
them with various inputs.</p>
<p>Read over the Makefile for compile/build issues. Your system may require
certain changes (add or remove a library, add or remove a <code>#define</code>).</p>
<p>Some ANSI C compilers are not quite as good as they should be. If
yours is lacking, you may need to compile using gcc instead of your
local compiler.</p>
<p>The IOCCC has a website and now has a number of international mirrors.
The primary website can be found at <a href="https://www.ioccc.org">www.ioccc.org</a>.</p>
<h2 id="remarks-on-some-of-the-winning-entries">Remarks on some of the winning entries</h2>
<p>We believe you will again be impressed with this year’s winning entries.</p>
<p>The fraction of worthy entries was higher than usual.</p>
@@ -430,18 +424,25 @@ one of the all time best IOCCC entries from 1984.</p>
would have been much higher had some people paid attention to rules 2
and 22 (one third of 666).</p>
<p>Rule 22, now known as <strong>Catch 22</strong> states:</p>
<pre><code> 22) Your source code, data files, remarks and program output must NOT
identify the authors of your code. The judges STRONGLY prefer to
not know who is submitting entries to the IOCCC.
The &quot;Peter Honeyman is exempt&quot; guideline also applies to this rule.
Identifying yourself, in an obvious way in your code, data, remarks
or program output, unless you are Peter Honeyman or pretending
to be Peter Honeyman, will be grounds for disqualification of your entry.</code></pre>
<blockquote>
<ol start="22" type="1">
<li>Your source code, data files, remarks and program output must NOT identify
the authors of your code. The judges STRONGLY prefer to not know who is
submitting entries to the IOCCC.</li>
</ol>
<p>The “Peter Honeyman is exempt” guideline also applies to this rule.
Identifying yourself, in an obvious way in your code, data, remarks or program
output, unless you are Peter Honeyman or pretending to be Peter Honeyman, will
be grounds for disqualification of your entry.</p>
</blockquote>
<p>A number of other entries were based on <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/iocccsize.c">iocccsize.c</a>, making
derivative works rather than original works.</p>
<p>Still other entries were too large, violating the first line of rule 2:</p>
<pre><code> 2) The size of your program source must be &lt;= 4096 bytes in length.</code></pre>
<blockquote>
<ol start="2" type="1">
<li>The size of your program source must be &lt;= 4096 bytes in length.</li>
</ol>
</blockquote>
<p>While these entries might have passed under the 2053 limit for iocccsize,
they were larger than &lt;= 4096 bytes, sometimes by an order or magnitude.</p>
<p>We hope the authors of some of those entries will fix and re-submit
+13 -27
View File
@@ -9,29 +9,19 @@ source and try to figure how it does what it does! You may then wish to look at
the Author's remarks for even more details. This year we included most of the
information included by the submitter.
The primary site can be found at [www.ioccc.org](https://www.ioccc.org).
Use `make` to compile entries. It is possible that on non-Unix / non-Linux
systems the Makefile needs to be changed. See the Makefile for details.
Look at the source and try to figure out what the programs do, and run
them with various inputs.
Read over the Makefile and index.html files for compile/build issues. Your
system may require certain changes (add or remove a library, add or remove a
`#define`).
Some C compilers are not quite as good as they should be. If yours is
lacking, you may need to compile using clang or gcc instead of your local
compiler.
The primary website can be found at [www.ioccc.org](https://www.ioccc.org).
## Remarks on some of the winning entries
We believe you will again be impressed with this year's winning entries.
The [Best of Show - 2018/mills](mills/index.html) is an amazing tribute to entries
from 1984 and 2015.
from [1984](../1984/index.html) and [2015](../2015/index.html).
Take a close look at the [Most likely to top the charts - 2018/hou](hou/index.html).
Observe that while it contains no variables and no operators, it
@@ -44,7 +34,7 @@ from 1986. Sometimes it takes 20 some years to do things the true IOCCC way.
The color of the remarks text this year was inspired by one of the stars
of the [Most stellar - 2018/poikola](poikola/index.html).
The [Best use of python - 2018/endoh2](endoh2/index.html) is a not what you might think it is.
The [Best use of python - 2018/endoh2](endoh2/index.html) is not what you might think it is.
It is something completely different.
The [Most likely to be awarded - 2018/ciura](ciura/index.html) has an amazing vocabulary!
@@ -63,25 +53,21 @@ and 22 (one third of 666).
Rule 22, now known as "Catch 22" states:
```
22) Your source code, data files, remarks and program output must NOT
identify the authors of your code. The judges STRONGLY prefer to
not know who is submitting entries to the IOCCC.
The "Peter Honeyman is exempt" guideline also applies to this rule.
Identifying yourself, in an obvious way in your code, data, remarks
or program output, unless you are Peter Honeyman or pretending
to be Peter Honeyman, will be grounds for disqualification of your entry.
```
> 22) Your source code, data files, remarks and program output must NOT identify
the authors of your code. The judges STRONGLY prefer to not know who is
submitting entries to the IOCCC.
>
> The "Peter Honeyman is exempt" guideline also applies to this rule.
Identifying yourself, in an obvious way in your code, data, remarks or program
output, unless you are Peter Honeyman or pretending to be Peter Honeyman, will
be grounds for disqualification of your entry.
A number of other entries were based on [iocccsize.c](%%REPO_URL%%/2018/iocccsize.c), making
derivative works rather than original works.
Still other entries were too large, violating the first line of rule 2:
```
2) The size of your program source must be <= 4096 bytes in length.
```
> 2) The size of your program source must be <= 4096 bytes in length.
While these entries might have passed under the 2053 limit for iocccsize,
they were larger than <= 4096 bytes, sometimes by an order or magnitude.
+19 -19
View File
@@ -393,21 +393,14 @@ compile the entry and how to run the winning program. Look at the winning
source and try to figure how it does what it does! You may then wish to look at
the Author’s remarks for even more details. This year we included most of the
information included by the submitter.</p>
<p>The primary site can be found at <a href="https://www.ioccc.org">www.ioccc.org</a>.</p>
<p>Use <code>make</code> to compile entries. It is possible that on non-Unix / non-Linux
systems the Makefile needs to be changed. See the Makefile for details.</p>
<p>Look at the source and try to figure out what the programs do, and run
them with various inputs.</p>
<p>Read over the Makefile and index.html files for compile/build issues. Your
system may require certain changes (add or remove a library, add or remove a
<code>#define</code>).</p>
<p>Some C compilers are not quite as good as they should be. If yours is
lacking, you may need to compile using clang or gcc instead of your local
compiler.</p>
<p>The primary website can be found at <a href="https://www.ioccc.org">www.ioccc.org</a>.</p>
<h2 id="remarks-on-some-of-the-winning-entries">Remarks on some of the winning entries</h2>
<p>We believe you will again be impressed with this year’s winning entries.</p>
<p>The <a href="mills/index.html">Best of Show - 2018/mills</a> is an amazing tribute to entries
from 1984 and 2015.</p>
from <a href="../1984/index.html">1984</a> and <a href="../2015/index.html">2015</a>.</p>
<p>Take a close look at the <a href="hou/index.html">Most likely to top the charts - 2018/hou</a>.
Observe that while it contains no variables and no operators, it
remains functional in what it does.</p>
@@ -416,7 +409,7 @@ short and sweet implementation of a classic utility and a nod to a winning entry
from 1986. Sometimes it takes 20 some years to do things the true IOCCC way.</p>
<p>The color of the remarks text this year was inspired by one of the stars
of the <a href="poikola/index.html">Most stellar - 2018/poikola</a>.</p>
<p>The <a href="endoh2/index.html">Best use of python - 2018/endoh2</a> is a not what you might think it is.
<p>The <a href="endoh2/index.html">Best use of python - 2018/endoh2</a> is not what you might think it is.
It is something completely different.</p>
<p>The <a href="ciura/index.html">Most likely to be awarded - 2018/ciura</a> has an amazing vocabulary!</p>
<p>There are also nods to entries of the years <a href="../2000/bellard/index.html">2000/bellard</a>,
@@ -427,18 +420,25 @@ It is something completely different.</p>
would have been much higher had some people paid attention to rules 2
and 22 (one third of 666).</p>
<p>Rule 22, now known as “Catch 22” states:</p>
<pre><code> 22) Your source code, data files, remarks and program output must NOT
identify the authors of your code. The judges STRONGLY prefer to
not know who is submitting entries to the IOCCC.
The &quot;Peter Honeyman is exempt&quot; guideline also applies to this rule.
Identifying yourself, in an obvious way in your code, data, remarks
or program output, unless you are Peter Honeyman or pretending
to be Peter Honeyman, will be grounds for disqualification of your entry.</code></pre>
<blockquote>
<ol start="22" type="1">
<li>Your source code, data files, remarks and program output must NOT identify
the authors of your code. The judges STRONGLY prefer to not know who is
submitting entries to the IOCCC.</li>
</ol>
<p>The “Peter Honeyman is exempt” guideline also applies to this rule.
Identifying yourself, in an obvious way in your code, data, remarks or program
output, unless you are Peter Honeyman or pretending to be Peter Honeyman, will
be grounds for disqualification of your entry.</p>
</blockquote>
<p>A number of other entries were based on <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2018/iocccsize.c">iocccsize.c</a>, making
derivative works rather than original works.</p>
<p>Still other entries were too large, violating the first line of rule 2:</p>
<pre><code> 2) The size of your program source must be &lt;= 4096 bytes in length.</code></pre>
<blockquote>
<ol start="2" type="1">
<li>The size of your program source must be &lt;= 4096 bytes in length.</li>
</ol>
</blockquote>
<p>While these entries might have passed under the 2053 limit for iocccsize,
they were larger than &lt;= 4096 bytes, sometimes by an order or magnitude.</p>
<p>We hope the authors of some of those entries will fix and re-submit
+5 -15
View File
@@ -8,19 +8,11 @@ on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author's remarks for even more details.
The primary site can be found at [www.ioccc.org](https://www.ioccc.org).
Use `make` to compile entries. It is possible that on non-Unix / non-Linux
systems the Makefile needs to be changed. See the Makefile for details.
Read over the Makefile and index.html files for compile/build issues. Your
system may require certain changes (add or remove a library, add or remove a
`#define`).
Some C compilers are not quite as good as they should be. If yours is
lacking, you may need to compile using clang or gcc instead of your local
compiler.
The primary website can be found at [www.ioccc.org](https://www.ioccc.org).
## Remarks on some of the winning entries
@@ -29,7 +21,7 @@ This year's winning entries are impressive!
The [Most in need of debugging - 2019/endoh](endoh/index.html) is very inventive in
a way it produces its own text!
The [Most likely to be awarded - 2019/ciura](ciura/index.html) has an amazing
The [Most alphabetic- 2019/ciura](ciura/index.html) has an amazing
vocabulary!
There are again nods to entries of the years:
@@ -39,11 +31,9 @@ There are again nods to entries of the years:
These nods to not run afoul of the guideline:
```
We tend to dislike programs that:
...
are rather similar to previous entries
```
> We tend to dislike programs that:
> ...
> are rather similar to previous entries
because the entry [2019/dogon](dogon/index.html) appropriately pays homage
to past entries without blatantly reusing their code.
+7 -10
View File
@@ -392,20 +392,15 @@
on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author’s remarks for even more details.</p>
<p>The primary site can be found at <a href="https://www.ioccc.org">www.ioccc.org</a>.</p>
<p>Use <code>make</code> to compile entries. It is possible that on non-Unix / non-Linux
systems the Makefile needs to be changed. See the Makefile for details.</p>
<p>Read over the Makefile and index.html files for compile/build issues. Your
system may require certain changes (add or remove a library, add or remove a
<code>#define</code>).</p>
<p>Some C compilers are not quite as good as they should be. If yours is
lacking, you may need to compile using clang or gcc instead of your local
compiler.</p>
<p>The primary website can be found at <a href="https://www.ioccc.org">www.ioccc.org</a>.</p>
<h2 id="remarks-on-some-of-the-winning-entries">Remarks on some of the winning entries</h2>
<p>This year’s winning entries are impressive!</p>
<p>The <a href="endoh/index.html">Most in need of debugging - 2019/endoh</a> is very inventive in
a way it produces its own text!</p>
<p>The <a href="ciura/index.html">Most likely to be awarded - 2019/ciura</a> has an amazing
<p>The <a href="ciura/index.html">Most alphabetic- 2019/ciura</a> has an amazing
vocabulary!</p>
<p>There are again nods to entries of the years:</p>
<ul>
@@ -413,9 +408,11 @@ vocabulary!</p>
<li><a href="../2011/blakely/index.html">2011/blakely</a></li>
</ul>
<p>These nods to not run afoul of the guideline:</p>
<pre><code> We tend to dislike programs that:
...
are rather similar to previous entries</code></pre>
<blockquote>
<p>We tend to dislike programs that:
…
are rather similar to previous entries</p>
</blockquote>
<p>because the entry <a href="dogon/index.html">2019/dogon</a> appropriately pays homage
to past entries without blatantly reusing their code.</p>
<p>…We’ll stop spouting spoilers now. Have fun exploring all the entries!</p>
+3 -11
View File
@@ -8,23 +8,15 @@ on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author's remarks for even more details.
The primary site can be found at [www.ioccc.org](https://www.ioccc.org).
Use `make` to compile entries. It is possible that on non-Unix / non-Linux
systems the Makefile needs to be changed. See the Makefile for details.
Read over the Makefile and index.html files for compile/build issues. Your
system may require certain changes (add or remove a library, add or remove a
`#define`).
Some C compilers are not quite as good as they should be. If yours is
lacking, you may need to compile using clang or gcc instead of your local
compiler.
The primary website can be found at [www.ioccc.org](https://www.ioccc.org).
## Remarks on some of the winning entries
This year's [Best of Show - 2020/carlini](carlini/index.html) is such a novel way of
This year's [Best of Show - abuse of libc - 2020/carlini](carlini/index.html) is such a novel way of
obfuscation that it would be worth of a special mention in the (future) Best of
IOCCC list!
@@ -32,7 +24,7 @@ For some reason, this year's set of winning entries contains three nostalgic gam
[Asteroids - 2020/tsoj](tsoj/index.html), [Minesweeper - 2020/endoh1](endoh1/index.html),
and [Snake - 2020/ferguson1](ferguson1/index.html).
An entry, [kurdyukov1](kurdyukov1/index.html), pays homage to previous entry
An entry, [kurdyukov1](kurdyukov1/index.html), pays homage to the previous entry
[2015/hou](../2015/hou/index.html).
...We'll stop spouting spoilers now. Have fun exploring all the entries!
+3 -8
View File
@@ -392,23 +392,18 @@
on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author’s remarks for even more details.</p>
<p>The primary site can be found at <a href="https://www.ioccc.org">www.ioccc.org</a>.</p>
<p>Use <code>make</code> to compile entries. It is possible that on non-Unix / non-Linux
systems the Makefile needs to be changed. See the Makefile for details.</p>
<p>Read over the Makefile and index.html files for compile/build issues. Your
system may require certain changes (add or remove a library, add or remove a
<code>#define</code>).</p>
<p>Some C compilers are not quite as good as they should be. If yours is
lacking, you may need to compile using clang or gcc instead of your local
compiler.</p>
<p>The primary website can be found at <a href="https://www.ioccc.org">www.ioccc.org</a>.</p>
<h2 id="remarks-on-some-of-the-winning-entries">Remarks on some of the winning entries</h2>
<p>This year’s <a href="carlini/index.html">Best of Show - 2020/carlini</a> is such a novel way of
<p>This year’s <a href="carlini/index.html">Best of Show - abuse of libc - 2020/carlini</a> is such a novel way of
obfuscation that it would be worth of a special mention in the (future) Best of
IOCCC list!</p>
<p>For some reason, this year’s set of winning entries contains three nostalgic games,
<a href="tsoj/index.html">Asteroids - 2020/tsoj</a>, <a href="endoh1/index.html">Minesweeper - 2020/endoh1</a>,
and <a href="ferguson1/index.html">Snake - 2020/ferguson1</a>.</p>
<p>An entry, <a href="kurdyukov1/index.html">kurdyukov1</a>, pays homage to previous entry
<p>An entry, <a href="kurdyukov1/index.html">kurdyukov1</a>, pays homage to the previous entry
<a href="../2015/hou/index.html">2015/hou</a>.</p>
<p>…We’ll stop spouting spoilers now. Have fun exploring all the entries!</p>
<h2 id="remarks-on-some-of-submissions-that-did-not-win">Remarks on some of submissions that did not win</h2>
+1 -1
View File
@@ -756,7 +756,7 @@ blockquote {
* headings (h1, h2, ...) is too similar so we use dark green with italics
* as the choice.
*/
.content blockquote p {
.content blockquote p, blockquote ol li {
color: darkgreen;
font-style: italic;
}
+1
View File
@@ -3958,6 +3958,7 @@ implicitly (Linux doesn’t seem to but macOS does).</p>
<div id="2014">
<h1 id="the-23rd-ioccc"><a href="2014/index.html">2014 - The 23rd IOCCC</a></h1>
</div>
<p><a href="#yusuke">Yusuke</a> added the missing <code>rules.txt</code>, <code>iocccsize.c</code> and <code>iocccsize.mk</code> files.</p>
<div id="2014_birken">
<h2 id="winning-entry-2014birken">Winning entry: <a href="2014/birken/index.html">2014/birken</a></h2>
<h3 id="winning-entry-source-code-prog.c">Winning entry source code: <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2014/birken//prog.c">prog.c</a></h3>
+3 -1
View File
@@ -4797,7 +4797,6 @@ it easier for those who do not know how, and to make it more obvious to try it.
# [2013 - The 22nd IOCCC](2013/index.html)
</div>
<div id="2013_birken">
## Winning entry: [2013/birken](2013/birken/index.html)
### Winning entry source code: [birken.c](%%REPO_URL%%/2013/birken//birken.c)
@@ -5053,6 +5052,9 @@ Cody also added the [try.sh](%%REPO_URL%%/2013/morgan1/try.sh) script.
# [2014 - The 23rd IOCCC](2014/index.html)
</div>
[Yusuke](#yusuke) added the missing `rules.txt`, `iocccsize.c` and `
iocccsize.mk` files.
<div id="2014_birken">
## Winning entry: [2014/birken](2014/birken/index.html)