I meant the bent rider that moves as Knight first and then camelrider
Ah, I misunderstood that. I am afraid this is not possible in XBetza. The problem is that you cannot repeat a set of legs in XBetza to make it a rider, only the basic leap of the atom. This forces use of the Camel atom, but there is no way you could write a Knight move as Camel moves, as the Camel is color bound. (Camel and then Nightrider would be possible, as a Camel can be writte as two Knight moves.)
It could be made possible by allowing parentheses with a repeat count on groups of modifiers, meaning that group could be repeated an arbitrary number of times. (I.e. x(y)4zA = xyzAxyyzAxyyyzAxyyyyzA .) Of course on a board with a finite size you know the maximum number of steps the rider leg could have, and write it as a combination of lame leaps to every possible destination. After all, R = WafWafafWafafafW... . Likewise you could write NalmparNalmparalmparN... , writing the Camel leap as two Knight leaps, transparently glued together at a move-or-hop intermediate square. A short-cut notation for this could be N(almpar)0N , where the 0 means arbitrarily many. (Or you could just use a large number.)
Ah, I misunderstood that. I am afraid this is not possible in XBetza. The problem is that you cannot repeat a set of legs in XBetza to make it a rider, only the basic leap of the atom. This forces use of the Camel atom, but there is no way you could write a Knight move as Camel moves, as the Camel is color bound. (Camel and then Nightrider would be possible, as a Camel can be writte as two Knight moves.)
It could be made possible by allowing parentheses with a repeat count on groups of modifiers, meaning that group could be repeated an arbitrary number of times. (I.e. x(y)4zA = xyzAxyyzAxyyyzAxyyyyzA .) Of course on a board with a finite size you know the maximum number of steps the rider leg could have, and write it as a combination of lame leaps to every possible destination. After all, R = WafWafafWafafafW... . Likewise you could write NalmparNalmparalmparN... , writing the Camel leap as two Knight leaps, transparently glued together at a move-or-hop intermediate square. A short-cut notation for this could be N(almpar)0N , where the 0 means arbitrarily many. (Or you could just use a large number.)