Search:
Type: Posts; User: dukuso
Search:
Search took 0.04 seconds.
-
it's awful in C with multi-dimension arrays.
A[x][y][z] is worse than A[x,y,z] ,
is someone successfully running the C-compiler from batch-file,
first converting all of the latter...
-
I notice a sharp drop in board activity, though.
So, who is still working on his/her program ?
Who did understand the other programs and was able to include
some ideas from them into his own...
-
xyzzy wrote:
>dukuso wrote:
>> E.g. bpd's program is pretty fast but completely
>> unrelated to others ! So, how did he solve them ? Must be some weird
>> strange technique...
>
>I'm sure...
-
CVMichael's and NTG's timings would be interesting for the statistics too.
manavo, can you post ntg's timings ? they were missing
@Brick1: the 0-line is the time needed for the easiest sudoku...
-
here are the correlation coefficents (*100) for the timings
of the 1011 individual instances.
I included mine as (duk).
Send your timings to sterten(at)aol.com if you want to be
included in...
-
but I have lots of arrays, with different dimensions and bounds
BTW. A[x][y] is bad. I'd prefer A[x,y], is there a utility which
converts these ?
-
there could be a utility, which reads a .c file and
processes the array-definitions and
whenever it finds a array[xxx] if includes a line
if(xxx<low or xxx>upp)printf("error in lineyy");
in...
-
suppose, you have a program with lots of arrays and several dimensions.
Now, that program shows unexpected behaviour and you suspect
array bounds problems.
How do you check it ? How to debug ?...
-
when I define an array like
int A[99];
and then later use variables addressing its entries like
x=A[y];
then I do want y to be checked whether it is inside the
defined bound i.e. output an...
-
OK, I won't post the link to the announced paper.
Just a quote:
"A new strategy to select the next variable and the value to branch on
for Latin square problems was proposed in [4](2003) . This...
-
could you translate that teethy smiley into English ?
you're going to bite someone ?
-
who is "we" ?
where is that area ?
Are you saying, there is(or will be) a sudoku-programming contest in C ?
Yes, I think I could do it in assembly, but why should I rewrite it,
when it already...
-
oh, I thought it were something like C++ or such, an extension of C.
I guess, I'm out then. Maybe I shouldn't have come here in the first place.?!
Hmm, shall I post my link to another paper as...
-
not that it were so important for me, but just assume that
I wanted to submit something. I have a C-program which reads
sudokus from a file and solves them, So how much work is it
to meet the...
-
sounds as if your solver might suffer from complicatedness...
while you're there, could you measure how many % speedincrease these
"naked subsets" gave you ? Is it worth the trouble ?
-
just take your program from one week ago. Maybe the one you posted ?
-
ahh, why should we be happy ? Because that increases the chances of others
to win ? Some wise philosoph said: with sudoku not the solution counts,
but the path which you take. (or was it a...
-
I mean, how do you verify that they have a unique solution ?
-
how can you generate them wothout solving ?
-
>Could that be written in Finnish... er, I mean, English?
>I have to admit, my problem is that I don't understand
>theoretical text very well. I understand the code much
>better than the text....
-
I don't know, whether this could be useful for your
sudoku-specific,optimized versions - but here is,
what the author of that paper just wrote:
>Dear Guenter,
>I'd be happy for you to...
-
http://www.icparc.ic.ac.uk/~hs/sudoku.pdf
-
I'd hardly come to the idea to split a file with 7611 lines into
7611 files... no wonder it's getting slow.
-
is this the first and only sudoku programming contest or are others known ?
I found with google, that University of Hongkong is doing something...
-
wouldn't that be a cool contest, if people would collaborate to find
the best program and everyone is _somehow_ scored by the
"value" of her contribution ?
-
Gordon Royle kindly uploaded all his 17-clue-puzzles !
4.6sec*GHz for these 7600:
http://www.csse.uwa.edu.au/~gordon/sudoku17
-
can't we forget about the contest and work together on the
best program in teamwork instead ?
I mean, it's better to exchange ideas right now,
since after the contest people will be no longer...
-
I wrote that my top1-example is still hard for my solver when
I rotate and permute the sudoku without destroying its structure and the
number of solutions.
And I wrote that I don't understand why...
-
I'm taking the first puzzle from http://magictour.free.fr/top100
which is by far the hardest for my solver which I ever found,
even when considering 1000 random equivalence transformations
of that...
-
that's what the creator thought too. But it soon turned out that they were not, see:
http://www.sudoku.com/forums/viewtopic.php?t=605&postdays=0&postorder=asc&start=15
having this in mind, I didn't...
-
you're right. I never noticed this. Distribution of clues in my 100 hardest:
10,0,1,1,65,0,2,9,5,4,1,1 counts for 17,18,..,28 clues.
Even my 3 top-hardest are 17-clue-puzzles.
I'll ask Gordon for...
-
the number of clues has not been a useful measure for hardness.
In fact most of the 17-clue-puzzles from Gordon Royle's webpage
were rather easy to solve.
-
maybe we should stop measuring time in ms...
Let 1 Merri (mr) be the number of CPU-cycles needed by Merri's solver
to solve one of the easy sudokus. (about 72000)
My solver takes about 4mr for...
-
then maybe for the next contest on another webpage using another language...
And you can still use them here "inofficially" for comparing your solvers.
I'm planning to use the winning program for...
-
my 100 hardest sudokus:
http://magictour.free.fr/top100
284ms*GHz
-
input,output and timing is much easier, when you allow multiple
solutions and just count the solutions instead of printing them.
e.g.:
.........
.........
.........
...975684
...821793
-
put all sudokus in one file, one row per sudoku
-
I just tried to estimate how much time I lose due to 2-dim arrays : about 3%.
-
how about board[(y<<4)+x]=y ?
that's how I would avoid multiplication by 9 in C
-
make 2 contests, one for easy(average) sudokus, one for hard ones ?
you can use the same processing software, same organization etc.
Apparantly these are two different problems, though.
|
Click Here to Expand Forum to Full Width
|