private void Check(GridGraph g)
{
Pair start = g.Start;
int x = start.Item1;
int y = start.Item2;
bool left = g.is_wall[x - 1, y];
bool right = g.is_wall[x + 1, y];
bool up = g.is_wall[x, y - 1];
if (!(left || right || up))
{
return;
}
//Console.WriteLine("New: " + g.Complexity());
//Console.WriteLine("Old: " + gg.Complexity());
//TODO proper looping condition?
if (g.Complexity() >= gg.Complexity())
{
valid = true;
copy = true;
}
}
