International Obfuscated C Code Contest

From Wikipedia, the free encyclopedia
  (Redirected from Toledo Nanochess)
Jump to navigation Jump to search
International Obfuscated C Code Contest
IOCCC.png
The logo of the IOCCC
StatusActive
GenreCoding contest
BeginsDecember 29, 2017 (2017-12-29)
EndsMarch 15, 2018 (2018-03-15)
FrequencyAnnually
Years active1984–1996, 1998, 2000, 2001, 2004–2006, 2011–present
Inaugurated1984 (1984)
FoundersLandon Curt Noll, Larry Bassel
Websitehttps://www.ioccc.org

The International Obfuscated C Code Contest (abbreviated IOCCC) is a computer programming contest for the most creatively obfuscated C code. Held annually in the years 1984–1996, 1998, 2000, 2001, 2004–2006, 2011–2015 and then in 2018, it is described as "celebrating [C's] syntactical opaqueness".[1] The winning code for the 25th contest, held in 2018, was released in May 2018.[2]

Entries are evaluated anonymously by a panel of judges. The judging process is documented in the competition guidelines[3] and consists of elimination rounds. By tradition, no information is given about the total number of entries for each competition. Winning entries are awarded with a category, such as "Worst Abuse of the C preprocessor" or "Most Erratic Behavior", and then announced on the official IOCCC website. The contest states that being announced on the IOCCC website is the reward for winning.

History[edit]

The IOCCC was started by Landon Curt Noll 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 Bourne shell, which used macros to emulate ALGOL 68 syntax, and buggy version of finger for BSD.[4] The contest itself was the topic of a quiz question in the 1993 Computer Bowl.[5] After a hiatus of five years starting in 2006, the contest returned in 2011.[6]

Compared with other programming contests, the IOCCC is described as "not all that serious" by Michael Swaine, editor of Dr. Dobbs.[7]

Rules[edit]

Each year, the rules of the contest are published on the IOCCC website. Rules vary from year to year and are posted with a set of guidelines that attempt to convey the spirit of the rules.

"Hacking the contest rules is a tradition". Landon Curt Noll, 2011.[6]

The rules are often deliberately written with loopholes that contestants are encouraged to find and abuse.[citation needed] Entries that take advantage of loopholes can cause the rules for the following year's contest to be adjusted.[citation needed]

Obfuscations employed[edit]

Entries often employ strange or unusual tricks, such as using the C preprocessor to do things it was not designed to do, or avoiding commonly used constructs in the C programming language in favor of much more obscure ways of achieving the same thing. Two contest winners generated a list of prime numbers using the C preprocessor "spectacularly", according to Dr. Dobbs.[8] Some quotes from 2004 winners include:

To keep things simple, I have avoided the C preprocessor and tricky statements such as "if", "for", "do", "while", "switch", and "goto".[9]

We still aren't sure whether or not this is a useful program, but it's the first atomic fission we've seen in the IOCCC.[10]

Why not use the program to hide another program in the program? It must have seemed reasonable at the time.[11]

The program implements an 11-bit ALU in the C preprocessor.[12]

I found that calculating prime numbers up to 1024 makes the program include itself over 6.8 million times.[12]

Contributions have included source code formatted to resemble images, text, etc., after the manner of ASCII art, preprocessor redefinitions to make code harder to read, and self-modifying code. In several years, an entry was submitted that required a new definition of some of the rules for the next year.[citation needed] This is regarded as a high honor. An example is the world's shortest self-reproducing program. 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.[13]

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.

Examples[edit]

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.[14]

Toledo Nanochess[edit]

Toledo Nanochess is a chess engine developed by Mexican 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.[15] Because Toledo Nanochess is based on Toledo's winning entry from the 18th IOCCC (Best Game[16]), it is heavily obfuscated.[17]

On February 2, 2014, the author published the book Toledo Nanochess: The commented source code, which contains the fully commented source code.[18]

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 has been broken by Super Micro Chess[19] – a derivative of Micro-Max – totaling 760 characters (spaces and newlines included).[20] A smaller version, Toledo Picochess, consisting of 944 non-blank characters, also exists.

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);}}

Pi[edit]

Below is a 1988 entry which calculates pi by looking at its own area:[21]

#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 K&R C; it does not work correctly in ANSI C without some change.[22])

Flight simulator[edit]

Another example is the following flight simulator, the winner of the 1998 IOCCC,[23] as listed and described in Calculated Bets: Computers, Gambling, and Mathematical Modeling to Win (2001)[24] 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:[23]

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

See also[edit]

Notes and references[edit]

  1. ^ Palmer, Geoff (November 1, 2004). "Beyond the command line". PC World Magazine New Zealand. Archived from the original on February 10, 2013. Retrieved 2013-04-07.
  2. ^ "Previous IOCCC Winners". IOCCC. 2014. Retrieved 2014-01-08.
  3. ^ "2015 Guidelines" (plain text). IOCCC. 2015. Retrieved 2015-11-20.
  4. ^ "FAQ". IOCCC. Retrieved 2011-11-12.
  5. ^ "Top Execs Fail To Compute Correctly". San Jose Mercury News (CA). May 15, 1993. Pg. 1A. Via Newsbank. (subscription required)
  6. ^ a b Jackson, Joab (November 15, 2011). "Obfuscated Code Contest Returns". PCWorld. Retrieved 2013-04-07.
  7. ^ Swaine, Michael (May 1, 2008). "There Must be Contest". Dr Dobb's. Retrieved 2013-04-07.
  8. ^ Spinellis, Diomidis (October 5, 2006). "Code Finessing". Dr Dobb's. Retrieved 2013-04-07.
  9. ^ IOCCC 2004 – Best Calculated Risk. IOCCC. Retrieved 2013-04-08.
  10. ^ IOCCC 2004 – Best abuse of the Periodic table. IOCCC. Retrieved 2013-04-08.
  11. ^ IOCCC 2004 - Best abuse of Indentation. IOCCC. Retrieved 2013-04-08.
  12. ^ a b IOCCC 2004 - Best Abuse of CPP IOCCC. Retrieved 2013-04-08.
  13. ^ "smr.hint" (plain text). IOCCC. 1994. Retrieved 2006-09-16.
  14. ^ "gavin.hint3" (plain text). IOCCC. 2004. Retrieved 2007-03-01.
  15. ^ Toledo Nanochess and Toledo Picochess
  16. ^ Who won the 18th IOCCC
  17. ^ Nanochess partially de-obfuscated version
  18. ^ Toledo Gutiérrez, Oscar (2014). Toledo Nanochess: The commented source code. Lulu. ISBN 978-1-304-86437-6.
  19. ^ http://smmax.sourceforge.net/
  20. ^ Super Micro FIDE 760
  21. ^ 5th International Obfuscated C Code Contest 1988 (westley.c). IOCCC.
  22. ^ 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?]
  23. ^ a b IOCCC Flight Simulator. aerojockey.com. Retrieved 2013-04-08.
  24. ^ Skiena, Steven (2001). Calculated Bets: Computers, Gambling, and Mathematical Modeling to Win. The Mathematical Association of America. pp. 152, 153. ISBN 978-0521009621.

External links[edit]