title: Quickest Algorithm to write for this?
body: <p>Given a 20x30 'sheet of graph paper' mark any even n number of cells so that every cell has an odd number of marked neighboring cells and so that all the cells connect making one 'piece'
  Neighboring cells are defined as immediately adjacent cells. (All surrounding cells excluding diagonal cells).</p>
  
  <p>I'm having a problem coming up with a clean algorithm. I currently have one and it's very messy and confusing and I just know there has to be a much better way to do it, I'm just not sure how. I'm looking for a quickly implemented algorithm because I don't have much time left to do the program and we have to code it in Ada which isn't a strength of mine.
  I currently am making use of I made like so,
  CanMark(cell); -- Checks if the cell can be marked.
  HasProblem(cell); -- Checks if the cell has an even number of surrounding marked cells.
  HasFix(cell); -- Checks if there is a sequence of cells that can be marked to eliminate currently existing problem.</p>
  
  <p>I don't have the code with me at the moment but I will post when I get home.</p>
  
  <p>Any help would be greatly appreciated.</p>
  
  <p>Sorry for being unclear. I am just asking for a direction not for you to do my problem for me. I feel like this could be done using a graph related algorithm but don't know enough to know for sure. I don't have my code with me right at the moment, but I will certainly post it when I am able to.</p>