Abstract Algebra IBL Wiki

This page is read only. You can view the source, but not change it. Ask your administrator if you think this is wrong.
====== The Game Of Scoring ======
==== Problem ====
The game of //Scoring// is a two-player game. Start by creating a pile of $n\geq 1$ objects (feel free to choose $n$ however you want). On each player's turn, they must choose 1, 2, or 3 items from the pile.  Players alternate taking turns until someone takes the last object. Whoever takes the last object wins.
  - Play this game several times with various values of $n$. 
  - State all values of $n$ for which the first player has a winning strategy (meaning they are guaranteed to win if they play correctly). Remember to always fully justify your answers. 
  - State all values of $n$ for which the second player has a winning strategy? Why?
  - State all values of $n$ for which the first player has a winning strategy if we change the rules so that now each player must choose 1, 2, 3, or 4 items from the pile. 
  - We'll now change the rules and require a player to take anywhere from 1 to $k$ objects each turn. Conjecture the values of $n$ for which the first player has a winning strategy.

----
==== Remarks ====  
  * None.

----
==== $\LaTeX$ version ====
<file tex problem.the_game_of_scoring.tex>
%%%%%
% DEPENDENCIES
%%%%%
\begin{problem}
The game of \textit{Scoring} is a two-player game. Start by creating a pile of $n\geq 1$ objects (feel free to choose $n$ however you want). On each player's turn, they must choose 1, 2, or 3 items from the pile.  Players alternate taking turns until someone takes the last object. Whoever takes the last object wins.
\begin{enumerate}
\item Play this game several times with various values of $n$. 
\item  State all values of $n$ for which the first player has a winning strategy (meaning they are guaranteed to win if they play correctly). Remember to always fully justify your answers. 
\item  State all values of $n$ for which the second player has a winning strategy? Why?
\item  State all values of $n$ for which the first player has a winning strategy if we change the rules so that now each player must choose 1, 2, 3, or 4 items from the pile. 
\item  We'll now change the rules and require a player to take anywhere from 1 to $k$ objects each turn. Conjecture the values of $n$ for which the first player has a winning strategy.
\end{enumerate}
\end{problem}
</file>

----
==== External links ====
  * 

{{tag>problem ben}}
Abstract Algebra IBL Wiki

User Tools

Site Tools

Page Tools
