title: Building an EFFICIENT Sudoku Solver
body: <p>Yes, I know this is nothing new and there are many questions already out there (it even has its own tag), but I'd like to create a Sudoku Solver in Java solely for the purpose of training myself to write code that is more efficient.</p>
  
  <p>Probably the easiest way to do this in a program is have a ton of for loops parse through each column and row, collect the possible values of each cell, then weed out the cells with only one possibility (whether they contain only 1 number, or they're the only cell in their row/column that contains this number) until you have a solved puzzle. Of course, a sheer thought of the action should raise a red flag in every programmer's mind.</p>
  
  <p>What I'm looking for is the methodology to go about solving this sucker in the most efficient way possible (please try not to include too much code - I want to figure that part out, myself). </p>
  
  <p>I want to avoid mathematical algorithms if at all possible - those would be too easy and 100% not my work.</p>
  
  <p>If someone could provide a step-by-step, efficient thought process for solving a Sudoku puzzle (whether by a human or computer), I would be most happy :). I'm looking for something that's vague (so it's a challenge), but informative enough (so I'm not totally lost) to get me started.</p>
  
  <p>Many thanks,</p>
  
  <p>Justian Meyer</p>
  
  <p><strong>EDIT:</strong></p>
  
  <p>Looking at my code, I got to thinking: what would be some of the possibilities for storing these solving states (i.e. the Sudoku grid). 2D Arrays and 3D Arrays come to mind. Which might be best? 2D might be easier to manage from the surface, but 3D Arrays would provide the "box"/"cage" number as well.</p>
  
  <p><strong>EDIT:</strong></p>
  
  <p>Nevermind. I'm gonna go with a 3D array.</p>