The tag has no wiki summary.

learn more… | top users | synonyms

7
votes
3answers
205 views

Advanced Code Golf - Disk Operations, and File Allocation

Good Afternoon Golfgeneers. This is reasonably long and detailed question. Given what it was asking, it needed to be. If you have any questions, please ask them. If there is anything that isn't ...
2
votes
3answers
400 views

Calculating Resistance (Nerd Sniping)

Good Afternoon Golfers, Our challenge for today is inspired by XKCD comics 356 and 370. We're going to write a program to calculate the resistance of a group of resistors. A forewarning that this is ...
5
votes
2answers
303 views

Drawing 3d nets - Archimedean solids

I have a weakness for 3d nets which when cut out and folded allow you to make 3d shapes out of paper or card. The task is simple, written the shortest program you can that draws nets for the 13 ...
7
votes
4answers
680 views

Breakout in half an hour

When I was a young teen I had a very boastful friend who claimed he could code up breakout (http://en.wikipedia.org/wiki/Breakout_(video_game)) in half an hour. Half an hour later he had done a great ...
-2
votes
1answer
239 views

Emulate an Intel 8086… COMPLETELY [duplicate]

Possible Duplicate: Emulate an Intel 8086 CPU I know that there already is a code golf for this, but that one didn't require much. This one, however, is for masochists only! >:) OK, you ...
13
votes
17answers
1k views

Write a program that is valid after circular character shift

Potentially very difficult, but I've seen some amazing things come out of this site. The goal is to write a program, in any language, that does whatever you want. The catch is that the program must ...
6
votes
3answers
633 views

Use NVM to tenaciously resume operation whenever aborted

We'll be trying to write a program that remembers what it has been doing so far and continues towards its goal if aborted an re-run. This is a tenacious program. It will be using a Non-Volatile Memory ...
3
votes
1answer
344 views

Code Golf: Make a Web Crawler

A Web Crawler is a program that starts with a small list of websites and gets the source code for all of them. It then finds all the links in those source codes, gets the website it links to then puts ...
1
vote
0answers
182 views

Build an Authenticating SMTP Client

The basic parts of SMTP can be implemented in surprising little code. I was able to build an example SMTP client that works with Gmail and Amazon SES in about 320 characters using PHP. Your task is ...
56
votes
8answers
5k views

Emulate an Intel 8086 CPU

Note: A couple of answers have arrived. Consider upvoting newer answers too. Postscript from luser droog C++ from JoeFish Javascript from entirelysubjective C from RichTX C++ from Dave C Haskell ...
1
vote
1answer
720 views

Shortest Way of creating a basic Space Invaders Game in Python

Hello all code golfers: Your challenge is to create a basic version of Space Invaders in Python Rules Program must be not written in Py3K All levels must be randomly generated There must be a HUD ...
24
votes
9answers
1k views

Advanced Code Golf - Write a small HTTP server

Your challenge is to write a code-golf HTTP server that accepts GET requests. It obviously doesn't have to be fully featured, but it must serve files from a directory. Rules: The HTTP server must ...
19
votes
2answers
831 views

Plant a tree and watch it grow

The trees we are growing have some rules that define how they grow: Growth Rules: Trees consist only of branches. Branches are made up of a combination of the following symbols: _, \, |, /, & ...
10
votes
4answers
883 views

Self-Interpreting Interpreter

Based on a comment by George Edison to this question, write the smallest self-interpreting interpreter. You may use the language of your choosing. Empty languages do not count. Your program must be ...
10
votes
1answer
718 views

Self-compiling compiler

This is based on a talk on compilers I listened to a while back, but I unfortunately can't remember when or where. Create the shortest compiler in any language that can compile itself. Target any ...

1 2
15 30 50 per page