Hello. Two teams A and B (consisting of 2, 3 or even 4 players) compete and the outcome of each game is either a win or a loss. I have a to process the new (gaussian) laws of players given whom beats whom.

Given the initial means and standard deviations of the players, I have a algorithm (RC) which computes the new laws of the players. [the actual algorithm i use is different to the one i am showing here]. 

By way of example consider two teams with 2 players per side. Each person plays 2 games.

The initial laws of A1,A2,B1,B2 are given.

(A1,B1) --->(A1',B1').......[iteration 1. A1 beats B1, resulting in new laws A1' and B1'(computed by RC)]

(B2, A1') --->(B2', A1").......[ iteration 2. B2 beats A1. using A1' from iteration 1. A1 has played twice and is denoted by A1"]

(B2',A2) --->(B2",A2').......[ iteration 3. B2 beats A2. using B2' from iteration 2.  B2 has finished and is denoted by B2"]

(A2',B1') --->( A2",B1")......[ iteration 4. A2 beats B1. using B1' from iteration 1 and A2' from iteration 3. now all players have played their matches]

new laws A1" ,A2", B1" & B2" should be outputted.

my first code gets the result, but it is tedious to enter the iterations in the right place .especially for teams of 3 or more.

my second with parameters gets errors.

So what i want is to enter who beat who:

eg  [[B1, A1], [B2,A1], [B2, A2], [A2, B1]];
and the final laws are computed automatically.

bb_processing_edit.mw

You have three cakes, with diameters 15cm, 20cm and 25cm (same width). You want to share the cakes equally among your four customers. How do you do it?
What if you want the cakes sliced into the minimum total number of pieces?

The answer is to cut the cakes in half, but five pieces is the minimum.

What I want is a procedure for a more general case.

m cakes (different diameters) divided equally amongst n people. what is the minimum number of cuts or pieces to achieve this.

cuts.mw

Hello. I want to replicate the results of this table in Maple.

My "attempt" uses the inbuilt dictionary, but it will only find the words of length n, not the frequency of letters in each ....

word_length.mw

Gentlemen

As seen on tv.

Having issues with animating the movement of two fielders, (25m apart on a straight line) when a baseball is struck towards them. they're on the y axis when they should be on the x.... and they should be green and brown dots, not lines.....

BaseballBallistics.mw

Hello,

Paraphrasing:

https://en.m.wikipedia.org/wiki/Langford_pairing

given a sequence of 2n numbers 1,1,2,2,3,3,...n,n in which the two 1's are 1 slot apart, the two 2's are 2 slots apart, the two 3's are 3 slots apart, -> generally the two n's are n slots apart.

for n=3, a possible sequence is [2,3,1,2,1,3]. 

There is sequences for n=4,7,8...

i havent a clue how to write a maple procedure to generate a sequence for given n, but I'm hoping an expert here can.