User Account

All Pages

FlipFlaps fltk project, C/C++ Programming

Assignment Help:
The project is to design and write a C++11/FLTKgame program with a graphical user interface.The game is based on "pancake sorting," as described at
https://en.wikipedia.org/wiki/Pancake_sorting, which actually has some mathematical significance. (Note that Bill Gates was a freshman at Harvard when he and one of his professors wrote a research paper about this!)

The heart of the game is a centered stack of pancakes, each one a different size. The goal is to get the stack into order (from smallest on top to largest on bottom) by flipping over the top partial stack of some number of pancakes. See the Wikipedia article for an example flipping the top three pancakes. Since we''re flipping flapjacks, the game is named "FlipFlaps
The program must:
1. Start with an attractive splash screen showing (at least) the name of the game ("FlipFlaps"), the team number, and the team members'' names. Feel free to add team members'' pictures, animations (see extra credit section below), etc.
2. Explain how to play the game.
3. Ask for the player''s initials and display the top 5 scores read in from the disk (see item 6 below) followed by the player''s initials. The top scores file starts out empty.
4. Ask for a difficulty level from 2 to 9; this is the number of pancakes. Each pancake is a different size. Display the pancakes in a centered stack in a random order. Hint: Look up "permutation" at cplusplus.com.
5. Allow the player to select where to insert the spatula(below some pancake); you may decide to have a button beside each possible spatula position, or choose some other way to indicate where to flip. When the player clicks the "Flip!" button, flip over the partial stack above the spatula and redraw the screen.
6. If the pancake stack is now in order, from smallest on top to largest on the bottom, calculate the player''s score (see "Scoring" below) and display it next to the player''s initials. Sort the list of 6 scores and write the top 5 out to disk with initials. Then the next time the game is played that file will be read in and displayed in step 3 above. Note: The game is also over if the player makes too many flips (see "Scoring" below).Ask the player if they want to play another game or quit.

Scoring: The instructors will provide a function named find_solution which calculates the minimum number of flips needed for a particular stack of pancakes. The score for one game is 100 minus 10 times the number of unnecessary flips more than the minimum, multiplied by the difficulty level.For example, if a particular stack of 6 pancakes could be flipped into order with 5 flips (according to the find_solution function), but the player takes 7 flips, then the score is [100 – 10 * (7 – 5)] * 6 = 480. The score for a game cannot go below zero, so in this case the game ends after 15 flips even if the pancakes are still not in order.
Display "Can be done in xx flips" (use the information from find_solution). Also display a running count of how many flips so far, and the player''s score so far.

Related Discussions:- FlipFlaps fltk project

Decode, Smugglers are becoming very smart day by day. Now they have develop...

Smugglers are becoming very smart day by day. Now they have developed a new technique of sending their messages from one smuggler to another. In their new technology, they are send

I am looking for any one can help me in my assignment , Design a lift for 3...

Design a lift for 3 levels

Program create a user defined data structure - c++ program, Create a user-d...

Create a user-defined data structure (struct) called Node that represents a node within a linked list where the "data" stored in each node is a pointer to a Car object.    a) Wr

C programing forcalculating savings of an employee, c programing forcalcula...

c programing forcalculating savings of an employee

Explain recursive functions, Recursive Functions Recursion is a process...

Recursive Functions Recursion is a process by which a function includes itself with a condition for its safe exit. It is best suitable for a recursive problem. A typical exampl

#title prime number or not, to find prime numbers upto any number say "n" e...

to find prime numbers upto any number say "n" entered by user

Recursion, write a program to solve e^x

write a program to solve e^x

Decodethecode, 6999066263304447777077766622337778 -----> message sent by th...

6999066263304447777077766622337778 -----> message sent by the first smuggler. my name is robert---------> message decoded by the second smuggler. Where ‘0’ denotes the "space".

Luminous Jewels, Jewels can only be removed for polishing from either end o...

Jewels can only be removed for polishing from either end of the necklace

File IO, I''m trying to write a function that prints the substring if it is...

I''m trying to write a function that prints the substring if it is found in the string, and after it prints it deletes it from the string so i could print the next substring if it

Write Your Message!

Captcha
Order Assignment

Featured Services

Order Now

Popular Subjects

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!

Submit Assignment

Academics

Major Subjects

Majors

Get In Touch

whatsapp: +91-977-207-8620

Phone: +91-977-207-8620

Email: [email protected]

TERMS & POLICIES

HELP & SUPPORT

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