[xXOpkillerXx]

Goods points Renegade. A few interesting perspectives in your last few posts.

How many files would that require ? I believe that's:
nbFiles = [sum 2^(i - 1), i = 1 to n] = 2^n - 1
where n is the number of rounds. That means if we assume the end condition (1 player with no strike) happens on round 8, we'd need a total of 255 files.

Since we're splitting the group in 2 for each round, and if we use the number or participants so far, that means a final split of 1 person in the top 50% will happen at 275 * 0.5^8 ~= 1. That assumes no tie happens. So 8 rounds is most likely the minimum that would be needed, which means 255 files. Therefore we'd need to have a way to recycle files somehow.

Edit: compared to a 7 divisions 8 rounds tourney, which is 56 files, that means we'd need to be able to recycle about 80% of the files without making it redundant for players, because there's no way we can improve the content quantity by 500%.