All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Games
A nim variation (Posted on 2021-12-09) Difficulty: 3 of 5
Nim games are two player strategy games where players take turns removing objects by some rules until none remain.

For this version, place N counters in a row numbered 1 to N.

A player's turn consists of taking either one counter or two counters from consecutive positions.

Whomever takes the last counter loses (this is called a misère game.)

If you were to play this game, for what values of N would you prefer go first and what should be your first move?

No Solution Yet Submitted by Jer    
Rating: 5.0000 (2 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
proof that for N>20 player 1 winsSteven Lord2021-12-24 15:24:33
more solns (up to N=30)Steven Lord2021-12-23 22:32:39
re: game laid out for N<10Jer2021-12-23 09:41:13
game laid out for N<10Steven Lord2021-12-17 09:15:42
partial solnSteven Lord2021-12-16 11:23:48
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (12)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2022 by Animus Pactum Consulting. All rights reserved. Privacy Information