13 individual players (not in team)
4-player game
From what I understand, I am searching for a near-resolvable NR(v=13, k=4, lambda=3) covering. One should exist with b=39 (39 games in total), r=12 (every player plays 12 games), 3 rounds, a different players sits out each round.
Something like:
round 1:
ABCD
EFGH
IJKL
(M sits out this round)
round 2:
...
...
...
(A sits out)
round 3:
...
...
...
(B sits out)
[...]
round 13:
...
...
...
(L sits out)
I've tried every single solution t=2, v=13, b=39, r=12, k=4, lambda=3 found on
http://nassrat.cs.dal.ca/ddb/, but none work. They have either repeated blocks or just cannot be sliced into 13 rounds of 3 games. It's says the database is incomplete. Perhaps, you have a solution or a better source.
Thank you in advance