I'm starting a new series in which I set a very specific goal with a unique (to be more specifically defined here in a bit) answer in which the solver must construct a chess position, sometimes a game, using given information. My questions are sure to be very defined as to not be close as too broad.
In the event that in turns out that there is an alternate, unintentional solution to my question, I shall heartily accept the interpretation and move on .
I shall now define what a "unique" solution is. Basically, there is really only one way that the solution can be. However, variations of the piece positioning is allowed.
Now let's get to the first challenge! No computers are allowed!.
The task today is to construct four legal chess postions-one for each type of promotion in chess. Each one must be labeled. Assume that White is to be the promoting side and each side plays optimality.
For each diagram, the chosen promotion must be the best move in that position. A motivation for why that promotion is the best move must be stated.
The Task-Try to find the minimum amount of material for each position to ensure that the promotion is the best move.
If you need any clarifications or have a question, feel free to ask in the comments section below! After all, this is a raw and untested idea, so some refinement may be required.
UPDATE: Now that the main question has been solved, I'm here to issue two more related challenges. Try to find the minimal force for positions in which a knight and bishop promotion are the only winning move.
Another challenge is to find a position with a winning knight promotion that has only 4 units.