Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Part 2 - Rolling Dice to a Total Given an n - sided die, we want to determine how many different ways one could repeatedly
Part Rolling Dice to a Total
Given an nsided die, we want to determine how many different ways one could repeatedly sum die rolls and
get to a given total.
For instance, given a sided die, we could obtain a total of in four different ways:
rolling a three times
rolling a and then rolling a
rolling a and then rolling a
rolling a
We will write two different functions to solve this problem. Each functions takes the number of sides on
the die and total the total to which we'll sum rolls as input. Each function must use its corresponding
dynamic programming methodology in order to solve the problem.
waystosummemon total
must use memoization
waystosumtabn total
must use tabulation
w waystosummemo total
waystosumtab total
Imports
No imports allowed on this assignment, with the following exceptions:
Any modules you have written yourself
typing this is not required, but some students have requested it
For testing only do not use these for functionality in any other classesalgorithms:
unittest
random
NOTE: Not allowed to change the parameters, the code should be done with the parameters indicated
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started