On Sep 28, 10:27 pm, AndyB <[EMAIL PROTECTED]> wrote:
> ...
> This is in a program that generates random numbers to do a brute force
> solve on a sudoku-like puzzle. Once a certain level of difficulty in
> the puzzle is reached, performance goes off a cliff because the
> duplicate checking code, a
I have found a lot of material on removing duplicates from a list, but I
am trying to find the most efficient way to just check for the existence
of duplicates in a list. Here is the best I have come up with so far:
CheckList = [x[ValIndex] for x in self.__XRList[z]]
