title: Java Sudoku Generator(easiest solution)
body: <p>In my last question seen here:  <a href="https://stackoverflow.com/questions/6800164/sudoku-region-testing">Sudoku - Region testing</a>  I asked how to check the 3x3 regions and someone was able to give me a satisfactory answer (although it involved a LOT of tinkering to get it working how I wanted to, since they didn't mention what the class table_t was.)</p>
  
  <p>I finished the project and was able to create a sudoku generator, but it feels like it's contrived.   And I feel like I've somehow overcomplicated things by taking a very brute-force approach to generating the puzzles.</p>
  
  <p>Essentially my goal is to create a 9x9 grid with 9- 3x3 regions.  Each row / col / region must use the numbers 1-9 only once.   </p>
  
  <p>The way that I went about solving this was by using a 2-dimensional array to place numbers at random, 3 rows at a time.   Once the 3 rows were done it would check the 3 rows, and 3 regions and each vertical col up to the 3rd position.  As it iterated through it would do the same until the array was filled, but due to the fact that I was filling with rand, and checking each row / column / region multiple times it felt very inefficient.</p>
  
  <p>Is there an "easier" way to go about doing this with any type of data construct aside from a 2d array?  Is there an easier way to check each 3x3 region that might coincide with checking either vert or horizontal better?  From a standpoint of computation I can't see too many ways to do it more efficiently without swelling the size of the code dramatically.</p>