A forced checkmate is a situation in which the player whose turn it is has only legal moves which put the other player in checkmate.
I’m searching for the minimal forced checkmate (the smallest amount of pieces). If there are several with the same amount of pieces, the one with the most legal moves (which all need to checkmate) wins.
A similar question was asked here, but it wasn’t about a minimal position: