diff --git a/next/guidelines.html b/next/guidelines.html index e4281b207..003d39ca5 100644 --- a/next/guidelines.html +++ b/next/guidelines.html @@ -528,11 +528,11 @@ ASCII formfeed, and ASCII carriage return.

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.

-

| There are at least 2 other reasons for selecting 2503 as the 2nd limit

-

| besides the fact that 2503 is a prime. These reasons

-

| may be searched for and discovered if you are “Curios!” about 2503. :-)

-

| Moreover, 2053 was the number of the kernel disk pack of one of the

-

| judge’s BESM-6, and 2503 is a decimal anagram of 2053.

+

| There are at least 2 other reasons for selecting 2503 as the 2nd limit
+| besides the fact that 2503 is a prime. These reasons
+| may be searched for and discovered if you are “Curios!” about 2503. :-)
+| Moreover, 2053 was the number of the kernel disk pack of one of the
+| judge’s BESM-6, and 2503 is a decimal anagram of 2053.

Take note that this secondary limit imposed by the IOCCC size tool obviates some of the need to #define C reserved words in an effort to get around the size limits of Rule 2.

@@ -860,8 +860,10 @@ into creating a dense blob. Such are the trade-offs that obfuscators face!

We prefer code that can run on either a 64-bit or 32-bit processor. However, it is unwise to assume it will run on an i386 or x86 architecture.

We believe that Mark Twain’s remark:

-
    Get your facts first, then you can distort them as you please.
-

is a good motto for those writing code for the IOCCC.

+
+

Get your facts first, then you can distort them as you please.

+
+

… is a good motto for those writing code for the IOCCC.

| The IOCCC size tool source is not an original work, unless you are Anthony C Howe, in which case it is original! @@ -886,33 +888,49 @@ following compiler flag:

If there are limitations in your entry, you are highly encouraged to note such limitations in your remarks file. For example if your entry factors values up to a certain size, you might want to state:

-
    This entry factors values up 2305567963945518424753102147331756070.
-    Attempting to factor larger values will produce unpredictable results.
+
+

This entry factors values up 2305567963945518424753102147331756070. +Attempting to factor larger values will produce unpredictable results.

+

The judges might try to factor the value -5, so you want to might state:

-
    This entry factors positive values up 2305567963945518424753102147331756070.
-    Attempting to factor large values will produce unpredictable results.
+
+

This entry factors positive values up 2305567963945518424753102147331756070. +Attempting to factor large values will produce unpredictable results.

+

However the judges might try to also factor 0, so you want to might state:

-
    This entry factors values between 1 and 2305567963945518424753102147331756070.
-    Attempting to factor values outside that range will produce unpredictable results.
+
+

This entry factors values between 1 and 2305567963945518424753102147331756070. +Attempting to factor values outside that range will produce unpredictable +results.

+

Moreover the try to also factor 3.5 or 0x7, or Fred, so you want to might state:

-
    This entry factors integers between 1 and 2305567963945518424753102147331756070.
-    Attempting to factor anything else will produce unpredictable results.
+
+

This entry factors integers between 1 and +2305567963945518424753102147331756070. Attempting to factor anything else will +produce unpredictable results.

+

You entry might be better off catching the attempt to factor bogus values and doing something interesting. So you might want to code accordingly and state:

-
    This entry factors integers between 1 and 2305567963945518424753102147331756070.
-    Attempting to factor anything else will cause the program to insult your
-    pet fish Eric.
+
+

This entry factors integers between 1 and +2305567963945518424753102147331756070. Attempting to factor anything else will +cause the program to insult your pet fish Eric.

+

The judges might not have a pet fish named Eric, so might want to state:

-
    This entry factors integers between 1 and 2305567963945518424753102147331756070.
-    Attempting to factor anything else will cause the program to insult your
-    pet fish Eric, or in the case that you lack such a pet, will insult the
-    pet that you do not have.
+
+

This entry factors integers between 1 and +2305567963945518424753102147331756070. Attempting to factor anything else will +cause the program to insult your pet fish Eric, or in the case that you lack +such a pet, will insult the pet that you do not have.

+

When all other things are equal, an entry with fewer limitation will be judged better than an entry with lots of limitations. So you might want to code accordingly and state:

-
    This entry attempts to a factor value of any size provided that the program
-    is given enough time and memory.  If the value is not a proper integer, the
-    program will insult a fish named Eric, even if such a fish does not exist.
+
+

This entry attempts to a factor value of any size provided that the program is +given enough time and memory. If the value is not a proper integer, the program +will insult a fish named Eric, even if such a fish does not exist.

+

ABUSING THE RULES:

Legal abuse of the IOCCC rules is somewhat encouraged. Legal rule abuse may involve, but is not limited to, doing things that are technically allowed by @@ -1091,12 +1109,11 @@ you are mentioned you will not get a notification.

| The IOCCC news will also contain an announcement of the winners.

An important update to how winners are announced

The IOCCC no longer uses twitter. IOCCC entries will be announced -by a git commit to the IOCCC entries repo:

-
    https://github.com/ioccc-src/winner
-

that, in turn, updates the official IOCCC website:

-
    https://www.ioccc.org/index.html
-

In addition a note is posted to the IOCCC Mastodon account:

-
    https://fosstodon.org/@ioccc
+by a git commit to the IOCCC entries +repo that, in turn, updates the official +IOCCC website.

+

In addition a note is posted to the IOCCC Mastodon +account.

Back to announcement of winners

It is pointless to ask the IOCCC judges how many entries we receive. Other government TLA or FLA snooping organizations are prohibited from diff --git a/next/guidelines.md b/next/guidelines.md index a062d1291..d66acbd6c 100644 --- a/next/guidelines.md +++ b/next/guidelines.md @@ -203,14 +203,10 @@ 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. -**`|`** There are at least 2 other reasons for selecting 2503 as the 2nd limit - -**`|`** besides the fact that 2503 is a prime. These reasons - -**`|`** may be searched for and discovered if you are ["Curios!" about 2503](https://t5k.org/curios/page.php/2503.html). :-) - -**`|`** Moreover, 2053 was the number of the kernel disk pack of one of the - +**`|`** There are at least 2 other reasons for selecting 2503 as the 2nd limit
+**`|`** besides the fact that 2503 is a prime. These reasons
+**`|`** may be searched for and discovered if you are ["Curios!" about 2503](https://t5k.org/curios/page.php/2503.html). :-)
+**`|`** Moreover, 2053 was the number of the kernel disk pack of one of the
**`|`** judge's BESM-6, and 2503 is a decimal anagram of 2053. Take note that this secondary limit imposed by the IOCCC size tool @@ -672,11 +668,9 @@ However, it is unwise to assume it will run on an i386 or x86 architecture. We believe that Mark Twain's remark: -``` - Get your facts first, then you can distort them as you please. -``` +> Get your facts first, then you can distort them as you please. -is a good motto for those writing code for the IOCCC. +... is a good motto for those writing code for the IOCCC. **`|`** The [IOCCC size tool source](https://github.com/ioccc-src/mkiocccentry/blob/master/iocccsize.c) is not an original work, @@ -716,59 +710,47 @@ If there are limitations in your entry, you are highly encouraged to note such limitations in your remarks file. For example if your entry factors values up to a certain size, you might want to state: -``` - This entry factors values up 2305567963945518424753102147331756070. - Attempting to factor larger values will produce unpredictable results. -``` +> This entry factors values up 2305567963945518424753102147331756070. +Attempting to factor larger values will produce unpredictable results. The judges might try to factor the value -5, so you want to might state: -``` - This entry factors positive values up 2305567963945518424753102147331756070. - Attempting to factor large values will produce unpredictable results. -``` +> This entry factors positive values up 2305567963945518424753102147331756070. +Attempting to factor large values will produce unpredictable results. However the judges might try to also factor 0, so you want to might state: -``` - This entry factors values between 1 and 2305567963945518424753102147331756070. - Attempting to factor values outside that range will produce unpredictable results. -``` +> This entry factors values between 1 and 2305567963945518424753102147331756070. +Attempting to factor values outside that range will produce unpredictable +results. Moreover the try to also factor 3.5 or 0x7, or Fred, so you want to might state: -``` - This entry factors integers between 1 and 2305567963945518424753102147331756070. - Attempting to factor anything else will produce unpredictable results. -``` +> This entry factors integers between 1 and +2305567963945518424753102147331756070\. Attempting to factor anything else will +produce unpredictable results. You entry might be better off catching the attempt to factor bogus values and doing something interesting. So you might want to code accordingly and state: -``` - This entry factors integers between 1 and 2305567963945518424753102147331756070. - Attempting to factor anything else will cause the program to insult your - pet fish Eric. -``` +> This entry factors integers between 1 and +2305567963945518424753102147331756070\. Attempting to factor anything else will +cause the program to insult your pet fish Eric. The judges might not have a pet fish named Eric, so might want to state: -``` - This entry factors integers between 1 and 2305567963945518424753102147331756070. - Attempting to factor anything else will cause the program to insult your - pet fish Eric, or in the case that you lack such a pet, will insult the - pet that you do not have. -``` +> This entry factors integers between 1 and +2305567963945518424753102147331756070\. Attempting to factor anything else will +cause the program to insult your pet fish Eric, or in the case that you lack +such a pet, will insult the pet that you do not have. When all other things are equal, an entry with fewer limitation will be judged better than an entry with lots of limitations. So you might want to code accordingly and state: -``` - This entry attempts to a factor value of any size provided that the program - is given enough time and memory. If the value is not a proper integer, the - program will insult a fish named Eric, even if such a fish does not exist. -``` +> This entry attempts to a factor value of any size provided that the program is +given enough time and memory. If the value is not a proper integer, the program +will insult a fish named Eric, even if such a fish does not exist. # ABUSING THE RULES: @@ -996,23 +978,12 @@ you are mentioned you will not get a notification. ## An important update to how winners are announced The IOCCC no longer uses twitter. IOCCC entries will be announced -by a git commit to the IOCCC entries repo: +by a git commit to the [IOCCC entries +repo](https://github.com/ioccc-src/winner) that, in turn, updates the [official +IOCCC website](https://www.ioccc.org/index.html). -``` - https://github.com/ioccc-src/winner -``` - -that, in turn, updates the official IOCCC website: - -``` - https://www.ioccc.org/index.html -``` - -In addition a note is posted to the IOCCC Mastodon account: - -``` - https://fosstodon.org/@ioccc -``` +In addition a note is posted to the [IOCCC Mastodon +account](https://fosstodon.org/@ioccc). ## Back to announcement of winners