On Jan 28, 10:11 pm, Arnaud Delobelle <[EMAIL PROTECTED]> wrote:
> My strategy was to walk through each solution "only once" (for a
> certain definition of "only once :), thus I was hoping not to need a
> hashtable.
Yes, that seems like it should be preferable (and indeed necessary for
a more gene
I see I don't have as many columns as I'd expected. Here's a
reformatted listing.
from time import time
from bisect import insort
from sys import argv
#-
# Hash table is a global variable
#-
I also had a go at this problem for a bit of python practice, about 6
months ago. I tried a few optimizations and my experience was that
with only 6 seeds, a hash table was very effective. So effective, in
fact, that it made all other optimizations more or less pointless.
Code below. Arguments
