The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » Math Topics » alt.math.undergrad

Topic: Combination\Permutation with Average Constraint Question
Replies: 2   Last Post: Aug 13, 2008 9:49 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 20
Registered: 10/18/06
Combination\Permutation with Average Constraint Question
Posted: Aug 12, 2008 1:21 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

I am working on a collectable card game as a hobby. I want a
definitive set of cards that I can plan on crafting by allocating 0 to
100 points to spend on creating the card in any 8 areas.

Given 8 possible attributes to each card, ranging from 0 to 100 how
many possible combinations are possible to get:

-=> an average of 25 (common cards)
-=> an average of 50 (uncommon cards)
-=> and average of 75 (rare)
(or from a purely formula base; How can I get the possible
combinations of X atrributes ranging from L to H such that the average
is exactly Y; given L,H,X, and Y are whole numbers.)

The idea is that I have laid out a point system to creating a card
giving a card designer (my friends) either 200, 400, or 600 points to
build a card to ensure a basic balancing system in their creation.

How many cards are we looking at creating?

I know it's a huge number, but how huge?

Not an easy task I am finding...

from a function standpoint I suppose I could try a brute force check
if average(a,b,c,d,e,f,g,h) == 25 return 25;
if average(a,b,c,d,e,f,g,h) == 50 return 50;
if average(a,b,c,d,e,f,g,h) == 75 return 75;

and then walk a-h incrementing them from 0-100 recursively...

Any good mathmatics to work around a brute force approach?

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2017. All Rights Reserved.