The Lion must actually make a back-and-forth step to null move. If there is no empty square next to it, it cannot null-move. So mabK is exactly right. But it can actually be 8 null moves, which is a bit problematic for the AI. In fact if different pieces make a null move, it is still the same move. But the ID has no way to enter a turn pass anyway.
I am not sure [G-B] would already work. But it really should (transforming it to [mpF-mpF-F-B]), so eventually I will fix that. Every bracket case with incommensurate atoms has to be programmed separately, for how to expand it in K steps.
The Lion must actually make a back-and-forth step to null move. If there is no empty square next to it, it cannot null-move. So mabK is exactly right. But it can actually be 8 null moves, which is a bit problematic for the AI. In fact if different pieces make a null move, it is still the same move. But the ID has no way to enter a turn pass anyway.
I am not sure [G-B] would already work. But it really should (transforming it to [mpF-mpF-F-B]), so eventually I will fix that. Every bracket case with incommensurate atoms has to be programmed separately, for how to expand it in K steps.