38 karma · joined April 20, 2009
I believe that you should always call "steal". On average (assuming you don't know what the other person will choose) you get more money (1.0 if you steal versus 0.5 if you split) and you can never be betrayed.
More than that: each player decides whether the other player takes any money or not. However since the players decisions are independent it doesn't make sense to say 'split'.
I had this assignment while studying Operating Systems Design during college. I can tell you I failed miserable. We used documentation from: http://www.beyondlogic.org/serial/serial.htm. You can find some examples there, but not for the Linux kernel.
You can start by borrowing music from other games and put an announcement (on forums, mailing lists, in game) saying that you need music. If people like your game somebody with musical skills will help you creating soundtracks eventually. Just don't expect this to happen overnight. NAEV has been under development for over 6 years.
having () and .next() would violate Python philosophy: only one way to do it.
So, do you know any site that aggregates bets from different bookies?
Update: http://www.betbrain.com/ is even listing SureBets :).
My problem is that I have a laptop, and FreeBSD doesn't have to many drivers for it including the battering saving ones. Plus, since I need a desktop (includes applications like Firefox, Flash, OpenOffice, GIMP, etc) I found that FreeBSD had quite a few usability bugs (eg. in Firefox, images were only half rendered). So now I'm happily using Linux - the arch way.
I tried installing ArchLinux on my father's computer, but I didn't have time to configure everything (eg. pressing the poweroff button shuts down the computer) and from an end's user point of view his desktop was barely usable. Finally I decided to go with Ubuntu, and since then I haven't heard any other complain about his OS. On contrary, he is much happier than he was when he had Windows installed. Now, only if I find some good chess linux software. Grandmaster Chess was his favourite, but in the linux world I could not find anything similar, only some playing engines.
I know this function is attributed to Bernstein and it's called Bernstein hash [0]. You're describing the Rabin-Karp string matching algorithm [1].
[0] http://fr.wikipedia.org/wiki/Table_de_hachage#Fonction_de_Ha...
[1] http://en.wikipedia.org/wiki/Rabin-Karp_string_search_algori...