# Possible game result combinations in a FIDE tournament report file

I am currently working on a small side project and want to write a chess tournament manager in Haskell. To properly set up the data structures I am wondering what the possible results of a chess game are.

The TRF (tournament report file) specification by FIDE describes the following eight (single player) results:

Regular Game

1. Win
2. Draw
3. Loss

Unrated Results (game lasted more than one move)

1. Win (unrated)
2. Draw (unrated)
3. Loss (unrated)

Forfeit Results

1. Forfeit Win
2. Forfeit Loss

Not considering (pairing allocated) Byes, this would amount to 8x8 = 64 theoretically possible combinations, most of which are probably nonsensical or extremely rare.

However, I think the combination `(Draw, Loss)` exists for example when one player doesn't have sufficient material to end the game and the other one gets disqualified by the arbiter. Maybe even `(Forfeit Loss, Loss)` exists, when player A does not arrive to the game and player B offends the arbiter and thus gets his game counted as a loss.

So which combinations exist additionally to the following obvious ones?

``````{(1, 3), (2, 2), (3, 1), (4, 6), (5, 5), (6, 4), (7, 8), (8, 7)}
``````
• Can you have a look at chess.stackexchange.com/questions/12403/… to see if it covers all the cases you are thinking about? Nov 28, 2019 at 12:14
• (2, 3) and (5, 6) if game is declared lost for one player but his opponent cannot mate. Dec 2, 2019 at 19:25