This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
problem:the_game_of_scoring_misere [2013/09/14 10:33] bmwoodruff |
problem:the_game_of_scoring_misere [2013/09/14 10:45] (current) bmwoodruff |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ====== The Game Of Scoring Misere ====== | ====== The Game Of Scoring Misere ====== | ||
| ==== Problem ==== | ==== Problem ==== | ||
| - | A [[http:// | + | A [[http:// |
| - | - For which values of $n$ does the first player have a winning strategy when playing misere, provided each player must take 1, 2, or 3 objects.? | + | - For which values of $n$ does the first player have a winning strategy when playing misere, provided each player must take 1, 2, or 3 objects? |
| - | - For which values of $n$ does the first player have a winning strategy when playing misere, provided each player must take 1, 2, 3, or 4 objects.? | + | - For which values of $n$ does the first player have a winning strategy when playing misere, provided each player must take 1, 2, 3, or 4 objects? |
| - If instead a player must take between 1 and $k$ objects, conjecture the values of $n$ for which the first player has a winning strategy when playing misere. | - If instead a player must take between 1 and $k$ objects, conjecture the values of $n$ for which the first player has a winning strategy when playing misere. | ||
| Line 31: | Line 31: | ||
| ---- | ---- | ||
| ==== External links ==== | ==== External links ==== | ||
| - | * [[wp>Dihedral group]] | + | * [[wp>Mis%C3%A8re# |
| {{tag> | {{tag> | ||