Re: Pulling all n-sized combinations from a list

2006-02-08 Thread my . correo . basura
> Ah, this definitely seems to work! It's a lot nicer in appearance than > my previous code, that's for sure. It actually runs in approximately > the same amount of time though. As a side note, this problem will always be "slow". The number of combinations grows exponentially with n. No matter h

Re: Brute force sudoku cracker

2005-09-16 Thread my . correo . basura
Bas ha escrito: > Hi group, > > I came across some of these online sudoku games and thought after > playing a game or two that I'd better waste my time writing a solver > than play the game itself any longer. I managed to write a pretty dumb > brute force solver that can at least solve the easy c