A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 3 years ago
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.
anonymous
 3 years ago
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.

This Question is Closed

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Of course another quirk in OS is I can't attach a file to a question, but I can to a comment, hence:

andrew.m.higgs
 3 years ago
Best ResponseYou've already chosen the best response.2Yours 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.

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Yours is much more robust than mine. And you've used booleans and min, so kudos to you.Thanks for posting.dan

andrew.m.higgs
 3 years ago
Best ResponseYou've already chosen the best response.2Pleasure. 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.

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Study my cod just for the halibut ;)

andrew.m.higgs
 3 years ago
Best ResponseYou've already chosen the best response.2:) See, peer review works...

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Since there is nearly identical code handling each player, I combined them and set a variable to denote the current player.

andrew.m.higgs
 3 years ago
Best ResponseYou've already chosen the best response.2What 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.

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0I tried it with recursion and tried to avoir any exception during game... seems to work fine

andrew.m.higgs
 3 years ago
Best ResponseYou've already chosen the best response.2Hi 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. :)

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Made 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...

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0I like the recursive solution from FabienTourne. Anyway, here is mine:

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0I'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
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.