phil hunt enlightened us with:
> Why do you need to maske lots of copies?
The puzzles are stored in a NxN list of strings. The strings contain
all the numerals that that block can contain. So a 9x9 puzzle contains
81 strings "123456789" when it's "empty".
My creation function picks a block that i
On Fri, 9 Sep 2005 18:50:26 +0200, Sybren Stuvel <[EMAIL PROTECTED]> wrote:
>djw enlightened us with:
>> Personally, I would try Psyco first, and consider Pyrex next.
>
>Ok, I'll take a look at those.
>
>> Are you sure your algorithm can't be optimized first, before you
>> start trying to write thi
On Fri, 9 Sep 2005 17:19:21 +0200, Sybren Stuvel <[EMAIL PROTECTED]> wrote:
>Hi people,
>
>I'm creating a program that can solve and create Sudoku puzzles. My
>creation function needs to make a lot of copies of a puzzle.
Why do you need to maske lots of copies? And when you say "lots of"
what numb
djw enlightened us with:
> Personally, I would try Psyco first, and consider Pyrex next.
Ok, I'll take a look at those.
> Are you sure your algorithm can't be optimized first, before you
> start trying to write this in C?
I'm sure there will be optimizations, but profiling showed that the
copyin
Sybren Stuvel wrote:
> Hi people,
>
> I'm creating a program that can solve and create Sudoku puzzles. My
> creation function needs to make a lot of copies of a puzzle. Until
> now, I used copy.deepcopy(), but that's too slow. I want to implement
> such a copying function in C and use that instead
Hi people,
I'm creating a program that can solve and create Sudoku puzzles. My
creation function needs to make a lot of copies of a puzzle. Until
now, I used copy.deepcopy(), but that's too slow. I want to implement
such a copying function in C and use that instead. My idea about this
is:
- Get t
