I think it’s possible that at least 1 position (and probably a lot more) will have more than 1 optimal solution. In this case, it’ll depend on the determinism of the engine. If the engine is not fully deterministic, then it’s possible instead of a normal cycle, we get a permutation cycle instead (all strategies are permutations of n, but the order is not cyclic in the traditional sense).
The other thing that would compound this is that no current chess engine solves the game fully. There would be even more positions that have multiple “optimal” solutions if the engine only looks ahead to bounded x.
> The other thing that would compound this is that no current chess engine solves the game fully. There would be even more positions that have multiple “optimal” solutions if the engine only looks ahead to bounded x.
I'm not sure this is an obstacle; we're explicitly excluding the computer's preferred move, rather than the necessarily optimal move, after all. You could easily play human chess with the engine from (e.g.) Battle Chess, which honestly is sort of an interesting idea in its own right.
It is an interesting theoretical question whether we can have Aleph Zero Human Chess where Human(Human(...(Chess))) is applied infinitely, approaching Aleph Zero trainings of AlphaZero, or we get a redundant variant after some application where further application of Human() no longer produces a new variant.