Author:
Name: Mike Laman
-Location: unknown
Author:
Name: Ed Lycklama
-Location: unknown
Author:
Name: Michael H.
Pawka
Location: unknown
Author:
Name: Jan Stein
-Location: unknown
Author:
Name: Mark Biggar
-Location: unknown
Author:
Name: Spencer Hines
-Location: unknown
Author:
Name: Mark Isaak
-Location: unknown
Author:
Name: Ian Phillipps
-Location: unknown
Author:
Name: Gopi Reddy
-Location: unknown
Author:
Name: Oskar von der
Luehe
Location: unknown
Author:
Name: David Van
Brackle
Location: unknown
Author:
Name: David
Goodenough
Location: unknown
Authors:
Name: James A.
Woods
Location: unknown
Name: ZZ
Name: Karl F. Fox
-Location: unknown
+Location: ZZ
Name: Paul
Eggert
Location: unknown
Author:
Name: Larry Jones
-Location: unknown
Author:
Name: Sean Barrett
-Location: unknown
Author:
Name: Sean Barrett
-Location: unknown
Author:
Name: Sean Barrett
-Location: unknown
Author:
Name: David Gibson
-Location: unknown
Author:
Name: E. Jay
Berkenbilt
Location: unknown
Author:
Name: Mark Plummer
-Location: unknown
Author:
Name: Mark
Schnitzius
Location: unknown
Author:
Name: David Van
Brackle
Location: unknown
Author:
Name: Laurion
Burchall
Location: unknown
Author:
Name: Mark
Schnitzius
Location: unknown
Author:
Name: Andrew T.
Shapiro
Location: unknown
Author:
Name: Jeff Weisberg
-Location: unknown
Author:
Name: Carlos Duarte
-Location: unknown
Authors:
Name: Heather Downs
-Location: unknown
+Location: ZZ
Name: Selene
Makarios
Location: unknown
Authors:
Name: Heather Downs
-Location: unknown
+Location: ZZ
Name: Selene
Makarios
Location: unknown
Author:
Name: Michael
Savastio
Location: unknown
Author:
Name: Mark
Schnitzius
Location: unknown
Authors:
Name: David Van
Brackle
Location: unknown
Name: ZZ
Name: Mark
Schnitzius
Location: unknown
Author:
Name: Thor Eldby
-Location: unknown
Author:
Name: Dean Swift
-Location: unknown
Author:
Name: Frans van
Dorsselaer
Location: unknown
Author:
Name: Mark
Schnitzius
Location: unknown
Author:
Name: Tom Torfs
-Location: unknown
Author:
Name: Glyn Anderson
-Location: unknown
Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)For more information, see: https://creativecommons.org/licenses/by-sa/4.0/
-Authors:
Name: Lord Zarbon
-Location: unknown
+Location: ZZ
Name: Moxen N.
Briddlebane
Location: unknown
Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)For more information, see: https://creativecommons.org/licenses/by-sa/4.0/
-Authors:
Name: Gavin
Buttimore
Location: unknown
Name: ZZ
Name: Thaddaeus
Frogley
Location: GB
Author:
Name: Pierre-Philippe
Coupard
Location: unknown
Author:
Name: Chris King
-Location: unknown
Author:
Name: John Williams
-Location: unknown
./anonymous "ash nazg durhbatuluhk, ash nazg gimbatul, \
- ash nazg thrakatuluhk, agh burzhumh-ishi krimpatul." >ring.pgm
-
-./anonymous "My Precious. Yes, my Precious." > precious.pgm./try.shNOTE: technically the text is supposed to be in all lower case but -the above still works for demonstration purposes.
+the script does use some upper case letters for demonstration +purposes.Did you know that in the first edition of The Hobbit Gollum was
willing to give up the ring? It was not the Ruling Ring, the One Ring,
@@ -162,8 +160,8 @@ href="https://en.wikipedia.org/wiki/The_Lord_of_the_Rings">The Lord of
the Rings what are you waiting for? :-) You’ll find out the source
of the text above though you’ll see that there are some circumflexes
missing! That’s okay though due to I/O of the entry and in earlier
-drafts sometimes the û with an umlaut had no umlaut but H after the
-u it. The real text is:
u
+in it. The real text is:
Ash nazg durbatulûk, ash nazg gimbatul, ash nazg thrakatulûk, agh burzum-ishi krimpatul.
@@ -251,6 +249,9 @@ href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2004/anonymous/Maanonymous.orig.c - original source +try.sh +- how to run 2004_anonymous.tar.bz2 - download winning source diff --git a/2004/gavin/index.html b/2004/gavin/index.html index e9288e05e..6858955a5 100644 --- a/2004/gavin/index.html +++ b/2004/gavin/index.html @@ -114,7 +114,7 @@Author:
+href="/temp-test-ioccc/location.html#ZZ">ZZ
Name: Gavin Barraclough
Location: unknownTo build:
diff --git a/2004/hoyle/index.html b/2004/hoyle/index.html index 7626afd11..bcf660bf8 100644 --- a/2004/hoyle/index.html +++ b/2004/hoyle/index.html @@ -177,6 +177,9 @@ href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2004/hoyle/Makefihoyle.orig.c - original source +try.sh +- how to run 2004_hoyle.tar.bz2 - download winning source diff --git a/2004/newbern/index.html b/2004/newbern/index.html index 0477ccaa6..7328f347a 100644 --- a/2004/newbern/index.html +++ b/2004/newbern/index.html @@ -113,7 +113,7 @@Author:
+Location: ZZ
Name: Jeff Newbern
-Location: unknownTo build:
@@ -170,6 +170,9 @@ href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2004/newbern/newbnewbern.dat - sample input +try.sh +- how to run 2004_newbern.tar.bz2 - download winning source diff --git a/2004/omoikane/index.html b/2004/omoikane/index.html index ad832caba..d32d8b8ed 100644 --- a/2004/omoikane/index.html +++ b/2004/omoikane/index.html @@ -121,7 +121,7 @@ href="/temp-test-ioccc/winners.html#Don_Yang">Don Yang
Location:To use:
./omoikane infile layout outfileTry:
-+./omoikane omoikane.info omoikane.info omoikane.output./try.shJudges’ remarks:
For extra credit, spot the checksum in the source file itself. What makes this one particularly interesting is that the checksum, strictly @@ -252,6 +252,9 @@ href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2004/omoikane/omo
omoikane.info - information about Rinia +try.sh +- how to run 2004_omoikane.tar.bz2 - download winning source diff --git a/2004/schnitzi/index.html b/2004/schnitzi/index.html index b7029de2b..85fe5c103 100644 --- a/2004/schnitzi/index.html +++ b/2004/schnitzi/index.html @@ -114,7 +114,7 @@Author:
+href="/temp-test-ioccc/location.html#ZZ">ZZ
Name: Mark Schnitzius
Location: unknownTo build:
diff --git a/2004/vik1/index.html b/2004/vik1/index.html index 2e5b9ce18..e005f540f 100644 --- a/2004/vik1/index.html +++ b/2004/vik1/index.html @@ -122,10 +122,15 @@ Location: US./vik1 [arg]Try:
+ +./vik1 a + +./vik1 d2 + +./vik1 ad3./vik1 -./vik1 a -./vik1 d2 -./vik1 ad3Can you figure out how to cheat?
+Also see the author’s remarks below for more details on the different +modes/options.
Judges’ remarks:
Daniel Vik has presented a tour de force feature rich X11-based racing game that fit within the contest size limits. Take a glance at diff --git a/2005/anon/index.html b/2005/anon/index.html index 0204a3ee7..99bd52831 100644 --- a/2005/anon/index.html +++ b/2005/anon/index.html @@ -114,7 +114,7 @@
Author:
+href="/temp-test-ioccc/location.html#ZZ">ZZ
Name: Anonymous 2005
Location: unknownTo build:
@@ -134,20 +134,17 @@ anon in bugs.md../anon x y [z]Try:
+ +./anon 3 3 3./anon 4 4 -./anon 3 3 3After a very large number of moves this program will deliberately force itself to destroy its runtime stack. This is the author’s way to prevent you from being frustrated (which might happen as it likes to create unsolvable puzzles just to hook you) and spending too much time playing. :-)
-This is supposed to happen. As is written in the The Jargon -File:
-That's not a bug, that's a feature.If you want to see this in action you can easily do this:
-+yes 'please crash on me :-)' | ./anon 4 4yes 'please crash on me :-)' | ./anon 4 4What happens if you specify a larger board? For instance:
-+yes 'please crash on me :-)' | ./anon 10 10 10yes 'please crash on me :-)' | ./anon 10 10 10If you specify more than three args the program might also crash or do something strange. This might also happen if you specify excessively large board dimensions. Try
100 100 100for instance and @@ -155,10 +152,9 @@ see what happens!Alternate version:
The alternate version uses
vi(m)like movement keys.Alternate build:
-+make altmake altTo compile the version without
-stty(1):+make alt-no_sttymake alt-no_sttyAlternate use:
Use
@@ -190,11 +186,11 @@ the screen.anon.altas you wouldanonwith the change in movements:The program takes 2 or 3 arguments, specifying the dimensions of the board. For example, to play the original version of the Fifteen Puzzle:
-+./anon 4 4./anon 4 4To play with a 3D board, do something like this:
-+./anon 3 3 3./anon 3 3 3WARNING: do NOT run the program with more than 3 command-line arguments. This will trigger a bug that will cause it to crash or do something strange. :-)
@@ -420,7 +416,7 @@ any return value can simply be stored in a well-known location in theMASS.-
if(p,q,r,s)is, in fact, anifstatement. :-) It is equivalent to:+if (p) { q; r } else {s}if (p) { q; r } else {s}Why are
-qandrsplit up? Because it’s cleaner (in whatever twisted sense of the word that can be applied to an IOCCC entry) to implement using boolean expressions. Keep in mind that @@ -447,14 +443,14 @@ body, andiis the index variable (well, the index into they-1define the starting and ending values ofi, andzis the loop body.Zis the post-loop code in the current state. For example:+for(s,i, 0, 10, -some_code , -other_code)for(s,i, 0, 10, +some_code , +other_code)is equivalent to:
-+for (i=0; i<10; i++) { - some_code; -} -other_code;for (i=0; i<10; i++) { + some_code; +} +other_code;Note the “wrong” indentation in the former: the author prefers to write it that way, since the analogy to the usual
forloop is clearer. This is why it’s easier to understand the pre-CPP code, diff --git a/2005/boutines/index.html b/2005/boutines/index.html index d37aabf0d..6745c3fa7 100644 --- a/2005/boutines/index.html +++ b/2005/boutines/index.html @@ -121,25 +121,29 @@ href="/temp-test-ioccc/location.html#FR">FRmakeTo use:
You will need an SVG viewer. -Look here to find some SVG viewer or a +converter like ImageMagick’s +
+convert.Look here to find some SVG Viewer Implementations.
-The following will create an
-SVGfile:+ruby -e '20.times{puts "#{rand} #{rand}"}' | ./boutines > test.svg./boutines < input > output.svgTry:
--./boutines < input.txt > result.svgAfter running the above commands, use ImageMagick’s -
-converttool to convert the images to a png file:-convert test.svg test.png - -convert result.svg result.pngand then open it with your preferred graphics viewer or editor.
++./try.shIf
+rubyis installed try.sh will +generate an SVG file by:+ruby -e '20.times{puts "#{rand} #{rand}"}' | ./boutines > test.svgIt will also create an SVG file with the file input.txt.
+The script will check if
convertis available and if so +it will try converting the SVG file(s) to PNG file(s) which you should +be able to view in most any graphics viewer, editor or web browser.If you have a program that opens SVG files then -you could open the
test.svgfile directly. An example -program is Inkscape. See the test.svg andresult.svg+files directly. An example program is Inkscape. See the list cited above for others.Judges’ remarks:
@@ -283,6 +287,9 @@ href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/boutines/bouinput.txt - sample input +try.sh +- how to run 2005_boutines.tar.bz2 - download winning source diff --git a/2005/persano/index.html b/2005/persano/index.html index 0b458756b..961572061 100644 --- a/2005/persano/index.html +++ b/2005/persano/index.html @@ -124,8 +124,8 @@ href="#alternate-code">alternate code below.To use:
./persano p q [num frames]Try:
--./persano 3 16 > knot3-16.gifOpen the GIF file +
+./try.shOpen the GIF files with a viewer capable of displaying animated GIFs and watch closely at the bottom of the picture (you may need to use gifsicle - a great tool to @@ -225,7 +225,7 @@ this license:
Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)For more information, see: https://creativecommons.org/licenses/by-sa/4.0/
-+
@@ -242,7 +242,7 @@ role="doc-backlink">↩︎
-;)↩︎
Inventory for @@ -262,6 +262,9 @@ href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/persano/pers
persano.orig.c - original source +try.sh +- how to run 2005_persano.tar.bz2 - download winning source diff --git a/2006/borsanyi/index.html b/2006/borsanyi/index.html index c2d4897b1..b13b98779 100644 --- a/2006/borsanyi/index.html +++ b/2006/borsanyi/index.html @@ -127,7 +127,11 @@ href="/bugs.md#2006-borsanyi">2006 borsanyi in bugs.md.To use:
./borsanyi string > file.gifTry:
-+./borsanyi ioccc@example.com > example.gif+./try.shWe recommend you input for the filename
example.gifand +for the stringioccc@example.com. The script will not +overwrite files. It runs the program in a loop until you answer that you +do not wish to make another.Judges’ remarks:
This entry uses a very user-friendly representation of the font it uses (with a few exceptions). Check out the source and see yourself! @@ -206,6 +210,9 @@ href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2006/borsanyi/Mak
borsanyi.orig.c - original source +try.sh +- how to run 2006_borsanyi.tar.bz2 - download winning source diff --git a/2006/grothe/index.html b/2006/grothe/index.html index ce59e30da..c72d83627 100644 --- a/2006/grothe/index.html +++ b/2006/grothe/index.html @@ -121,13 +121,9 @@ Location: USTo use:
./grothe carrier_freq pixelclock horizontal_total < some_input.txtTry:
--./grothe 65000000 10000000 1344 < twinkle.txt… and then put on your “electronic ears”. You may find using a -tunable scanning electronic ear helps.
-There are other text files you may wish to try:
-+./grothe 65000000 10000000 1344 < arabian.txt -./grothe 65000000 10000000 1344 < olympics.txt -./grothe 65000000 10000000 1344 < test.txtPut on your “electronic ears” and then try:
++./try.shYou may find using a tunable scanning electronic ear helps.
Judges’ remarks:
Most of the time, interference is annoying. This entry is the exception that proves the rule. What is a bug to some is a feature to @@ -146,9 +142,9 @@ horizontal_total - total scan along the horizontal axis
If you have
-xvidtuneinstalled you can get thepixelclockandhorizontal_totalwith the following command+xvidtune -show | head -n 1 | awk '{ print "pixelclock " $2 * 1000000 " horizontal_total = " $6 }'xvidtune -show | head -n 1 | awk '{ print "pixelclock " $2 * 1000000 " horizontal_total = " $6 }'Example from my laptops:
-+./grothe 65000000 10000000 1344 < twinkle.txt./grothe 65000000 10000000 1344 < twinkle.txtEven if the user gets a setting off, the sound will usually be able to be heard on AM at a @@ -245,6 +241,9 @@ href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2006/grothe/olymp href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2006/grothe/test.txt">test.txt - sample input
try.sh +- how to run +twinkle.txt - sample input 2006_grothe.tar.bz2 - download diff --git a/2006/monge/index.html b/2006/monge/index.html index 1dc6d9284..4d86d674e 100644 --- a/2006/monge/index.html +++ b/2006/monge/index.html @@ -132,37 +132,35 @@ STATUS: INABIAF - please **DO NOT** fix monge in bugs.md. To use:
-./monge expression ...Try:
-./monge "z = 0" "z = z*z*z + c; Abs2(z) < 4"Incorrect formulas will ungracefully crash the program.
-This is supposed to happen. As is written in the The Jargon -File:
-+That's not a bug, that's a feature.Try:
+./try.shAlternate code:
This alternate code lets you specify the width and height of the image as well as the number of iterations to perform.
Alternate build:
To use the default values, the same as monge.c, just do:
-+make altmake altBut if you wish to actually make use of it you will want to redefine one or more of the variables
-W,HandI. The defaults are (respectively) 400, 300 and \128. If you wish to change the image size to 500x500 but keep the iterations the same then do:+make clobber WIDTH=500 HEIGHT=500 altmake clobber WIDTH=500 HEIGHT=500 altIf you wish to keep the dimensions the same but change the iterations to 512:
-+make clobber ITERATIONS=512 altmake clobber ITERATIONS=512 altIf you specify a value less than 1 for any of these it sets it back to the default. The value 1 was selected arbitrarily and such a small number as 1 will not do anything useful but as long as it’s at least 1 -it’ll not be redefined. Does not try taking care of overflows but such -large values would be impractical anyway.
+it’ll not be redefined. It does not try taking care of overflows but +such large values would be impractical anyway.Alternate use:
Use
+monge.altexactly as you wouldmongeabove.Alternate try:
+./try.alt.shJudges’ remarks:
For those who are familiar with the previous IOCCC winners, this program is best described @@ -359,6 +357,12 @@ href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2006/monge/monge.
monge.orig.c - original source +try.alt.sh +- how to run alternative code +try.sh +- how to run 2006_monge.tar.bz2 - download winning source diff --git a/2006/stewart/index.html b/2006/stewart/index.html index 6f9d0eadc..ab91e61f0 100644 --- a/2006/stewart/index.html +++ b/2006/stewart/index.html @@ -133,16 +133,15 @@ number.NOTE:
convert(1)belongs to ImageMagick.Try:
--./stewart 400 1000000 maze > maze.xbm -convert maze.xbm maze.png - -./stewart 1024 1000000 gasket > gasket.xbm -convert gasket.xbm gasket.png - -./stewart 1024 1500000 dragon3 > dragon3.xbm -convert dragon3.xbm dragon3.pngNow open the images in your favourite graphics viewer or a web -browser.
++./try.shAfter running the program on a few files it will ask you if you wish +to run it on the remaining files.
+The script will try converting the xbm files created by the program +to png files. If it does it will list those that exist in the directory, +at the end of the script. If you do not have
convert(1)it +will warn you once. In that case you’ll have to open the xbm files in a +graphics viewer capable of viewing xbm images. In any case choose your +favourite graphics viewer to look at the images created.Judges’ remarks:
Note the interesting choice of using a
#definein the output. The selection of input files makes this one endlessly fun to @@ -281,6 +280,9 @@ href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2006/stewart/stew href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2006/stewart/build">build - how to compiletry.sh +- how to run +altar - sample input FI Cox, Regular Expression Matching: the Virtual Machine Approach↩︎ - +To build:
+makeThere is an alt version based on the author’s remarks. The try.sh script will compile and use both but if you +wish to see the alternate version specifically see the Alternate code section below.
Bugs and (Mis)features:
The current status of this entry is:
@@ -129,10 +133,14 @@ sykes1 in bugs.md.STATUS: INABIAF - please **DO NOT** fixTry:
./sykes1 10Refresh your browser.
+You might also try:
++./try.shThis will run both the original entry and the alt code to show some +differences.
Also try:
If you have all day :-) and wish to find out how fast your machine can solve the maximum:
-+time ./sykes1 19186time ./sykes1 19186This was done on a Rocky Linux 9.2 server with
@@ -143,10 +151,23 @@ sys 0m0.002sIntel(R) Core(TM) i9-9900K CPU @ 3.60GHzwith 16 cores (via HyperThreading):+real 7m10.786s user 7m8.322s sys 0m0.110sAlternate code:
+This alternate code is based on the author’s remarks.
+Alternate build:
++make altAlternate use:
+Use
+sykes1.altas you wouldsykes1+above.Alternate try:
+The try.sh script will use both versions to show +some differences. You can do so like:
+./try.shJudges’ remarks:
Read the sykes1.html page source. Now then read the C source. Confused? :-) If it’s not clear try:
-+diff -s sykes1.c sykes1.htmldiff -s sykes1.c sykes1.htmlFor extra credit, understand what happens when you give this entry an negative number argument, and why.
See the author’s remarks for how to make your own shapes as well.
@@ -158,15 +179,15 @@ href="http://en.wikipedia.org/wiki/Bedlam_cube">article about these puzzles in wikipedia.Some instructions on how to make your own cube are in the included file bedlam-cubes.pdf.
-Finally, you can watch it being solved at https://www.youtube.com/watch?v=a8s1AcYMLBc.
+Finally, you can watch it being solved with the video file here, solving-bedlam-cube.mp4.
Actually the cube is very hard to do by hand by just trying to fit it together. I have not known anyone to solve it in this way - you would need to be very lucky indeed to stumble across a solution.
Instructions
Compile the program, then test that it works:
-+./sykes1./sykes1Shortly you should see the first solution pop out on your screen. It shows you how to build the cube piece by piece, rendered in glorious 3D ASCII.
@@ -177,24 +198,24 @@ helpfully contains an html document that should make the browser display for you a nice animated GIF, showing you how to build the cube. Rendered in glorious 3D color.Want to see another solution? Try:
-+./sykes1 some_number./sykes1 some_numberThe program will discard solutions up to the number, and output numbered solution. Refresh your browser window to see the new solution.
Try some more - there are exactly
19186solutions to choose from.If you have a fast machine you might try the last solution:
-+./sykes1 19186./sykes1 19186On my machine this takes about half an hour to run.
Implementation
The implementation is an optimized recursive algorithm that tries to fit the pieces into the cube one by one. The cube pieces are defined near the start of the program:
-+int s[ ] = { 186, 94, 1426, 3098 - ,1047 , 122 , 1082 , 3083 , 1039 - , 569 , 527 , 1054 , 531 } ;int s[ ] = { 186, 94, 1426, 3098 + ,1047 , 122 , 1082 , 3083 , 1039 + , 569 , 527 , 1054 , 531 } ;Each piece is a bitmap, and represents a 3x3x3 cube.
For instance the first piece is
186- this is010111010in binary. Written out like this you can see that @@ -229,7 +250,7 @@ the pieces, and provided that a solution is possible, it will be found.For example, if you modify line 13 of the source like this, the program will solve for a different piece set:
-+int s[ ] = { 187, 94, 402, 3098int s[ ] = { 187, 94, 402, 3098And of course you can make your own.
After the pieces are defined, the first thing the program does it to fit them into a 4x4 cube. It collects every possible placing of each of diff --git a/2012/hou/index.html b/2012/hou/index.html index 8cbf22601..308e5f3bb 100644 --- a/2012/hou/index.html +++ b/2012/hou/index.html @@ -218,7 +218,7 @@ this license:
Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)For more information, see: https://creativecommons.org/licenses/by-sa/4.0/
-
@@ -234,7 +234,7 @@ href="#fnref2" class="footnote-back" role="doc-backlink">↩︎
Inventory for diff --git a/2014/deak/index.html b/2014/deak/index.html index 509bcd8bd..58a45f3c8 100644 --- a/2014/deak/index.html +++ b/2014/deak/index.html @@ -113,7 +113,7 @@
Author:
+Location: ZZ
Name: Ferenc Deak
-Location: unknownTo build:
diff --git a/2015/endoh1/index.html b/2015/endoh1/index.html index 551f2365e..797867a0b 100644 --- a/2015/endoh1/index.html +++ b/2015/endoh1/index.html @@ -303,7 +303,7 @@ this license:Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)For more information, see: https://creativecommons.org/licenses/by-sa/4.0/
-+
@@ -331,7 +331,7 @@ href="http://www.rfc-editor.org/info/rfc4648" class="uri">http://www.rfc-editor.org/info/rfc4648.↩︎
-Inventory for