Algorithem for create game application, Programming Languages

Assignment Help:

Play is as follows:

1.) Player places a bet

a. Bet is on one of three choice

i. "Player" will win

ii. "Banker" will win

iii. Tie between the "Player" and the "Banker"

2.) Cards are dealt face up

a. "Player" gets the first card and prints out suit and value, e.g., 2 of spades, or queen of clubs

b. "Banker" gets the second etc. "Player" gets the third etc.

c. "Banker" gets the fourth.

d. This ends the dealing of the cards for the round.

3.) Scores are calculated

a. Number cards are their numerical value

b. Face cards have no value

c. Aces are counted as 1

d. If the total is over 10, then divide the total by 10 (hint: use the MOD() function).

i. Example - 16 -> 6 ; 12 -> 2

4.) The higher score wins

5.) The player then receives their winnings at a 1:1 ratio. Thus if the player bet $10 they receive $20 (the original $10 bet plus $10 in winnings).

That's all there is to playing NCSU Bac.

Your program must do the following:

1.) Ask for the player's name

2.) Generate a file with the following information (the order of the information in the file is up to you):

a. Round Number

b. How much money the player has

c. Amount the player bet

d. Who did the player bet on?

e. "Player's" hand value

f. "Banker's" hand value

g. Which hand won? "Player" or "Banker"

h. How much did the player win

i. Sum of amount the player has won to this point

3.) Thus a sample of some of these values would be :

Hand # amt bet players value bankers value amt remaining

1 5 6 7 x-5

The game is quite simple, and played with a standard 52 count card deck. There are no jokers used. You will also have a standard starting amount of $1000.00 for the player to use during the game.

2 6 2 0 x+6

4. Your model and algorithm should also have a means to end the game. This could be done several ways which must include when the player has no more money, and then whatever else you decide such as after 50 rounds or  when the player has won double his starting amount.

Also, be sure to present the ending information to the user at the start of the game.

To do this program successfully you will need to call random numbers from the system, and understand how to model a card deck. Dr. Rodman's lecture notes on the subject should be used.


Related Discussions:- Algorithem for create game application

Define an example of switch statement, Define an Example of Switch Statemen...

Define an Example of Switch Statement? estimate(number) int number; /* Estimate a number as none, one, two, several, many */ {       switch(number) { case 0 :

Matlab, I need to write code to compute matrix multiplication without usin...

I need to write code to compute matrix multiplication without using built in function.

Define a prolog predicate flatten, Define a Prolog predicate flatten(List, ...

Define a Prolog predicate flatten(List, FlattenedList) that asserts List is any nested list of atoms and FlattenedList is the same list with the nesting removed. The atom [] should

Perl scripting, Am unable to write to file of type=file in perl script.It d...

Am unable to write to file of type=file in perl script.It does not have any extension.Help me..

Use case diagram incremental development, Introduction This assignment ...

Introduction This assignment builds on your application, produced in Assignment 1, which holds a list of cabins, which can be either read in from a text file or just hard coded

Creates an object and prompt the user to enter the name, Design an object d...

Design an object definition named Pet, which should have the following fields: name: The name field holds the name of a Pet type: The type field holds the type of anima

What is .net?, What is .NET? It is a foundation fairly neutral structure...

What is .NET? It is a foundation fairly neutral structure. Is a coating between the son and the selection language? It can handle many selection dialects, such as VB.NET,

Complementary slackness and duality, Consider the following LP problem: ...

Consider the following LP problem: min x 1 +3 x2 +x 3 -x 4 s.t. x 1 +x 2 +x 3 +x 4 ≥ 0 x 1 +x 2 -x 3 -x 4 ≥ 1 x 2 , x 3 ≥ 0 x 1 , x 4 ≤ 0. 1. Unique pr

Algorithm to compute a minimum cover time and space, Given strings s 1 and...

Given strings s 1 and s 2 of lengths m and n respectively, a minimum cover of s 1 by s 2 is a decomposition s1 = w 1 w 2 .... wk, where each w i is a non-empty substring of s

We are need of a prestashop expert, We are need of a PrestaShop Expert W...

We are need of a PrestaShop Expert We are getting a fresh design created for our Jewellery website. This job is in 2 parts 1. The website engine is PrestaShop as well as w

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd