Algorithm for 2048 (http://gabrielecirulli.github.io/2048/)

gistfile1.c

/******
This algorithm, when followed, will generally score between 3,000 and 4,000 points.
How it works:
The inner loop of alternating left-then-down sorts incoming blocks into a gradient, with largest value blocks in the lower left.
After a while, the top-left to bottom-right diagonals need to be collapsed; This is accomplished with the right-then-down.
The timing of the right-then-down could probably be heavily optimized. The outer up-then-down is to avoid a condition where you
can get stuck forever if all the bottom rows are full.
******/

while(1)
{
  while(!stuck)
  {
    while(!stuck) //This is the condition most likely to yield good results if optimized
    {
      left();
      down();
    }
    right();
    down();
  }
  up();
  down();
}