A generation method of substantially seeded rights unbalancing in a tournament-type match table by the frame of balanced 2-3-4 trees structure

A tournament-type match table has been widely employed to decide the winner of games. In the case of a balanced table, participants can win after the same number of games, or one time less, depending on the number of participants. Spectators want to watch good exciting games, especially in semi-finals and the final, so powerful participants are given seeded rights in the table. Powerful participants may expect to win after one time less or even less. Therefore, there may be two kinds of seeded rights: nominal and substantial. The nominally seeded players have to play the same number of games or one time less and the substantially seeded do one time less or even less. We succeeded in generating a good table under the strict 2-3-4 trees structure by unbalanced partitions