Dice sum game

• Problem definition
• Suggested approach
• Input/output formats
• Requirements
• Datasets

Problem definition

See the slides of DP for optimum strategies in games

Suggested approach

Dynamic programming.

Input/output formats

In this assignment, you need to design a function myStrategy() to determine where to place the dice value. Together with the main function (which is given by TA), you should be able compile and run the program to get the average score of 1,000,000 runs of the game.

• Main program: gameEvalMain.cpp
• Your strategy: myStrategy.cpp
• Header file: game.h

Once you have the above 3 files, you can compile the program: g++ gameEvalMain.cpp myStrategy.cpp Then you can run the program directly. My result is like this:

• When strategy==1, the average score is around 57.
• When strategy==2, the average score is about 67.

Your mission is to modify myStrategy.cpp by adding DP to strategy 3. If implemented correctly, the program can generate an average score of 118 or so. The theoretical max score achieved by DP is 118.62.

Requirements

• Limits:
  • Time: 3 sec
  • Memory: 32 MB
• You get the full score if the average score is higher than 117 after 1,000,000 rounds of test. (It doesn't matter if you are using DP or not.)
• Do NOT print anything in myStrategy(), otherwise you'll get WA due to messed output.

Datasets

None.