Finding Nemo - 1202: WIP I believe Walls are being correctly made

- small.in is a test case for a 10 * 10 grid with each of the 4 corners cut off.
- grid size is set to 10 * 10 in the main class
Fours - Solved.

The solution to this one is a cool example of code generation /
meta-programming. The steps to create the final program were:
- start with the set of base 4 numbers between 000 and 333 (from bash script)
- substitute mathematical signs in
  - 0 -> +
  - 1 -> -
  - ...
- feed this sequence into the code generator
  - it constructs a condition for each set of opeartions.
- refine the final source file
  - fix syntax, etc.

This is a great example of how you can brute force a problem without necessarily
typing out all cases.
3n+1 problem.

An example of how much more efficient a dynamic solution can be.
Minesweeper, implemented in python.
Minesweeper re-implemented in C.
Input file for "The Trip"