Where are my math wizards? Need help with algebraic set puzzle algorithm thing

[mouser]

I could use some help with this and i'm not sure where to start other than just playing with rows and columns on paper -- thought maybe someone here might have an idea.

I've been working on a board game idea recently, and i have an idea i want to play with regarding bidding.

I think the best way to describe what i want is a table of numbers, with X rows and Y columns, such that:

• No number in a cell is ever repeated
• The columns all sum to the same number (doesn't matter what that number is)

The numbers in cells should be positive, and ideally as low as possible, but that is not critical.

To help motivate what this is for, i was thinking of giving each player a set of "bidding cards", where every card is unique and therefore there can never be a tie, but where every player has the same average bidding strength.  So in my table above, each column represents the bidding cards of a single player.

To make it more concrete, i'm thinking of something like 6 players (columns) and 10-15 bidding cards (rows) each.

Any thoughts?

[mouser]

ah ok i have a solution (works for any number of players and even number of cards per person, i.e. rows).. shall i wait to post it to give you guys a chance to come up with solution ?  

[cranioscopical]

shall i wait to post it to give you guys a chance to come up with solution ?

Not if you're waiting for an answer from me 

y not, if x=y?

[mouser]

Here is a big clue:

Click to reveal big clue on how to solve

Draw a 2x2 table that solves for 2 player with 2 cards each, numbered 1-4, and look at the geometric pattern in your table, now reproduce for more players and cards.

[tsaint]

I guess you're saying to try an algorithm like this:
row 1: start counting from 1st element in row  ie 1 2 3
row 2: keep counting , but this time start from second element in row and then cycle back to 1st element ie 6 4 5
row 3: keep counting , but this time start from third element in row and then cycle back to 1st element ie 8 9 7

That gives constant totals for each column... but what about randomness for each player for the game?
I guess you could
a. interchange columns randomly
b. add and subtract random amounts from random selections in a column -
      the add would need to take the element to >x.y,
      the subtract could take the balancing element to negative
      then add a constant to all elements in the matrix to eliminate negatives
c. find minimum element in the matrix and reduce this, and all other elements by whats needed to get the min value to 1.
After making a nice cup of tea, voila, an apparently random matrix meeting requirements. Maybe.

[Deozaan]

I have this silly notion that I'm pretty good at math, but I don't think I even understand what you're requesting in the original post.