From 34524b841c7aef5d0851b81bff9313beb6997d71 Mon Sep 17 00:00:00 2001 From: Cody Boone Ferguson <53008573+xexyl@users.noreply.github.com> Date: Sat, 22 Jun 2024 09:00:33 -0700 Subject: [PATCH] Fixes in html files of 1991 --- 1991/README.md | 20 +++++++++----------- 1991/index.html | 18 ++++++++++-------- 1991/rince/README.md | 2 +- 1991/rince/index.html | 2 +- 1991/westley/README.md | 29 ++++++++++++++++------------- 1991/westley/index.html | 23 ++++++++++++----------- bugs.html | 4 ++-- bugs.md | 4 ++-- 8 files changed, 53 insertions(+), 49 deletions(-) diff --git a/1991/README.md b/1991/README.md index f7dca8c16..9b0dd6e7c 100644 --- a/1991/README.md +++ b/1991/README.md @@ -14,10 +14,10 @@ all of the other entries this year: - [Grand Prize](westley/index.html) by [Brian Westley](../authors.html#Brian_Westley) -- [Most Well Rounded](dds/index.html) by [Diomidis +- [Most well rounded](dds/index.html) by [Diomidis Spinellis](../authors.html#Diomidis_Spinellis) -- [Best Of Show](brnstnd/index.html) by [Daniel J. -Bernstein](../authors.html#Daniel_J._Bernstein) +- [Best of Show](brnstnd/index.html) by [Daniel J. +Bernstein](../authors.html#Daniel_J_Bernstein) Name and address information are separated from the actual program prior to judging. This eliminates any chance that we would bias our @@ -29,7 +29,7 @@ a winning entry for the past 5 years! ## A few notes regarding possible changes to the contest: We did not give awards to some traditional contest categories such as -"Best Layout" or "Worst Abuse of the Rules". We felt that to do so +"_Best Layout_" or "_Worst Abuse of the Rules_". We felt that to do so would deny awards to more deserving entries. These categories have not been eliminated, and will likely be considered in future years. @@ -52,7 +52,7 @@ programs that use these are now portable enough to be valid entries. We may allow programs to make use of the X Window System libs and include files, provided that they can operate with a system running at the level -of at least X11r4. Requiring the use of imake, a specific window manager, +of at least X11r4. Requiring the use of `imake`, a specific window manager, specific display hardware, or a specific user interface (`Openl**k`, `M*tif`, ...) is likely not to be allowed. We will provide a more detailed explanation of our viewpoint in next year's rules. @@ -60,12 +60,10 @@ explanation of our viewpoint in next year's rules. In order to encourage more 'normal' looking C programs, we are considering the following change to the maximum size rule: -``` - Your source, not counting any , , and a character, - and not counting any ';', '{' and '}' character followed by a - character, must be 1536 bytes or less. The entire source, counting all - characters, be 4096 bytes or less. -``` +> Your source, not counting any ``, ``, and a `` character, and +not counting any '`;`', '`{`' and '`}`' character followed by a `` character, +must be 1536 bytes or less. The entire source, counting all characters, be 4096 +bytes or less. Some thought has been given to adding some C++ categories, however this is not likely to happen soon. We are waiting until C++ compilers become diff --git a/1991/index.html b/1991/index.html index 553a29415..dcfd6943c 100644 --- a/1991/index.html +++ b/1991/index.html @@ -399,9 +399,9 @@ all of the other entries this year:

Name and address information are separated from the actual program @@ -412,7 +412,7 @@ as you are to see who has won. Even so, it is worth noting that a winning entry for the past 5 years!

A few notes regarding possible changes to the contest:

We did not give awards to some traditional contest categories such as -“Best Layout” or “Worst Abuse of the Rules”. We felt that to do so +“Best Layout” or “Worst Abuse of the Rules”. We felt that to do so would deny awards to more deserving entries. These categories have not been eliminated, and will likely be considered in future years.

A number of entries made use of the following C pre-processor feature:

@@ -428,16 +428,18 @@ Since this functionality is now available on many systems, we feel that programs that use these are now portable enough to be valid entries.

We may allow programs to make use of the X Window System libs and include files, provided that they can operate with a system running at the level -of at least X11r4. Requiring the use of imake, a specific window manager, +of at least X11r4. Requiring the use of imake, a specific window manager, specific display hardware, or a specific user interface (Openl**k, M*tif, …) is likely not to be allowed. We will provide a more detailed explanation of our viewpoint in next year’s rules.

In order to encourage more ‘normal’ looking C programs, we are considering the following change to the maximum size rule:

-
    Your source, not counting any <space>, <tab>, and a <newline> character,
-    and not counting any ';', '{' and '}' character followed by a <newline>
-    character, must be 1536 bytes or less.  The entire source, counting all
-    characters, be 4096 bytes or less.
+
+

Your source, not counting any <space>, <tab>, and a <newline> character, and +not counting any ‘;’, ‘{’ and ‘}’ character followed by a <newline> character, +must be 1536 bytes or less. The entire source, counting all characters, be 4096 +bytes or less.

+

Some thought has been given to adding some C++ categories, however this is not likely to happen soon. We are waiting until C++ compilers become common place on a wide number of systems. We also need time to brace diff --git a/1991/rince/README.md b/1991/rince/README.md index 11b6eb170..983bc50a8 100644 --- a/1991/rince/README.md +++ b/1991/rince/README.md @@ -104,7 +104,7 @@ Key to map: The general idea of the game is to collect all the diamonds. This must be done in the minimum amount of moves. I've allowed a margin of 5 -moves which brings the moves allowed to `484`. (alter the value of `u` in +moves which brings the moves allowed to `484` (alter the value of `u` in the program to set the max moves allowed). There are two types of boulders. Both can be pushed around, but only diff --git a/1991/rince/index.html b/1991/rince/index.html index 29f3a1189..fb133de58 100644 --- a/1991/rince/index.html +++ b/1991/rince/index.html @@ -461,7 +461,7 @@ enjoyment high.

|

The general idea of the game is to collect all the diamonds. This must be done in the minimum amount of moves. I’ve allowed a margin of 5 -moves which brings the moves allowed to 484. (alter the value of u in +moves which brings the moves allowed to 484 (alter the value of u in the program to set the max moves allowed).

There are two types of boulders. Both can be pushed around, but only the hollow (crushable) ones can be turned into diamonds (by pushing it diff --git a/1991/westley/README.md b/1991/westley/README.md index 61a14a380..599b469b8 100644 --- a/1991/westley/README.md +++ b/1991/westley/README.md @@ -51,7 +51,7 @@ next move, recompile `nextmove.c` and play it again: ## Try: -We have provided the shell script, [ttt](%%REPO_URL%%/1991/westley/ttt.sh), to make it easier to play the +We have provided the shell script, [ttt.sh](%%REPO_URL%%/1991/westley/ttt.sh), to make it easier to play the game: ``` @@ -143,18 +143,21 @@ What happens if you make a move already made? Now go try and draw or better yet win (without cheating which is very easy :-) )! Why is win better than draw? Because everyone knows how to draw: -``` - Professor Falken: Did you ever play tic-tac-toe? - Jennifer Mack: Yeah. Of course. - Falken: But you don't any more. - Jennifer: No. - Falken: Why? - Jennifer: Because it's a boring game. It's always a tie. - Falken: Exactly. There's no way to win. The game itself is pointless. - But back at the International Obfuscated C Code Contest judges' - room they believe that you can win tic-tac-toe, that there can - be acceptable draws. -``` +> **Professor Falken**: Did you ever play **tic-tac-toe**? +> +> **Jennifer Mack**: Yeah. Of course. +> +> **Falken**: But you don't any more. +> +> **Jennifer**: No. +> +> **Falken**: Why? +> +> **Jennifer**: Because it's a boring game. It's always a tie. +> +> **Falken**: Exactly. There's no way to win. The game itself is pointless. But +back at the [International Obfuscated C Code Contest judges' room](../../judges.html) they believe +that you can win tic-tac-toe, that there can be acceptable draws. Try not to cheat (even though it's very easy :-) ), the computer has not learned how to catch you doing it. diff --git a/1991/westley/index.html b/1991/westley/index.html index dcce345bc..3d00b5751 100644 --- a/1991/westley/index.html +++ b/1991/westley/index.html @@ -424,7 +424,7 @@ next move, recompile nextmove.c and play it again:

    make nextmove
     ./nextmove move_location | tee nextmove.c

Try:

-

We have provided the shell script, ttt, to make it easier to play the +

We have provided the shell script, ttt.sh, to make it easier to play the game:

    make ttt
     ./ttt [first_move]  # <- omit first arg to have it move first
@@ -482,16 +482,17 @@ can lose if you cheat. That’s supposed to happen. Can you win any other time?<
 
What happens if you make a move already made?

 
Now go try and draw or better yet win (without cheating which is very easy :-) )!
 Why is win better than draw? Because everyone knows how to draw:

-
    Professor Falken: Did you ever play tic-tac-toe?
-    Jennifer Mack: Yeah. Of course.
-    Falken: But you don't any more.
-    Jennifer: No.
-    Falken: Why?
-    Jennifer: Because it's a boring game. It's always a tie.
-    Falken: Exactly. There's no way to win. The game itself is pointless.
-            But back at the International Obfuscated C Code Contest judges'
-            room they believe that you can win tic-tac-toe, that there can
-            be acceptable draws.

+

+
Professor Falken: Did you ever play tic-tac-toe?

+
Jennifer Mack: Yeah. Of course.

+
Falken: But you don’t any more.

+
Jennifer: No.

+
Falken: Why?

+
Jennifer: Because it’s a boring game. It’s always a tie.

+
Falken: Exactly. There’s no way to win. The game itself is pointless. But
+back at the International Obfuscated C Code Contest judges’ room they believe
+that you can win tic-tac-toe, that there can be acceptable draws.

+

 
Try not to cheat (even though it’s very easy :-) ), the computer has not learned
 how to catch you doing it.

 
Author’s remarks:

diff --git a/bugs.html b/bugs.html
index 93e78cd9e..993dce24b 100644
--- a/bugs.html
+++ b/bugs.html
@@ -1032,8 +1032,8 @@ file does not exist in the directory, this program will very likely crash.

 
Source code: 1991/westley/westley.c

 
Information: 1991/westley/index.html

 
There is a very simple way to always win. The program doesn’t catch you and as
-someone called Cody’s late grandmother said to him: ‘it’s not cheating unless
-you’re caught’. :-)

+someone called Cody’s late grandmother said to him: ‘it’s not cheating unless
+you’re caught’. :-)

 
Please don’t try and fix it as it’s not a bug and was actually documented as a
 possibility. Can you find out how? There’s also a way to make it so that even
 when you’re cheating it ends up winning! Can you figure that out as well?

diff --git a/bugs.md b/bugs.md
index b9025bd99..8296e1b44 100644
--- a/bugs.md
+++ b/bugs.md
@@ -930,8 +930,8 @@ This is a feature, not a bug.
 ### Information: [1991/westley/index.html](1991/westley/index.html)
 
 There is a very simple way to always win. The program doesn't catch you and as
-someone called Cody's late grandmother said to him: 'it's not cheating unless
-you're caught'. :-)
+someone called Cody's late grandmother said to him: '_it's not cheating unless
+you're caught_'. :-)
 
 Please don't try and fix it as it's not a bug and was actually documented as a
 possibility. Can you find out how? There's also a way to make it so that even