## Wednesday, July 31, 2013

This software, it's code, or any fan fiction resulting from its enormous popularity, is provided "AS IS". That means that the software included with with this license is provided without warranty, regardless of any previous verbal contract you may have swindled out of the author with your fast words on the phone...
To the maximum extent permitted by law, the author of this software disclaims all liability for any damages, lost profits, lost socks, lost puppies, hair loss, or architectural fanaticism and cults that may occur as a result of using this software. Under no circumstances shall the author of this software, nor his pet cat 'Mr.Whiskers', be held legally, financially or morally liable for any claim of damages or liability resulting from the use of, abstinence from, ritualistic worshiping of, or illegal pirating of this software. This includes, but is not limited to, lost profits, stolen data, bankruptcy, autonomous homicidal cyborgs or man-eating miniature pony attacks.
Use at your own risk! This software comes with no guarantees of fitness for any purpose, so do not use it for the back-end of your fortune 500 business without at least hiring me first.

## Saturday, July 27, 2013

### Information entropy and data compression

In my last post, I talked about Shannon data entropy and showed a class to calculate that. Lets take it one step further and actually compress some data based off the data entropy we calculated.

To do this, first we calculate how many bits are needed to compress each byte of our data. Theoretically, this is the data entropy, rounded up to the next whole number (Math.Ceiling). But this is not always the case, and the number of unique symbols in our data may be a number that is too large to be represented in that many number of bits. We calculate the number of bits needed to represent the number of unique symbols by getting its Base2 logarithm. This returns a decimal (double), so we use Math.Ceiling to round to up to the nearest whole number as well. We set entropy_Ceiling to which ever number is larger. If the entropy_Ceiling is 8, then we should immediately return, as we cannot compress the data any further.

We start by making a compression and decompression dictionary. We make these by taking the sorted distribution dictionary (DataEntropyUTF8.GetSortedDistribution) and start assigning X-bit-length value to each entry in the sorted distribution dictionary, with X being entropy_Ceiling. The compression dictionary has a byte as the key and an array of bool (bool[]) as the value, while the decompression dictionary has an array of bool as the key, and a byte as a value. You'll notice in the decompression dictionary we store the array of bool as a string, as using an actual array as a key will not work, as the dictionary's EqualityComparer will not assign the same hash code for two arrays of the same values.

Then, compression is as easy as reading each byte, and getting the value from the compression dictionary for that byte and adding it to a list of bool (List), then converting that array of bool to an array of bytes.

Decompression consists of converting the compressed array of bytes into an array of bool, then reading in X bools at a time and getting the byte value from the decompression library, again with X being entropy_Ceiling.

But first, to make this process easier, and to make our code more manageable and readable, I define several extension methods to help us out, since .NET provides almost no support for working with data on the bit level, besides the BitArray class. Here are the extension methods that to make working with bits easier:
``````
public static class BitExtentionMethods
{
//
// List<bool> extention methods
//
public static List<bool> ToBitList(this byte source)
{
List<bool> temp = ( new BitArray(source.ToArray()) ).ToList();
temp.Reverse();
return temp;
}

public static List<bool> ToBitList(this byte source,int startIndex)
{
if(startIndex<0 || startIndex>7) {
return new List<bool>();
}
return source.ToBitList().GetRange(startIndex,(8-startIndex));
}

//
// bool[] extention methods
//
public static string GetString(this bool[] source)
{
string result = string.Empty;
foreach(bool b in source)
{
if(b) {
result += "1";
} else {
result += "0";
}
}
return result;
}

public static bool[] ToBitArray(this byte source,int MaxLength)
{
List<bool> temp = source.ToBitList(8-MaxLength);
return temp.ToArray();
}

public static bool[] ToBitArray(this byte source)
{
return source.ToBitList().ToArray();
}

//
// BYTE extention methods
//
public static byte[] ToArray(this byte source)
{
List<byte> result = new List<byte>();
return result.ToArray();
}

//
// BITARRAY extention methods
//
public static List<bool> ToList(this BitArray source)
{
List<bool> result = new List<bool>();
foreach(bool bit in source)
{
}
return result;
}

public static bool[] ToArray(this BitArray source)
{
}
}
``````
Remember, these need to be the base class in a namespace, not in a nested class.

Now, we are free to write our compression/decompression class:
``````
public class BitCompression
{
// Data to encode
byte[] data;
// Compressed data
byte[] encodeData;
// # of bits needed to represent data
int encodeLength_Bits;
// Original size before padding. Decompressed data will be truncated to this length.
int decodeLength_Bits;
// Bits needed to represent each byte (entropy rounded up to nearist whole number)
int entropy_Ceiling;
// Data entropy class
DataEntropyUTF8 fileEntropy;
// Stores the compressed symbol table
Dictionary<byte,bool[]> compressionLibrary;
Dictionary<string,byte> decompressionLibrary;

void GenerateLibrary()
{
byte[] distTable = new byte[fileEntropy.Distribution.Keys.Count];
fileEntropy.Distribution.Keys.CopyTo(distTable,0);

byte bitSymbol = 0x0;
bool[] bitBuffer = new bool[entropy_Ceiling];
foreach(byte symbol in distTable)
{
bitBuffer = bitSymbol.ToBitArray(entropy_Ceiling);
bitSymbol++;
}
}

public byte[] Compress()
{
// Error checking
if(entropy_Ceiling>7 || entropy_Ceiling<1) {
return data;
}

// Compress data using compressionLibrar
List<bool> compressedBits = new List<bool>();
foreach(byte bite in data) {    // Take each byte, find the matching bit array in the dictionary
}
decodeLength_Bits = compressedBits.Count;

// Pad to fill last byte
while(compressedBits.Count % 8 != 0) {
}
encodeLength_Bits = compressedBits.Count;

// Convert from array of bits to array of bytes
List<byte> result = new List<byte>();
int count = 0;
int shift = 0;
int offset= 0;
int stop  = 0;
byte current = 0;
do
{
stop = encodeLength_Bits - count;
stop = 8 - stop;
if(stop<0) {
stop = 0;
}
if(stop<8)
{
shift = 7;
offset = count;
current = 0;

while(shift>=stop)
{
current |= (byte)(Convert.ToByte(compressedBits[offset]) << shift);
shift--;
offset++;
}

count += 8;
}
} while(count < encodeLength_Bits);

encodeData = result.ToArray();
return encodeData;
}

public byte[] Decompress(byte[] compressedData)
{
// Error check
if(compressedData.Length<1) {
return null;
}

// Convert to bit array for decompressing
List<bool> bitArray = new List<bool>();
foreach(byte bite in compressedData) {
}

// Truncate to original size, removes padding for byte array
int diff = bitArray.Count-decodeLength_Bits;
if(diff>0) {
bitArray.RemoveRange(decodeLength_Bits-1,diff);
}

// Decompress
List<byte> result = new List<byte>();
int count = 0;
do
{
bool[] word = bitArray.GetRange(count,entropy_Ceiling).ToArray();

count+=entropy_Ceiling;
} while(count < bitArray.Count);

return result.ToArray();
}

public BitCompression(string filename)
{
compressionLibrary  = new Dictionary<byte, bool[]>();
decompressionLibrary = new Dictionary<string, byte>();

if(!File.Exists(filename))  {
return;
}

fileEntropy = new DataEntropyUTF8();
fileEntropy.ExamineChunk(data);

int unique  = (int)Math.Ceiling(Math.Log((double)fileEntropy.UniqueSymbols,2f));
int entropy = (int)Math.Ceiling(fileEntropy.Entropy);

entropy_Ceiling = Math.Max(unique,entropy);
encodeLength_Bits   = data.Length * entropy_Ceiling;

GenerateLibrary();
}
}
``````

Please feel free to comment with ideas, suggestions or corrections.

## Monday, July 22, 2013

### Information Shannon Entropy

Shannon/data entropy is a measurement of uncertainty. Entropy can be used as a measure of randomness. Data entropy is typically expressed as the number of bits needed to encode or represent data. In the example below, we are working with bytes, so the max entropy for a stream of bytes is 8.

A file with high entropy means that each symbol is more-or-less equally as likely to appear next. If a file or file stream has high entropy, it is either probably compressed, encrypted or random. This can be used to detect packed executables, cipher streams on a network, or a breakdown of encrypted communication on a network that is expected to be always encrypted.

A text file will have low entropy. If a file has low data entropy, it mean that the file will compress well.

This post and code was inspired by Mike Schiffman's excelent explaination of data entropy on his Cisco Security Blog.

Here is what I wrote:
``````
using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;

namespace DataEntropy
{
public class DataEntropyUTF8
{
// Stores the number of times each symbol appears
SortedList<byte,int>        distributionDict;
// Stores the entropy for each character
SortedList<byte,double> probabilityDict;
// Stores the last calculated entropy
double overalEntropy;
// Used for preventing unnecessary processing
bool isDirty;
// Bytes of data processed
int dataSize;

public int DataSampleSize
{
get { return dataSize; }
private set { dataSize = value; }
}

public int UniqueSymbols
{
get { return distributionDict.Count; }
}

public double Entropy
{
get { return GetEntropy(); }
}

public Dictionary<byte,int> Distribution
{
get { return GetSortedDistribution(); }
}

public Dictionary<byte,double> Probability
{
get { return GetSortedProbability(); }
}

public byte GetGreatestDistribution()
{
return distributionDict.Keys[0];
}

public byte GetGreatestProbability()
{
return probabilityDict.Keys[0];
}

public double GetSymbolDistribution(byte symbol)
{
return distributionDict[symbol];
}

public double GetSymbolEntropy(byte symbol)
{
return probabilityDict[symbol];
}

Dictionary<byte,int> GetSortedDistribution()
{
List<Tuple<int,byte>> entryList = new List<Tuple<int, byte>>();
foreach(KeyValuePair<byte,int> entry in distributionDict)
{
}
entryList.Sort();
entryList.Reverse();

Dictionary<byte,int> result = new Dictionary<byte, int>();
foreach(Tuple<int,byte> entry in entryList)
{
}
return result;
}

Dictionary<byte,double> GetSortedProbability()
{
List<Tuple<double,byte>> entryList = new List<Tuple<double,byte>>();
foreach(KeyValuePair<byte,double> entry in probabilityDict)
{
}
entryList.Sort();
entryList.Reverse();

Dictionary<byte,double> result = new Dictionary<byte,double>();
foreach(Tuple<double,byte> entry in entryList)
{
}
return result;
}

double GetEntropy()
{
// If nothing has changed, dont recalculate
if(!isDirty) {
return overalEntropy;
}
// Reset values
overalEntropy = 0;
probabilityDict = new SortedList<byte,double>();

foreach(KeyValuePair<byte,int> entry in distributionDict)
{
// Probability = Freq of symbol / # symbols examined thus far
entry.Key,
(double)distributionDict[entry.Key] / (double)dataSize
);
}

foreach(KeyValuePair<byte,double> entry in probabilityDict)
{
// Entropy = probability * Log2(1/probability)
overalEntropy += entry.Value * Math.Log((1/entry.Value),2);
}

isDirty = false;
return overalEntropy;
}

public void ExamineChunk(byte[] chunk)
{
if(chunk.Length<1 || chunk==null) {
return;
}

isDirty = true;
dataSize += chunk.Length;

foreach(byte bite in chunk)
{
if(!distributionDict.ContainsKey(bite))
{
continue;
}
distributionDict[bite]++;
}
}

public void ExamineChunk(string chunk)
{
ExamineChunk(StringToByteArray(chunk));
}

byte[] StringToByteArray(string inputString)
{
char[] c = inputString.ToCharArray();
IEnumerable<byte> b = c.Cast<byte>();
return b.ToArray();
}

void Clear()
{
isDirty = true;
overalEntropy = 0;
dataSize = 0;
distributionDict = new SortedList<byte, int>();
probabilityDict = new SortedList<byte, double>();
}

public DataEntropyUTF8(string fileName)
{
this.Clear();
if(File.Exists(fileName))
{
GetEntropy();
GetSortedDistribution();
}
}

public DataEntropyUTF8()
{
this.Clear();
}
}
}
``````

## Sunday, July 21, 2013

### C# developer humor - Chuck Norris.

These jokes were inspired by this link. I have modified them a bit to apply to the C or C# language.

• Chuck Nor­ris can make a class that is both abstract and constant.
• Chuck Nor­ris seri­al­izes objects straight into human skulls.
• Chuck Nor­ris doesn’t deploy web appli­ca­tions, he round­house kicks them into the server.
• Chuck Nor­ris always uses his own design pat­terns, and his favorite is the Round­house Kick.
• Chuck Nor­ris always programs using unsafe code.
• Chuck Nor­ris only enumerates roundhouse kicks to the face.
• Chuck Nor­ris demon­strated the mean­ing of float.PositiveInfinity by count­ing to it, twice.
• A lock statement doesn’t pro­tect against Chuck Nor­ris, if he wants the object, he takes it.
• Chuck Nor­ris doesn’t use VisualStudio, he codes .NET by using a hex edi­tor on the MSIL.
• When some­one attempts to use one of Chuck Nor­ris’ dep­re­cated meth­ods, they auto­mat­i­cally get a round­house kick to the face at com­pile time.
• Chuck Nor­ris never has a bug in his code, without exception!
• Chuck Nor­ris doesn’t write code. He stares at a com­puter screen until he gets the progam he wants.
• Code runs faster when Chuck Nor­ris watches it.
• Chuck Nor­ris meth­ods don't catch excep­tions because no one has the guts to throw any at them.
• Chuck Nor­ris will cast a value to any type, just by star­ing at it.
• If you catch { } a Chuc­kNor­ri­sEx­cep­tion, you’ll prob­a­bly die.
• Chuck Norris’s code can round­house kick all other classes' privates.
• C#'s vis­i­bil­ity lev­els are pub­lic, private, pro­tected, and “pro­tected by Chuck Nor­ris”. Don’t try to access a field with this last modifier!
• Chuck Nor­ris can divide by 0!
• The garbage col­lec­tor only runs on Chuck Nor­ris code to col­lect the bodies.
• Chuck Nor­ris can exe­cute 64bit length instruc­tions in a 32bit CPU.
• To Chuck Nor­ris, all other classes are IDisposable.
• Chuck Nor­ris can do mul­ti­ple inher­i­tance in C#.
• MSBuild never throws excep­tions to Chuck Nor­ris, not any­more. 753 killed Microsoft engi­neers is enough.
• Chuck Nor­ris doesn’t need unit tests, because his code always work. ALWAYS.
• Chuck Nor­ris has been coding in gener­ics since 1.1.
• Chuck Nor­ris’ classes can’t be decom­piled... don’t bother trying.

Here are some originals:
• If you try derive from a Chuck Norris Interface, you'll only get an IRoundhouseKick in-the-face.
• Chuck Nor­ris can serialize a dictionary to XML without implementing IXMLSerializable.
• Chuck Norris can decompile your assembly by only reading the MSIL.

## Tuesday, July 16, 2013

### Convert a Class or List of Class to a DataTable, using reflection.

Note by author:

Since writing this, I have expanded on this idea quite a bit. I have written a lightweight ORM class library that I call EntityJustWorks.

The full project can be found on
GitHub or CodePlex.

EntityJustWorks not only goes from a class to DataTable (below), but also provides:

Security Warning:
This library generates dynamic SQL, and has functions that generate SQL and then immediately executes it. While it its true that all strings funnel through the function Helper.EscapeSingleQuotes, this can be defeated in various ways and only parameterized SQL should be considered SAFE. If you have no need for them, I recommend stripping semicolons ; and dashes --. Also there are some Unicode characters that can be interpreted as a single quote or may be converted to one when changing encodings. Additionally, there are Unicode characters that can crash .NET code, but mainly controls (think TextBox). You almost certainly should impose a white list:
string clean = new string(dirty.Where(c => "abcdefghijklmnopqrstuvwxyz0123456789.,\"_ !@".Contains(c)).ToArray());

PLEASE USE the SQLScript.StoredProcedure and DatabaseQuery.StoredProcedure classes to generate SQL for you, as the scripts it produces is parameterized. All of the functions can be altered to generate parameterized instead of sanitized scripts. Ever since people have started using this, I have been maintaining backwards compatibility. However, I may break this in the future, as I do not wish to teach one who is learning dangerous/bad habits. This project is a few years old, and its already showing its age. What is probably needed here is a total re-write, deprecating this version while keep it available for legacy users after slapping big warnings all over the place. This project was designed to generate the SQL scripts for standing up a database for a project, using only MY input as data. This project was never designed to process a USER'S input.! Even if the data isn't coming from an adversary, client/user/manually entered data is notoriously inconsistent. Please do not use this code on any input that did not come from you, without first implementing parameterization. Again, please see the SQLScript.StoredProcedure class for inspiration on how to do that.

This class uses generics to accepts a class type, and uses reflection to determine the name and type of the class's public properties. With that, a new DataTable is made and the DataColumnCollection is fleshed out. Then you can add rows to the DataTable by passing instances of the class with it's property fields containing values.

Finally, we serialize the DataTable to an XML file, save it's Schema, then load it all back in again as a proof of concept.

Usage example:
``````
List<Order> orders = new List<Order>();

// Fill in orders here ...

// Convert class to DataTable
DataTable ordersTable = ClassListToDataTable(orders);

// Set DataGrid's DataSource to DataTable
dataGrid1.DataSource = ordersTable;
``````

Here is the Code:
``````
public static DataTable ClassToDataTable<T>() where T : class
{
Type classType = typeof(T);

List<PropertyInfo> propertyList = classType.GetProperties().ToList();
if (propertyList.Count < 1)
{
return new DataTable();
}

string className = classType.UnderlyingSystemType.Name;
DataTable result = new DataTable(className);

foreach (PropertyInfo property in propertyList)
{
DataColumn col = new DataColumn();
col.ColumnName = property.Name;

Type dataType = property.PropertyType;

if (IsNullable(dataType))
{
if(dataType.IsGenericType)
{
dataType = dataType.GenericTypeArguments.FirstOrDefault();
}
}
else
{   // True by default
col.AllowDBNull = false;
}

col.DataType = dataType;

}

return result;
}

public static DataTable ClassListToDataTable<T>(List<T> ClassList) where T : class
{
DataTable result = ClassToDataTable<T>();

if(result.Columns.Count < 1)
{
return new DataTable();
}
if(ClassList.Count < 1)
{
return result;
}

foreach(T item in ClassList)
{
ClassToDataRow(ref result, item);
}

return result;
}

public static void ClassToDataRow<T>(ref DataTable Table, T Data) where T : class
{
Type classType = typeof(T);
string className = classType.UnderlyingSystemType.Name;

// Checks that the table name matches the name of the class.
// There is not required, and it may be desirable to disable this check.
// Comment this out or add a boolean to the parameters to disable this check.
if (!Table.TableName.Equals(className))
{
return;
}

DataRow row = Table.NewRow();
List<PropertyInfo> propertyList = classType.GetProperties().ToList();

foreach (PropertyInfo prop in propertyList)
{
if (Table.Columns.Contains(prop.Name))
{
if (Table.Columns[prop.Name] != null)
{
row[prop.Name] = prop.GetValue(Data, null);
}
}
}
}

public static bool IsNullable(Type Input)
{
if (!Input.IsValueType) return true; // Is a ref-type, such as a class
if (Nullable.GetUnderlyingType(Input) != null) return true; // Nullable
return false; // Must be a value-type
}
``````

Here is an example of how to serialize a DataTable to XML, and load it back again
``````
string filePath = "order1.xml";
string schemaPath = Path.ChangeExtension(filePath,".xsd");

ordersTable.WriteXml(filePath);
ordersTable.WriteXmlSchema(schemaPath);

// Set DataGrid's DataSource
dataGrid1.DataSource = dataTable;
``````

The full project and source code for EntityJustWorks can be found on GitHub and CodePlex.

## Tuesday, July 9, 2013

### Procedural generation of cave-like maps for rogue-like games

This post is about procedural content generation of cave-like dungeons/maps for rogue-like games using what is known as the Cellular Automata method.

To understand what I mean by cellular automata method, imagine Conway's Game of Life. Many algorithms use what is called the '4-5 method', which means a tile will become a wall if it is a wall and 4 or more of its nine neighbors are walls, or if it is not a wall and 5 or more neighbors are walls. I start by filling the map randomly with walls or space, then visit each x/y position iteratively and apply the 4-5 rule. Usually this is preceded with 'seeding' the map by randomly filling each cell of the map with a wall or space, based on some weight (say, 40% of the time it chooses to place a wall). Then the automata step is applied multiple times over the entire map, precipitating walls and subsequently smoothing them. About 3 rounds is all that is required, with about 4-5 rounds being pretty typical amongst most implementations. Perhaps a picture of the the output will help you understand what I mean.

Using the automata-based method for procedural generation of levels will produce something similar to this:

Sure the dungeon generation by linking rooms approach has its place, but I really like the 'natural' look to the automata inspired method. I first originally discovered this technique on the website called Roguebasin. It is a great resource for information concerning the different problems involved with programming a rogue-like game, such as Nethack or Angband.

One of the major problems developers run into while employing this technique is the formation of isolated caves. Instead of one big cave-like room, you may get section of the map that is inaccessible without digging through walls. Isolated caves can trap key items or (worse) stairs leading to the next level, preventing further progress in the game. I have seen many different approaches proposed to solve this problem. Some suggestions I've seen include: 1) Discarding maps that have isolated caves, filling in the isolated sections, or finely tweaking the variables/rules to reduce occurrences of such maps. None of these are ideal (in my mind), and most require a way to detect isolated sections, which is another non-trivial problem in itself.

Despite this, I consider the problem solved because I have discovered a solution that is dead simple and almost** never fail because of the rules of the automata generation itself dictate such. I call my method 'Horizontal Blanking' because you can probably guess how it works now just from hearing the name. This step comes after the random filling of the map (initialization), but before the cellular automata iterations. After the map is 'seeded' with a random fill of walls, a horizontal strip in the middle of of the map is cleared of all walls. The horizontal strip is about 3 or 4 block tall (depending on rules). Clearing a horizontal strip of sufficient width will prevent a continuous vertical wall from being created and forming isolated caves in your maps. After horizontal blanking, you can begin applying the cellular automata method to your map.

** I say 'almost' because although it it not possible to get whole rooms that are disconnected from each other, it is possible to get tiny squares of blank space in the northern or southern walls that consist of about 4-5 blocks in total area. Often, these little holes will resolve themselves during the rounds of automata rules, but there still exists the possibility that one may persist. My answer to this edge case would be to use some rules around the placement of stairwells (and other must-find items) dictating that such objects must have a 2-3 block radius clear of walls to be placed.

See below for the code that produced the above screenshot, or click here to download the entire project with source code that you can compile yourself.
``````
public class MapHandler
{
Random rand = new Random();

public int[,] Map;

public int MapWidth   { get; set; }
public int MapHeight  { get; set; }
public int PercentAreWalls { get; set; }

public MapHandler()
{
MapWidth = 40;
MapHeight = 21;
PercentAreWalls = 40;

RandomFillMap();
}

public void MakeCaverns()
{
// By initilizing column in the outter loop, its only created ONCE
for(int column=0, row=0; row <= MapHeight-1; row++)
{
for(column = 0; column <= MapWidth-1; column++)
{
Map[column,row] = PlaceWallLogic(column,row);
}
}
}

public int PlaceWallLogic(int x,int y)
{

if(Map[x,y]==1)
{
if( numWalls >= 4 )
{
return 1;
}
return 0;
}
else
{
if(numWalls>=5)
{
return 1;
}
}
return 0;
}

public int GetAdjacentWalls(int x,int y,int scopeX,int scopeY)
{
int startX = x - scopeX;
int startY = y - scopeY;
int endX = x + scopeX;
int endY = y + scopeY;

int iX = startX;
int iY = startY;

int wallCounter = 0;

for(iY = startY; iY <= endY; iY++) {
for(iX = startX; iX <= endX; iX++)
{
if(!(iX==x && iY==y))
{
if(IsWall(iX,iY))
{
wallCounter += 1;
}
}
}
}
return wallCounter;
}

bool IsWall(int x,int y)
{
// Consider out-of-bound a wall
if( IsOutOfBounds(x,y) )
{
return true;
}

if( Map[x,y]==1  )
{
return true;
}

if( Map[x,y]==0  )
{
return false;
}
return false;
}

bool IsOutOfBounds(int x, int y)
{
if( x<0 data-blogger-escaped-else="" data-blogger-escaped-if="" data-blogger-escaped-return="" data-blogger-escaped-true="" data-blogger-escaped-x="" data-blogger-escaped-y="">MapWidth-1 || y>MapHeight-1 )
{
return true;
}
return false;
}
``````
Above is the main core of the logic.

Here is the rest of the program, such as filling, printing and blanking:
``````
public void PrintMap()
{
Console.Clear();
Console.Write(MapToString());
}

string MapToString()
{
string returnString = string.Join(" ", // Seperator between each element
"Width:",
MapWidth.ToString(),
"\tHeight:",
MapHeight.ToString(),
"\t% Walls:",
PercentAreWalls.ToString(),
Environment.NewLine
);

List<string> mapSymbols = new List();

for(int column=0,row=0; row < MapHeight; row++ ) {
for( column = 0; column < MapWidth; column++ )
{
returnString += mapSymbols[Map[column,row]];
}
returnString += Environment.NewLine;
}
return returnString;
}

public void BlankMap()
{
for(int column=0,row=0; row < MapHeight; row++) {
for(column = 0; column < MapWidth; column++) {
Map[column,row] = 0;
}
}
}

public void RandomFillMap()
{
// New, empty map
Map = new int[MapWidth,MapHeight];

int mapMiddle = 0; // Temp variable
for(int column=0,row=0; row < MapHeight; row++) {
for(column = 0; column < MapWidth; column++)
{
// If coordinants lie on the edge of the map
// (creates a border)
if(column == 0)
{
Map[column,row] = 1;
}
else if (row == 0)
{
Map[column,row] = 1;
}
else if (column == MapWidth-1)
{
Map[column,row] = 1;
}
else if (row == MapHeight-1)
{
Map[column,row] = 1;
}
// Else, fill with a wall a random percent of the time
else
{
mapMiddle = (MapHeight / 2);

if(row == mapMiddle)
{
Map[column,row] = 0;
}
else
{
Map[column,row] = RandomPercent(PercentAreWalls);
}
}
}
}
}

int RandomPercent(int percent)
{
if(percent>=rand.Next(1,101))
{
return 1;
}
return 0;
}

public MapHandler(int mapWidth, int mapHeight, int[,] map, int percentWalls=40)
{
this.MapWidth = mapWidth;
this.MapHeight = mapHeight;
this.PercentAreWalls = percentWalls;
this.Map = new int[this.MapWidth,this.MapHeight];
this.Map = map;
}
}
``````

And of course, the main function:
``````
public static void Main(string[] args)
{
char key  = new Char();
MapHandler Map = new MapHandler();

string instructions =
"[Q]uit [N]ew [+][-]Percent walls [R]andom [B]lank" + Environment.NewLine +
"Press any other key to smooth/step";

Map.MakeCaverns();
Map.PrintMap();
Console.WriteLine(instructions);

while(!key.Equals('Q'))
{
if(key.Equals('+')) {
Map.PercentAreWalls+=1;
Map.RandomFillMap();
Map.MakeCaverns();
Map.PrintMap();
} else if(key.Equals('-')) {
Map.PercentAreWalls-=1;
Map.RandomFillMap();
Map.MakeCaverns();
Map.PrintMap();
} else if(key.Equals('R')) {
Map.RandomFillMap();
Map.PrintMap();
} else if(key.Equals('N')) {
Map.RandomFillMap();
Map.MakeCaverns();
Map.PrintMap();
} else if(key.Equals('B')) {
Map.BlankMap();
Map.PrintMap();
} else if(key.Equals('D')) {
// I set a breakpoint here...
} else {
Map.MakeCaverns();
Map.PrintMap();
}
Console.WriteLine(instructions);