###### 项目预算

$10 - $30 USD###### 全部竞标

22###### 项目描述

Draw a flowchart for the algorithm and write a program that plays the ancient Chinese game of

NIM. Actually, this is a simplified version of the game. Each game starts with a user-specified

number of stones in a pile. The user and the computer take turns removing either one or two

stones from the pile. The player who takes the last stone loses. Your program should have the

computer use the optimal playing strategy. The optimal strategy is as follows:

Divide the remaining number of stones by three. If the remainder is zero, then two stones

are removed, or else one stone is removed. For example, if the remaining number of

stones is nine or fifteen, then two stones are removed; if the remaining number of stones

is eight or ten, then one stone is removed.

Your algorithm and program should allow the user to play additional games of NIM as long as

he/she enters a “y” or “yes” (lowercase or uppercase) in response to a “Do you want to

play again?” prompt. Keep the tally of wins and announce the winner at the end of the

program. The tally will include for the player and the computer the number of wins by each and

the total number of games played. The “player” with more wins is the winner. In the case where

both the player and the computer have the same number of wins, then it is a draw. See the

sample output.

In addition, your will need to add input validation to your NIM algorithm and program. More

specifically, 2

1) ask the user to re-enter the number of starting stones if he/she doesn’t enter an

appropriate number,

2) ask the user to re-enter the number of stones to be removed if he/she doesn’t enter an

appropriate number, and

3) ask the user to re-enter a “yes/no” response if he/she doesn’t enter an appropriate

string.

Your game (algorithm and program) is to be well designed – future users and maintainers of this

solution would like to have a programmer-friendly, carefully planned design.

Sample Output

A sample run of the program is shown below. (Note: Bold texts are user input.) :

T H E G A M E O F N I M

Enter number of starting stones: 7

Would you like to go first? (y/n): yEs

How many would you like to remove (1 or 2)? 1

The number of stones left is 6.

The computer removes 2 stones.

The number of stones left is 4.

How many would you like to remove (1 or 2)? 2

The number of stones left is 2.

The computer removes 1 stone.

The number of stones left is 1.

How many would you like to remove (1 or 2)? 1

The number of stones left is 0.

The computer wins!

Do you want to play again? (y/n): Y

Enter the number of starting stones: 4

Would you like to go first? (y/n): n

The computer removes 1 stone.

The number of stones left is 3.

How many would you like to remove (1 or 2)? 2

The number of stones left is 1.

The computer removes 1 stone.

The number of stones left is 0.

You win!

Do you want to play again? (y/n): n

Results:

Computer Wins – 1

Player Wins - 1

Total Games - 2

It is a DRAW!

Thank you, good bye!

###### 需要技能

## 浏览相关技能

## 相关项目

## 人们在Freelancer上干的其他事

## 相关文章

## 最新文章

### 在寻找赚取金钱的机会？

- 设定您的预算和时间框架
- 大致描述您的建议方案
- 为您的工作领取工资

## 雇用同样在该项目上竞标的威客

## 寻找工作？

### 在类似项目上工作并在家挣钱！

立即注册- Forbes
- The New York Times
- Time
- Wall Street Journal
- Times Online