Code golf

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Code golf is a type of recreational computer programming competition in which participants strive to achieve the shortest possible source code that implements a certain algorithm. Code golf should not be confused with sizecoding, a contest to achieve the smallest binary executable code. Playing code golf is known as "golf scripting". Code golf tournaments may also be named with the programming language used (for example Perl golf).

History[edit]

The length of the shortest possible program that produces a given output (in any fixed programming language) is known as the Kolmogorov complexity of the output, and its mathematical study dates to the work of Andrey Kolmogorov in 1963. Code golf, however, can be more general than this, as it often specifies a general input-output transformation that must be performed rather than asking for a single output with no input.

Whilst the term "code golf" was apparently first used in 1999 with Perl,[1] and later popularised through the use of Perl to write a program that performed RSA encryption,[2] similar informal competition was known to have been popular with earlier APL hackers. Today the term has grown to be applied to a wide variety of languages, which has even triggered the creation of dedicated golfing languages.

Etymology[edit]

The term "code golf" is derived from the similarity of its goal with that of conventional golf, where participants seek to achieve the lowest possible score, rather than the highest, as is the standard in most sports and game scoring systems. While the conventional golf players are trying to minimize the number of club strokes needed to complete the course, the code golfers are striving to reduce the number of key strokes necessary to write the program.

Dedicated golfing languages[edit]

Several new languages have been created specifically with code golfing in mind. The most well-known examples include GolfScript and Flogscript, which are Turing-complete languages which provide powerful constructs for concisely expressing ideas in code. Because golfing languages compete for extreme brevity, their design sacrifices readability which is important for practical production environments, and therefore they are often esoteric. Sometimes, however, a language is designed for a practical purpose, but turns out to be suitable for code golf. An example is binary lambda calculus, designed to make algorithmic information theory more concrete, but providing a scheme suitable for code golf.[citation needed] A list of dedicated golfing languages can be found on the wiki for esoteric programming languages.[3]

An example of GolfScript code to print 1000 digits of pi:

;''
6666,-2%{2+.2/@*\/10.3??2*+}*
`50<~\; #truncate for webpage purposes
 -> 3141592653589793238462643383279502884197169399375

Code golf websites have users constantly creating new and unique golfing languages to win code golf challenges.

Types of code golf[edit]

Some code golf questions, such as those posed on general programming sites, may not require implementation in a specific programming language. However, this limits the style of problems that it is possible for the problem designers to pose (for example, by limiting the use of certain language features). In addition, the creation of such "open" questions has resulted in the design of code golf specific programming language dialects such as REBMU (a dialect of REBOL). Both online and live competitions may also include time limits.

Tournaments by language[edit]

Ongoing[edit]

Historical[edit]

See also[edit]

External links[edit]

References[edit]

  1. ^ Greg Bacon (1999-05-28). "Re: Incrementing a value in a slice". Newsgroupcomp.lang.perl.misc. Usenet: 7imnti$mjh$1@info2.uah.edu. Retrieved 2011-07-12. 
  2. ^ Back, Adam. "RSA in 5 lines of perl". Retrieved 2011-01-10. 
  3. ^ "List of dedicated golfing languages on the esowiki". 
  4. ^ "Anarchy Golf". 
  5. ^ "Just Another Golf Coding". 
  6. ^ "Shortening codes". 
  7. ^ "4clojure League". Retrieved 2011-07-24. While the primary purpose of 4clojure.com is to teach Clojure "by doing", you may also choose to compete for the shortest solution. This is affectionately known as code golf: the lower your score the better, get it? If you choose to participate, we'll score your correct solutions based on the number of non-whitespace characters (and some more metrics in the future). We'll also provide a chart showing how you stack up compared to everyone else on the site.