International Obfuscated C Code Contest

<h2 id="history">History</h2>
The IOCCC was started by <a href="/facts/Landon_Curt_Noll/QtmQklQ7">Landon Curt Noll</a> and Larry Bassel in 1984 while employed at National Semiconductor's Genix porting group. The idea for the contest came after they compared notes with each other about some poorly written code that they had to fix, notably the <a href="/facts/Bourne_shell/wUCh3Qkl">Bourne shell</a>, which used macros to emulate <a href="/facts/ALGOL_68/NTnc9fy7">ALGOL 68</a> syntax, and a buggy version of <a href="/facts/Finger_(Unix)/5H803ane">finger</a> for BSD.<a class="footnote-ref" id="fnref:4" href="#fn:4">4</a> The contest itself was the topic of a quiz question in the 1993 Computer Bowl.<a class="footnote-ref" id="fnref:5" href="#fn:5">5</a> After a hiatus of five years starting in 2006, the contest returned in 2011.<a class="footnote-ref" id="fnref:6" href="#fn:6">6</a>
Compared with other programming contests, the IOCCC is described as "not all that serious" by <a href="/facts/Michael_Swaine_(technical_author)/IycD11hX">Michael Swaine</a>, editor of <a href="/facts/Dr._Dobb%2527s_Journal/6Qov1hUK">Dr. Dobb's Journal</a>.<a class="footnote-ref" id="fnref:7" href="#fn:7">7</a>

<h2 id="rules">Rules</h2>
Each year, the rules of the contest are published on the IOCCC website. All material is published under <a href="/facts/Creative_Commons_license/6AV3V7UJ">Creative Commons license</a> <a href="/facts/Share-alike/lKVrDBNE">BY-SA</a> 3.0 Unported.<a class="footnote-ref" id="fnref:8" href="#fn:8">8</a> Rules vary from year to year and are posted with a set of guidelines that attempt to convey the spirit of the rules.

<blockquote>Hacking the contest rules is a tradition. — Landon Curt Noll, 2011<a class="footnote-ref" id="fnref:9" href="#fn:9">9</a></blockquote>
The rules are often deliberately written with loopholes that contestants are encouraged to find and abuse.<a class="footnote-ref" id="fnref:10" href="#fn:10">10</a> Entries that take advantage of loopholes can cause the rules for the following year's contest to be adjusted.<a class="footnote-ref" id="fnref:11" href="#fn:11">11</a>

<h2 id="obfuscations-employed">Obfuscations employed</h2>
Entries often employ strange or unusual tricks, such as using the <a href="/facts/C_preprocessor/KuhuxKYP">C preprocessor</a> to do things it was not designed to do (in some cases "spectacularly", according to Dr. Dobbs,<a class="footnote-ref" id="fnref:12" href="#fn:12">12</a> with one entry creating an 11-bit <a href="/facts/Arithmetic_logic_unit/SgIjPzSc">ALU</a> in the C preprocessor<a class="footnote-ref" id="fnref:13" href="#fn:13">13</a>), or avoiding commonly used constructs in the C programming language in favor of much more obscure ways of achieving the same thing.
Contributions have included source code formatted to resemble images, text, etc., after the manner of <a href="/facts/ASCII_art/TmgLtCg5">ASCII art</a>, preprocessor redefinitions to make code harder to read, and <a href="/facts/Self-modifying_code/sbdqYrRp">self-modifying code</a>. In several years an entry was submitted that required a new definition of some of the rules for the next year, regarded as a high honor. An example is the world's shortest <a href="/facts/Quine_(computing)/noybHw3h">self-reproducing program</a>. The entry was a program designed to output its own source code, and which had zero bytes of source code. When the program ran, it printed out zero bytes, equivalent to its source code.<a class="footnote-ref" id="fnref:14" href="#fn:14">14</a>
In the effort to take obfuscation to its extremes, contestants have produced programs which skirt around the edges of C standards, or result in constructs which trigger rarely used code path combinations in compilers. As a result, several of the past entries may not compile directly in a modern compiler, and some may cause crashes.

<h2 id="examples">Examples</h2>
Within the code size limit of only a few kilobytes, contestants have managed to do complicated things – a 2004 winner turned out an operating system.<a class="footnote-ref" id="fnref:15" href="#fn:15">15</a>

<h3>Toledo Nanochess</h3>
Toledo Nanochess is a <a href="/facts/Chess_engine/Co4uBTsS">chess engine</a> created by Mexican software developer Oscar Toledo Gutiérrez, a five-time winner of the IOCCC. In accordance with IOCCC rules, it is 1255 characters long. The author claims that it is the world's smallest chess program written in C.
The source code for Toledo Nanochess and other engines is available.<a class="footnote-ref" id="fnref:16" href="#fn:16">16</a>
Because Toledo Nanochess is based on Toledo's winning entry from the 18th IOCCC (Best Game<a class="footnote-ref" id="fnref:17" href="#fn:17">17</a>), it is heavily <a href="/facts/Obfuscated_code/703yhvVq">obfuscated</a>.<a class="footnote-ref" id="fnref:18" href="#fn:18">18</a>
On February 2, 2014, the author published the book Toledo Nanochess: The commented source code, which contains the fully commented source code.<a class="footnote-ref" id="fnref:19" href="#fn:19">19</a>
As of February 7, 2010, it appears to be one of only two chess engines written in less than 2 kilobytes of C that are able to play full legal chess moves, along with Micro-Max by Dutch physicist H. G. Muller. In 2014 the 1 kilobyte barrier was broken by Super Micro Chess<a class="footnote-ref" id="fnref:20" href="#fn:20">20</a> – a derivative of Micro-Max – totaling 760 characters (spaces and newlines included).<a class="footnote-ref" id="fnref:21" href="#fn:21">21</a> There is also a smaller version of Toledo's engine, the Toledo Picochess, consisting of 944 non-blank characters.
Source code excerpt

B,i,y,u,b,I[411],*G=I,x=10,z=15,M=1e4;X(w,c,h,e,S,s){int t,o,L,E,d,O=e,N=-M*M,K
=78-h<<x,p,*g,n,*m,A,q,r,C,J,a=y?-x:x;y^=8;G++;d=w||s&&s>=h&&v 0,0)>M;do{_ o=I[
p=O]){q=o&z^y _ q<7){A=q--&2?8:4;C=o-9&z?q["& .$ "]:42;do{r=I[p+=C[l]-64]_!w|p
==w){g=q|p+a-S?0:I+S _!r&(q|A<3||g)||(r+1&z^y)>9&&q|A>2){_ m=!(r-2&7))P G[1]=O,
K;J=n=o&z;E=I[p-a]&z;t=q|E-7?n:(n+=2,6^y);Z n<=t){L=r?l[r&7]*9-189-h-q:0 _ s)L
+=(1-q?l[p/x+5]-l[O/x+5]+l[p%x+6]*-~!q-l[O%x+6]+o/16*8:!!m*9)+(q?0:!(I[p-1]^n)+
!(I[p+1]^n)+l[n&7]*9-386+!!g*99+(A<2))+!(E^y^9)_ s>h||1<s&s==h&&L>z|d){p[I]=n,O
[I]=m?*g=*m,*m=0:g?*g=0:0;L-=X(s>h|d?0:p,L-N,h+1,G[1],J=q|A>1?0:p,s)_!(h||s-1|B
-O|i-n|p-b|L<-M))P y^=8,u=J;J=q-1|A<7||m||!s|d|r|o<z||v 0,0)>M;O[I]=o;p[I]=r;m?
*m=*g,*g=0:g?*g=9^y:0;}_ L>N){*G=O _ s>1){_ h&&c-L<0)P L _!h)i=n,B=O,b=p;}N=L;}
n+=J||(g=I+p,m=p<O?g-3:g+2,*m<z|m[O-p]||I[p+=p-O]);}}}}Z!r&q>2||(p=O,q|A>2|o>z&
!r&&++C*--A));}}}Z++O>98?O=20:e-O);P N+M*M&&N>-K+1924|d?N:0;}main(){Z++B<121)*G
++=B/x%x<2|B%x<2?7:B/x&4?0:*l++&31;Z B=19){Z B++<99)putchar(B%x?l[B[I]|16]:x)_
x-(B=F)){i=I[B+=(x-F)*x]&z;b=F;b+=(x-F)*x;Z x-(*G=F))i=*G^8^y;}else v u,5);v u,
1);}}

<h3>Pi</h3>
Below is a 1988 entry which calculates <a href="/facts/Pi/vC0UBj1q">pi</a> by looking at its own <a href="/facts/Area/KsNG1G9t">area</a>:<a class="footnote-ref" id="fnref:22" href="#fn:22">22</a>

#define _ -F<00||--F-OO--;
int F=00,OO=00;main(){F_OO();printf("%1.3f\n",4.*-F/OO/OO);}F_OO()
{
 _-_-_-_
 _-_-_-_-_-_-_-_-_
 _-_-_-_-_-_-_-_-_-_-_-_
 _-_-_-_-_-_-_-_-_-_-_-_-_-_
 _-_-_-_-_-_-_-_-_-_-_-_-_-_-_
 _-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
 _-_-_-_-_-_-_-_-_-_-_-_-_-_-_
 _-_-_-_-_-_-_-_-_-_-_-_-_-_-_
 _-_-_-_-_-_-_-_-_-_-_-_-_-_
 _-_-_-_-_-_-_-_-_-_-_-_
 _-_-_-_-_-_-_-_
 _-_-_-_
}

(This entry was written in <a href="/facts/K%2526R_C/Ky2No763">K&R C</a>; it does not work correctly in ANSI C without some changes.<a class="footnote-ref" id="fnref:23" href="#fn:23">23</a>)

<h3>Flight simulator</h3>
Another example is the following flight simulator, the winner of the 1998 IOCCC,<a class="footnote-ref" id="fnref:24" href="#fn:24">24</a> as listed and described in Calculated Bets: Computers, Gambling, and Mathematical Modeling to Win (2001)<a class="footnote-ref" id="fnref:25" href="#fn:25">25</a> and shown below:

#include <math.h>
#include <sys/time.h>
#include <X11/Xlib.h>
#include <X11/keysym.h>
 double L ,o ,P
 ,_=dt,T,Z,D=1,d,
 s[999],E,h= 8,I,
 J,K,w[999],M,m,O
 ,n[999],j=33e-3,i=
 1E3,r,t, u,v ,W,S=
 74.5,l=221,X=7.26,
 a,B,A=32.2,c, F,H;
 int N,q, C, y,p,U;
 Window z; char f[52]
 ; GC k; main(){ Display*e=
 XOpenDisplay( 0); z=RootWindow(e,0); for (XSetForeground(e,k=XCreateGC (e,z,0,0),BlackPixel(e,0))
; scanf("%lf%lf%lf",y +n,w+y, y+s)+1; y ++); XSelectInput(e,z= XCreateSimpleWindow(e,z,0,0,400,400,
0,0,WhitePixel(e,0) ),KeyPressMask); for(XMapWindow(e,z); ; T=sin(O)){ struct timeval G={ 0,dt*1e6}
; K= cos(j); N=1e4; M+= H*_; Z=D*K; F+=_*P; r=E*K; W=cos( O); m=K*W; H=K*T; O+=D*_*F/ K+d/K*E*_; B=
sin(j); a=B*T*D-E*W; XClearWindow(e,z); t=T*E+ D*B*W; j+=d*_*D-_*F*E; P=W*E*B-T*D; for (o+=(I=D*W+E
*T*B,E*d/K *B+v+B/K*F*D)*_; p<y; ){ T=p[s]+i; E=c-p[w]; D=n[p]-L; K=D*m-B*T-H*E; if(p [n]+w[ p]+p[s
]== 0|K <fabs(W=T*r-I*E +D*P) |fabs(D=t *D+Z *T-a *E)> K)N=1e4; else{ q=W/K *4E2+2e2; C= 2E2+4e2/ K
 *D; N-1E4&& XDrawLine(e ,z,k,N ,U,q,C); N=q; U=C; } ++p; } L+=_* (X*t +P*M+m*l); T=X*X+ l*l+M *M;
 XDrawString(e,z,k ,20,380,f,17); D=v/l*15; i+=(B *l-M*r -X*Z)*_; for(; XPending(e); u *=CS!=N){
 XEvent z; XNextEvent(e ,&z);
 ++*((N=XLookupKeysym
 (&z.xkey,0))-IT?
 N-LT? UP-N?& E:&
 J:& u: &h); --*(
 DN -N? N-DT ?N==
 RT?&u: & W:&h:&J
 ); } m=15*F/l;
 c+=(I=M/ l,l*H
 +I*M+a*X)*_; H
 =A*r+v*X-F*l+(
 E=.1+X*4.9/l,t
 =T*m/32-I*T/24
 )/S; K=F*M+(
 h* 1e4/l-(T+
 E*5*T*E)/3e2
 )/S-X*d-B*A;
 a=2.63 /l*d;
 X+=( d*l-T/S
 *(.19*E +a
 *.64+J/1e3
 )-M* v +A*
 Z)*_; l +=
 K *_; W=d;
 sprintf(f,
 "%5d %3d"
 "%7d",p =l
 /1.7,(C=9E3+
 O*57.3)%0550,(int)i); d+=T*(.45-14/l*
 X-a*130-J* .14)*_/125e2+F*_*v; P=(T*(47
 *I-m* 52+E*94 *D-t*.38+u*.21*E) /1e2+W*
 179*v)/2312; select(p=0,0,0,0,&G); v-=(
 W*F-T*(.63*m-I*.086+m*E*19-D*25-.11*u
 )/107e2)*_; D=cos(o); E=sin(o); } }

This program needs the following command line on a Linux system to be compiled:<a class="footnote-ref" id="fnref:26" href="#fn:26">26</a>

$ cc banks.c -o banks -DIT=XK_Page_Up -DDT=XK_Page_Down \
	-DUP=XK_Up -DDN=XK_Down -DLT=XK_Left -DRT=XK_Right \
	-DCS=XK_Return -Ddt=0.02 -lm -lX11 -L/usr/X11R6/lib

In order to run the binary file (banks) it has to be supplied with a .sc scenery file via <a href="/facts/Standard_input/r92M7Wd4">stdin</a> input:<a class="footnote-ref" id="fnref:27" href="#fn:27">27</a>

$ cat pittsburgh.sc | ./banks

<h3>Akari</h3>
Below is a 2011 entry which downsamples <a href="/facts/Netpbm/JnAKxh8B">PGM</a>, <a href="/facts/Netpbm/JnAKxh8B">PPM</a> images and ASCII art (of Akari from <a href="/facts/YuruYuri/IXBHkmN8">YuruYuri</a>) by Don, Yang:<a class="footnote-ref" id="fnref:28" href="#fn:28">28</a>

 /*
 +
 +
 +
 +
 [ >i>n[t
 */ #include<stdio.h>
 /*2w0,1m2,]_<n+a m+o>r>i>=>(['0n1'0)1;
 */int/**/main(int/**/n,char**m){FILE*p,*q;int A,k,a,r,i/*
 #uinndcelfu_dset<rsitcdti_oa.nhs>i/_*/;char*d="P%" "d\n%d\40%d"/**/
 "\n%d\n\00wb+",b[1024],y[]="yuriyurarararayuruyuri*daijiken**akkari~n**"
 "/y*u*k/riin<ty(uyr)g,aur,arr[a1r2a82*y2*/u*r{uyu}riOcyurhiyua**rrar+*arayra*="
 "yuruyurwiyuriyurara'rariayuruyuriyuriyu>rarararayuruy9uriyu3riyurar_aBrMaPrOaWy^?"
 "*]/f]`;hvroai<dp/f*i*s/<ii(f)a{tpguat<cahfaurh(+uf)a;f}vivn+tf/g*`*w/jmaa+i`ni("/**
 */"i+k[>+b+i>++b++>l[rb";int/**/u;for(i=0;i<101;i++)y[i*2]^="~hktrvg~dmG*eoa+%squ#l2"
 ":(wn\"1l))v?wM353{/Y;lgcGp`vedllwudvOK`cct~[|ju {stkjalor(stwvne\"gt\"yogYURUYURI"[
 i]^y[i*2+1]^4;/*!*/p=(n>1&&(m[1][0]-'-'||m[1][1] !='\0'))?fopen(m[1],y+298):stdin;
 /*y/riynrt~(^w^)],]c+h+a+r+*+*[n>)+{>f+o<r<(-m] =<2<5<64;}-]-(m+;yry[rm*])/[*
 */q=(n<3||!(m[2][0]-'-'||m[2][1]))?stdout /*]{ }[*/:fopen(m[2],d+14);if(!p||/*
 "]<<*-]>y++>u>>+r >+u+++y>--u---r>++i+++" <)<  ;[>-m-.>a-.-i.++n.>[(w)*/!q/**/)
 return+printf("Can " "not\x20open\40%s\40" "" "for\40%sing\n",m[!p?1:2],!p?/*
 o=82]5<<+(+3+1+&.(+ m +-+1.)<)<|<|.6>4>-+(> m- &-1.9-2-)-|-|.28>-w-?-m.:>([28+
 */"read":"writ");for ( a=k=u= 0;y[u]; u=2 +u){y[k++ ]=y[u];}if((a=fread(b,1,1024/*
,mY/R*Y"R*/,p/*U*/)/* R*/ )>/*U{ */ 2&& b/*Y*/[0]/*U*/=='P' &&4==/*"y*r/y)r\}
*/sscanf(b,d,&k,& A,& i, &r)&& ! (k-6&&k -5)&&r==255){u=A;if(n>3){/*
]&<1<6<?<m.-+1>3> +:+ .1>3+++ . -m-) -;.u+=++.1<0< <; f<o<r<(.;<([m(=)/8*/
u++;i++;}fprintf (q, d,k, u >>1,i>>1,r);u = k-5?8:4;k=3;}else
 /*]>*/{(u)=/*{ p> >u >t>-]s >++(.yryr*/+( n+14>17)?8/4:8*5/
 4;}for(r=i=0 ; ;){u*=6;u+= (n>3?1:0);if (y[u]&01)fputc(/*
 <g-e<t.c>h.a r -(-).)8+<1. >;+i.(<)< <)+{+i.f>([180*/1*
 (r),q);if(y[u ]&16)k=A;if (y[u]&2)k--;if(i/*
 ("^w^NAMORI; { I*/==a/*" )*/){/**/i=a=(u)*11
 &255;if(1&&0>= (a= fread(b,1,1024,p))&&
 ")]i>(w)-;} { /i-f-(-m--M1-0.)<{"
 [ 8]==59/* */ )break;i=0;}r=b[i++]
 ;u+=(/**>> *..</<<<)<[[;]**/+8&*
 (y+u))?(10- r?4:2):(y[u] &4)?(k?2:4):2;u=y[u/*
 49;7i\(w)/;} y}ru\=*ri[ ,mc]o;n}trientuu ren (
 */]-(int)'`';} fclose( p);k= +fclose( q);
 /*] <*.na/m*o{ri{ d;^w^;} }^_^}}
 " */ return k- -1+ /*\' '-`*/
 ( -/*}/ */0x01 ); {;{ }}
 ; /*^w^*/ ;}

If the program is run using its own source as the input, the result is:

$ ./akari akari.c 
 
 
 int
 *w,m,_namori=('n');
 #include<stdio.h>/*;hrd"% dnd4%"*/
 /**/int(y),u,r[128*2/*{y}icuhya*rr*rya=
 */];void/**/i(){putchar(u);}int/**/main(/*
 "(n"l)?M5{YlcpvdluvKct[j skao(tve"t"oYRYR"
 */int(w),char**n){for(m =256;--m;r[m]/*
 "<*]y+u>r>u+y-u-r+i+" )  ;>m.a.i+n>()/q*/
 =25<(31&( m -1))||64-( m &192)||2>w?m:(2+
m/*"*,/U// R/)/U * & /Y/0/U/=P &=/"*/)\
&16?m-13 : 13+ m) ;u=+10 ;for(;(m=/*
 *>/()/{ p u t-s +(yy*+ n1>7?/:*/
 getchar ())+1 ;i() ){if(10/*
 "wNMR;{ I/=/" )/{*/==u*1
 )i(); if(m-10){
 u=/*> *./<)[;*/8*
 4;i(); }u=r[ m];}return(
 * *n/*{i ;w; }_}
 ( -*/ *00 ) ; }
$ ./akari akari.c > ./akari.small
$ ./akari ./akari.small 
 
 wm_aoi(n)
 /*ity,,[2*/{}char*y=
 (")M{lpduKtjsa(v""YY"
 "*yuruyuri") ;main(/*
/",U/ R)U* Y0U= ="/\
*/){puts (y+ 17/*
 "NR{I=" ){/=*
 =* */);/*
 **/{ ;;}}
$ 
$ ./akari ./akari.small > ./akari.smaller
$ ./akari ./akari.smaller
 main
(){puts("Y"
"U RU YU "\
"RI" )/*
 */ ;}
$

<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Obfuscated_Perl_Contest/3b0B5IRN">Obfuscated Perl Contest</a></li>
<li><a href="/facts/Underhanded_C_Contest/D3t2K9eS">Underhanded C Contest</a></li>
<li><a href="/facts/Esoteric_programming_language/nyRNfC2P">Esoteric programming language</a></li></ul>
<h2 id="notes-and-references">Notes and references</h2>

<h2 id="external-links">External links</h2>
<ul><li><a href="https://www.ioccc.org/">Official website</a></li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1">Palmer, Geoff (November 1, 2004). "Beyond the command line". PC World New Zealand. Archived from the original on February 10, 2013. Retrieved 2013-04-07. <a href="https://web.archive.org/web/20130210081342/http://pcworld.co.nz/pcworld/pcw.nsf/how-to/beyond-the-command-line" target="_blank">https://web.archive.org/web/20130210081342/http://pcworld.co.nz/pcworld/pcw.nsf/how-to/beyond-the-command-line</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></li>
<li id="fn:2">"Previous IOCCC Winners with spoilers". IOCCC. Retrieved 2023-05-01. <a href="https://www.ioccc.org/years-spoiler.html" target="_blank">https://www.ioccc.org/years-spoiler.html</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></li>
<li id="fn:3">"2015 Guidelines" (plain text). IOCCC. 2015. Retrieved 2023-05-01. <a href="https://www.ioccc.org/2015/guidelines.txt" target="_blank">https://www.ioccc.org/2015/guidelines.txt</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></li>
<li id="fn:4">"The FAQ". IOCCC. Retrieved 2023-05-01. <a href="https://www.ioccc.org/faq.html" target="_blank">https://www.ioccc.org/faq.html</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></li>
<li id="fn:5">"Top Execs Fail To Compute Correctly". San Jose Mercury News, California. May 15, 1993. p. 1A. Via Newsbank. (subscription required) <a href="http://nl.newsbank.com/nl-search/we/Archives?p_product=SJ&s_site=mercurynews&p_multi=SJ&p_theme=realcities&p_action=search&p_maxdocs=200&p_topdoc=1&p_text_direct-0=0EB71B1E74EA9019&p_field_direct-0=document_id&p_perpage=10&p_sort=YMD_date:D&s_trackval=GooglePM" target="_blank">http://nl.newsbank.com/nl-search/we/Archives?p_product=SJ&s_site=mercurynews&p_multi=SJ&p_theme=realcities&p_action=search&p_maxdocs=200&p_topdoc=1&p_text_direct-0=0EB71B1E74EA9019&p_field_direct-0=document_id&p_perpage=10&p_sort=YMD_date:D&s_trackval=GooglePM</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></li>
<li id="fn:6">Jackson, Joab (November 15, 2011). "Obfuscated Code Contest Returns". PC World. Retrieved 2023-05-01. <a href="https://www.pcworld.com/article/478306/obfuscated_code_contest_returns.html" target="_blank">https://www.pcworld.com/article/478306/obfuscated_code_contest_returns.html</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></li>
<li id="fn:7">Swaine, Michael (May 1, 2008). "There Must be Contest". Dr. Dobb's Journal. Retrieved 2023-05-01. <a href="/wiki/Michael_Swaine_(technical_author)" target="_blank">/wiki/Michael_Swaine_(technical_author)</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></li>
<li id="fn:8">IOCCC home page, footer, and in each hint.txt file <a href="https://www.ioccc.org/" target="_blank">https://www.ioccc.org/</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></li>
<li id="fn:9">Jackson, Joab (November 15, 2011). "Obfuscated Code Contest Returns". PC World. Retrieved 2023-05-01. <a href="https://www.pcworld.com/article/478306/obfuscated_code_contest_returns.html" target="_blank">https://www.pcworld.com/article/478306/obfuscated_code_contest_returns.html</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></li>
<li id="fn:10">"2015 Guidelines" (plain text). IOCCC. 2015. Retrieved 2023-05-01. <a href="https://www.ioccc.org/2015/guidelines.txt" target="_blank">https://www.ioccc.org/2015/guidelines.txt</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></li>
<li id="fn:11">"2015 Guidelines" (plain text). IOCCC. 2015. Retrieved 2023-05-01. <a href="https://www.ioccc.org/2015/guidelines.txt" target="_blank">https://www.ioccc.org/2015/guidelines.txt</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></li>
<li id="fn:12">Spinellis, Diomidis (October 5, 2006). "Code Finessing". Dr. Dobb's Journal. Retrieved 2023-05-01. <a href="https://www.drdobbs.com/open-source/code-finessing/193104882?pgno=2" target="_blank">https://www.drdobbs.com/open-source/code-finessing/193104882?pgno=2</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></li>
<li id="fn:13">IOCCC 2004 – Best Abuse of CPP IOCCC. Retrieved 2023-05-01. <a href="https://www.ioccc.org/2004/vik2.hint" target="_blank">https://www.ioccc.org/2004/vik2.hint</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></li>
<li id="fn:14">"smr.hint" (plain text). IOCCC. 1994. Retrieved 2006-09-16. <a href="https://www.ioccc.org/1994/smr.hint" target="_blank">https://www.ioccc.org/1994/smr.hint</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></li>
<li id="fn:15">"gavin.hint3" (plain text). IOCCC. 2004. Retrieved 2023-05-01. <a href="https://www.ioccc.org/2004/gavin.hint" target="_blank">https://www.ioccc.org/2004/gavin.hint</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></li>
<li id="fn:16">"Toledo Nanochess and Toledo Picochess". <a href="https://nanochess.org/chess3.html" target="_blank">https://nanochess.org/chess3.html</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></li>
<li id="fn:17">"Winners: The authors of winning IOCCC entries". <a href="https://www.ioccc.org/winners.html#Oscar_Toledo_G." target="_blank">https://www.ioccc.org/winners.html#Oscar_Toledo_G.</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></li>
<li id="fn:18">"Nanochess partially de-obfuscated version". GitHub. Retrieved 1 May 2023. <a href="https://github.com/bormand/nanochess" target="_blank">https://github.com/bormand/nanochess</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></li>
<li id="fn:19">Toledo Gutiérrez, Oscar (2014). Toledo Nanochess: The commented source code. Lulu. ISBN 978-1-304-86437-6. <a href="978-1-304-86437-6" target="_blank">978-1-304-86437-6</a> <a href="#fnref:19" class="footnote-back-ref">↩</a></li>
<li id="fn:20">"Super Micro Chess Engine - Home Page - Extremely Compact C Source and Executable Program Size". smmax.sourceforge.net. <a href="https://smmax.sourceforge.net" target="_blank">https://smmax.sourceforge.net</a> <a href="#fnref:20" class="footnote-back-ref">↩</a></li>
<li id="fn:21">"Super Micro FIDE 760". <a href="https://sourceforge.net/projects/smmax/files/sm-fide%20760.c/download" target="_blank">https://sourceforge.net/projects/smmax/files/sm-fide%20760.c/download</a> <a href="#fnref:21" class="footnote-back-ref">↩</a></li>
<li id="fn:22">"westley.c", 5th International Obfuscated C Code Contest 1988 <a href="https://www.ioccc.org/1988/westley.c" target="_blank">https://www.ioccc.org/1988/westley.c</a> <a href="#fnref:22" class="footnote-back-ref">↩</a></li>
<li id="fn:23">using gcc, compile with the following command line: $ gcc -traditional-cpp -o r r.c
 or $ gcc -E r.c | sed 's/- -/--/g' > r2.c ; gcc -o r2 r2.c
 (The source file is r.c)[original research?] <a href="/wiki/Wikipedia:No_original_research" target="_blank">/wiki/Wikipedia:No_original_research</a> <a href="#fnref:23" class="footnote-back-ref">↩</a></li>
<li id="fn:24">Carl Banks' Blog: IOCCC Flight Simulator. blog.aerojockey.com. Retrieved 2023-05-01. <a href="https://blog.aerojockey.com/post/iocccsim" target="_blank">https://blog.aerojockey.com/post/iocccsim</a> <a href="#fnref:24" class="footnote-back-ref">↩</a></li>
<li id="fn:25">Skiena, Steven (2001). Calculated Bets: Computers, Gambling, and Mathematical Modeling to Win. The Mathematical Association of America. pp. 152, 153. ISBN 978-0521009621. <a href="978-0521009621" target="_blank">978-0521009621</a> <a href="#fnref:25" class="footnote-back-ref">↩</a></li>
<li id="fn:26">Carl Banks' Blog: IOCCC Flight Simulator. blog.aerojockey.com. Retrieved 2023-05-01. <a href="https://blog.aerojockey.com/post/iocccsim" target="_blank">https://blog.aerojockey.com/post/iocccsim</a> <a href="#fnref:26" class="footnote-back-ref">↩</a></li>
<li id="fn:27">Carl Banks' Blog: IOCCC Flight Simulator. blog.aerojockey.com. Retrieved 2023-05-01. <a href="https://blog.aerojockey.com/post/iocccsim" target="_blank">https://blog.aerojockey.com/post/iocccsim</a> <a href="#fnref:27" class="footnote-back-ref">↩</a></li>
<li id="fn:28">"Winners: The authors of winning IOCCC entries". www.ioccc.org. Retrieved 2023-05-01. <a href="https://www.ioccc.org/years.html#2011_akari" target="_blank">https://www.ioccc.org/years.html#2011_akari</a> <a href="#fnref:28" class="footnote-back-ref">↩</a></li>
</ol>

International Obfuscated C Code Contest open-in-new

International Obfuscated C Code Contest