Question

Is anyone interested in posting their code for Exercise 2.6, the NIMS game? I have mine working but I thought it would be nice to see others.

Answer 1

Of course another quirk in OS is I can't attach a file to a question, but I can to a comment, hence:

Answer 2

Yours looks more elegant than mine. :-)

I also went on step further and wrap parts in functions and made it that more than two players could play. But that was just for fun.

Answer 3

Yours is much more robust than mine. And you've used booleans and min, so kudos to you.Thanks for posting.-dan

Answer 4

Pleasure. I believe we learn the most by comparing. That is what makes open source so wonderful.

I am going to study your cod because i like the way you worked through the problem.

Answer 5

Study my cod just for the halibut ;-)

Answer 6

:-) See, peer review works...

Answer 7

Since there is nearly identical code handling each player, I combined them and set a variable to denote the current player.

Answer 8

What I did as an added bit of work was to create a function called make_move and made it that more then 2 players could play at once.

Answer 9

I tried it with recursion and tried to avoir any exception during game... seems to work fine

Answer 10

Hi Fabien,

I like your code. Very neat indeed. Only problem is that stack can go negative which means you will never end the game, in certain circumstances. :-)

Answer 11

Made a mistake in my while test... forgot to convert choice to integer and flipped the comparator...
Like, I think the problem shouldn't happen again...

Answer 12

I like the recursive solution from FabienTourne. Anyway, here is mine:

Answer 13

I'll post the function I used to make the English grammatically correct (with regards to singular vs plural):

def plural(counter, word):
if word == "stones":
if counter == 1:
return "stone"
else:
return "stones"
elif word == "are":
if counter == 1:
return "is"
else: return "are"
elif word == "remain":
if counter == 1:
return "remains"
else:
return "remain"
else:
return None