Search:

AMIS Technology blog » Blog Archive » Oracle RDBMS 11gR2 - Solving a Sudoku using Recursive Subquery Factoring

What is line 28?

Ooooh, but I wanted to be clever! *pouts*

Haha, it is still a fun little exercise.

Where do you get this null pointer?

I have started writing a Sudoku solver myself. So far I have written all the setup code. Now we are both stuck at the same point: how to go about solving the...

Do you have any ideas?

Half of the fun of coding is the thought that goes into it ;-)

Do you mean adding possible values to solve the puzzle? Well, I am not an expert sudoku puzzle solver, so I am not exactly sure how to proceed at the moment. How would you solve the puzzle in your...

I would still do it the way I started doing it above.

I would make the file look like this:

1,2:4
4,9:8
x,y:z

where 1 is the horizontal position (the x value, or the first value in the...

From the looks of it, you already are using a two dimensional array...

Since that's the case, why are you creating an array of Cells of size 81?

It might be easier to use a two dimensional array here, as it more accurately represents a Sudoku square.



public class Sudoku {

private Cell[][] square = new Cell[9][9];

public...