On a chessboard, a piece has a set number of legal moves. It can range from 0 to 27. However, this amount can also restricted. My previous questions have covered n=1 and n=2, it is time for n=3!
Given that:
The entire chess set of 32 pieces is up for grabs.
Construct:
A position in which as many of them as possible have exactly three legal moves.
In the likely advent of a tie, the position containing the shortest proof game wins.
May the best solution be found!