|
home—info—lectures—exams—archive
In Wii Fit Soccer, you play a goalie; soccer balls are kicked at you, and you get points for every ball you successfully block. (Here's a video trailer.)
Details:
Extra-credit: Prove that these bounds are correct. Hint: Suppose I missed only the ith ball; derive a formula mx(i) for the max number of points achievable (which might have several cases, depending on what i is). Then, show mathematically that in all cases, your answer to part (b) is always ≥ than your formula, for any i. Then do similarly for part (c).
/** Return the maximum possible Wii Fit Soccer score, * given how many balls were missed. * @param n The number of balls in a game. * @param k The number of balls missed. 0 ≤ k ≤ n. * @param m The maximum number of points possible for a single ball. * @return the maximum possible Wii Fit Soccer score, * if exactly k balls were missed. */ int maxPossible( int numMisses, int N, int m ) |
1…at least if the index set is finite. ↩
home—info—lectures—exams—archive
©2008, Ian Barland, Radford University Last modified 2008.Dec.13 (Sat) |
Please mail any suggestions (incl. typos, broken links) to ibarlandradford.edu |