Is there any problem in making the self argument in the action functions mandatory?


import functools
class SubDevice(object):
def __init__(self, action):
#always pass a reference...

#solve sudoku by backtracking
def solve_sudoku(board):

#i is the first non-filled place, and the one we're going to try different values for
i=board.find('0')

#if i == -1, the puzzle is...

Which is exactly what numerology does. (just completing your post).

I just realized now that the modulus trick demands the OP to treat 0 as 9 -- don't forget about that!

There are basically two ways to solve a sudoku:

1) Solve it by logic, using simple rules such as the ones we, human beings, use, such as "if a square has only one possibility, than that number...

Of course I knew that :P But somehow my brain didn't make the connection. Thanks for the trick!

There is a lot of bad style / redundancies in your code, which is perfectly acceptable since you're a beginner. Your use of while loops when for loops would do is a clear sign of that. Something also...

I third that statement. Time to look at some tutorials as to how to work with threads!

If you have an array of choices arr_choices, it's trivial to get a random element from it (I advise you to take a look at the documentation for the random module, if you haven't already):


import...

First, I have to tell you that the data will be separated by one space only, regardless of how many there were in the original file. This is a simple code which has no concerns whatsoever with...

You have mistyped __init__ :)

It's __int__ in your phonedb class, look carefully...

You're finding difficulties with Python and "just" moving to C? Let me warn you, you're walking into dangerous territory... C isn't nearly as simple as it sounds.

When I realized the filter was actually bigger, I transformed the map-loop into a comprehension as well:


p=lambda x:[i for i in range(2,x+1) if all([i%x for x in range(2,i**0.5+1)])]

Can...

Note that it's not the sqrt(len(primes(n)) natural number, it's the sqrt(len(primes(n)) prime.

I'm curious as to how this works exactly, perhaps it's because the primes array grows faster than...

Luckily, I have kept most of the useless stuff I wrote when I was a beginner. I knew they helped a lot, even though they were quite trivial, and note that I'm listing everything here (even the...

Easy. The call to sub_one(x) prints x, calls sub_one(x-1), and prints x-1!

x before if --> 5
x before if --> 4
x before if --> 3
x before if --> 2
x before if --> 1 (the if is not executed...