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.

enter image description here

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.

enter image description here


1 Answer 1


Lower bound:

91 enter image description here 7 with king, 40 with pawns, 34 with knights, 2 with each other piece


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.