Let me first try to define what a retrograde problem is.
Stable position : a position is said stable if no pieces are in a capture position.
A retrograde problem generally start from an unstable position and the goal is to retrograde the position till a stable position but with a unique optimum suite of moves!
A suite of move is optimum (from the highest priority to the lowest) if
1) the number of plies used is minimum
2) the number of pieces added is minimum
3) the number of kings added is minimum
Just an example
The following position is a correct problem with a unique solution in 2 plies, 1 piece added and 0 king added

But this following one is not correct because there are two solutions in 2 plies, 1 piece added and 0 king added

Some problem can be extremely difficult but let me propose some "easy" ones, just to see if you are interested
Can you solve the five following ones (white to move):




