Re: A new Sudoku xslt implementation

Hi Dimitre,
  In my application I am using a 3rd party library for finding a
cartesian product of any number of sets(with any number of elements in
each set). The relevant line in source code is Collection cp =
Setops.cross(sets); I guess the 3rd party library is quite resource
hungry. I have not been able to write a similar (and efficient)
algorithm in short time. I guess this is probably the reason of
OutOfMemoryError error.

I am working to improve the efficiency of my application. I would be
grateful if anybody could give any ideas. Probably you could!

I observed that my application works for simple Sudokus.

Regards,
Mukul

On 3/23/06, Dimitre Novatchev <dnovatchev@xxxxxxxxx> wrote:
> Hi Mukul,
>
> I ran your java sudoku solver like this:
>
> java -Xms1024M -Xmx1024M -classpath orbital-core.jar;. sudokusolver
>
> and after 50+ seconds got this:
>
> Exception in thread "main" java.lang.OutOfMemoryError: Java heap space
>
>
> Here's the contents of the board.txt file:
>
> 0,0,0,0,0,5,1,0,0
> 0,3,5,0,0,0,0,4,0
> 8,0,0,4,0,0,0,2,0
> 9,0,0,0,3,0,5,0,0
> 0,0,0,2,0,8,0,0,0
> 0,0,7,0,9,0,0,0,8
> 0,5,0,0,0,9,0,0,2
> 0,4,0,0,0,0,9,8,0
> 0,0,1,7,0,0,0,0,0
>
>
> (I get the result in 756 milliseconds with an XSLT 2.0 solution).
>
>
> Cheers,
> Dimitre