GoingToBoston

所属分类:数据结构
开发工具:C#
文件大小:0KB
下载次数:0
上传日期:2020-07-16 07:11:23
上 传 者sh-1993
说明:  2017年,UoL,编程和数据结构,骰子游戏Going to Boston,最终项目
(2017, UoL, Programming and Data Structures, Dice game Going to Boston, Final Project)

文件列表:
Program.cs (15125, 2020-07-16)
aWeronikaWawrzyniakAssesement3Testing.docx (46049, 2020-07-16)

# Going to Boston ## How do you play Going to Boston? The game is played in an agreed-upon number of rounds. Each player in turn has three throws of the dice. On the first throw, the highest number is put to one side. If two or more of the dice show the highest number, only one is kept. The remaining two dice are thrown and once again the highest-numbered dice is put aside. The final dice is then rolled and the total of all three dice is the player’s score. ## How do you win the game? When all players have had a turn, the player with the highest score wins the round. Ties are broken by additional rounds of rolling. When all rounds have been played, the player who won the most rounds is the overall winner. ## Are there any rule variations? Yes. One variant is called Multiplication. It's played the same as Going to Boston, except instead of adding the total of all three dice, a player’s score is determined by scoring the sum of the first two dice multiplied by the third.

近期下载者

相关文件


收藏者