Being inspired, I concoct a question. It starts from a set chess board with only the White pieces. Chess problems in which only one side moves are called seriesmovers.
What is the longest shortest possible sequence of series moves from the prescribed start?
For example, this position can be proven to take a minimum of 7 series moves.
I am wondering what position/s can be proven to take the longest, assuming White plays as minimally as possible.
To get you started, this position takes a minimum of 79 moves.