The question concerns chess. I call a move *forced* if, in a given position, is the unique move consistent with the rules of the game. I wonder what is the largest integer $n$ such that there exists a legal position in which:


1. both black and white have forced moves for $n$ consecutive times;
2. the position is never repeated (with the same color having to move).


Notice that without condition 2., the answer is $\infty$.



How many consecutive forced moves are possible in chess?
This question has been answered at [chess.stackexchange.com](https://chess.stackexchange.com/q/4963/). It seems that if you allow promoted pieces, the current record is $n=9$.


