Solve Sudoku Puzzles

I can create a Sudoku solver in Java, and I need help! Can anyone here?

I'll talk about this: to what I did: The program creates a list (1-9), then check my ([][]); int table for each number in the column, check numbers, and if no one on my list of 1-9, change that number to 0. Does the same for columns. If 8 0, the remaining number (Q> 0) will be launched this table. Do I have to do: the numbers every third need to be included in this as well. Is there an algorithm or perhaps a new way to determine what is the third in the table? or I have to use if / then / Switch statements? or maybe I'm going about it all wrong? I'm a hobbyist programmer, this is really the first comprehensive solo full as I try, then comments are greatly appreciated! thanks.

Sudoku solver started a bit like a mental exercise, but I have not had a chance to finish it. I created a regular 2D 9×9 array of cells and each cell contains the current number is put in place (if applicable) and a bit mask indicating all the numbers that can be at this location (9 bits per cell, one for each possible number). Then create multiple index sets ("Games") in this table, a set of nine indicators for each line, one for each column and each 3×3 sub-grid. The first rule is that if a cell is set to a number and another number in this line of cells, columns or subnet can be configured for this problem. So when you put a cell in a given number of everything in all sets that contain this cell, then go all other cells of these complexes and remove the mask number. Second rule is that if the mask for all cells at any time, contains only a bit is set (ie, one number can go here), then I set the rule of the cells with the number # 1 and apply to all cells that share a set with this cell. Rule 3 is that, if a bit for a given number is defined in a single cell in a given set when the cell must contain that number. This is analogous to finding a column that have excluded the number 3 (for example) of all cells except one … this cell should be a 3. Thereafter, the rules are somewhat more complex. Rule 2 can be extended to a more generic X-cell involvement is whether cells in a given set X and only have a number X that may reside in other cells, then this game can not have these figures to clear the bit masks other cells. There are many pages sites dedicated to sudoku which contains more advanced algorithms that are so easy to apply bit masks, must apply these rules on several occasions and even to reach a solution. If at any time at a standstill, then you should use a brute force method to find depth and first to reach the solution.

Google Wave Developer Preview at Google I/O 2009