For assignment 1, you need to write a shell script named stick which plays a matchstick-picking game. Given an initial number of sticks, players take turns picking either 1, 2 or 3 sticks from a pile. Whoever picks the last stick wins.
Usage
You run stick without any command line arguments, i.e.
stick
The game should greet the user, and then ask how many sticks to play with (must be an integer ≥ 10), and who should go rst (c for computer, u for user). An invalid answer should cause the program to re-ask the question (as many times as necessary).
On the user’s turn, ask the user how many sticks to remove, and remove those from the pile. On the computer’s turn, calculate the correct number of sticks to remove in order to ensure you will (hopefully) win the game.
Play continues until there are no sticks left, at which point your program announces who won. You must show the set of sticks after each player’s move. Show this as a set of pipes ( | ) side by side, followed by the number of sticks in (parenthesis), for example:
||||||| (7)
Illegal Moves
When the user is asked how many sticks to take, they must enter 1, 2 or 3. If their entry is illegal (anything other than 1 2 or 3), remind them of their options, and ask once more. If they enter another illegal number, announce that they have forfeited the game, and terminate the program. If the user entered a valid number the second try, gameplay continues (in this case, if later the user again enters an illegal number, you should again given them a second chance).
1
Algorithm
Your algorithm for picking sticks is simple: given n remaining sticks, pick (n mod 4) sticks, unless (n mod 4)=0; in that case, pick 1 stick.
