Re: Optimization problem for dice game (repost)

*To*: mathgroup at smc.vnet.net*Subject*: [mg109662] Re: Optimization problem for dice game (repost)*From*: Scott Hemphill <hemphill at hemphills.net>*Date*: Tue, 11 May 2010 06:26:22 -0400 (EDT)*References*: <hs0pod$ds7$1@smc.vnet.net> <hs3gnh$s2h$1@smc.vnet.net>*Reply-to*: hemphill at alumni.caltech.edu

Scott Hemphill <hemphill at hemphills.net> writes: > Peter Sisak <p-kun80 at hotmail.com> writes: > >> Hello, >> >> Yes, the goal is to maximize the expected score (in the calculation including the non-qualifying hands with score 0). While it is a multiplayer game, you do not see other peoples' rolls, therefore you can make no strategy adjustments based on that. For this reason, maximizing the expected value coincides with maximizing the chance of beating them, I would think. > > The last statement isn't true, but we can get to that later. > > What have you done so far to solve this problem? > > Here's what I would do to solve it: > > Define a function "score" which takes a list of the final values of the > dice and returns the score according to the criteria you mention in > point 5. > > score[h_] := Total[h] /; MemberQ[x,1] && MemberQ[x,4] Oops, I just noticed a typo here. This should be: score[h_] := Total[h] /; MemberQ[h,1] && MemberQ[h,4] Scott -- Scott Hemphill hemphill at alumni.caltech.edu "This isn't flying. This is falling, with style." -- Buzz Lightyear