I built an algorithm in C to play the game 2048 which basically involves swiping up, down, left or right to match tiles. The algorithm uses breadth first search to evaluate all moves to a certain depth and determine which move will lead to the best score. As this game contains a random element expectimax search would have been a better algorithm however the asignment specification asked for breadth first search. Above is the algorithm in action and below a link to the source code (left) or alturnatively you can run the code in your web browser. (right)

Note: I did not code the 2048 game itself (my code can be found in ai.c)