[ Help | Earliest Comments | Latest Comments ][ List All Subjects of Discussion | Create New Subject of Discussion ][ List Earliest Comments Only For Pages | Games | Rated Pages | Rated Games | Subjects of Discussion ]Single Comment Asymmetric Chess. Chess with alternative units but classical types and mechanics. (8x8, Cells: 64) [All Comments] [Add Comment or Rating]H. G. Muller wrote on 2016-12-02 UTC"E4 means this leaping push?" Indeed. Fairy-Max uses the primary rights-code '4', which would mean a move without any rights and without continuation (which thus would be totally useless) as an 'escape' for indicating moves that only 'virgin' pieces have. The preceding hex digit is then used to indicate what the move can actually do: a slider step creating e.p. rights on the visited square, (which is interpreted as castling on a royal piece), a sliding step creating no e.p. rights, or a jump over the square. The lowest two bits would specify the rights for the next (terminating) step. For E = 1110 this would be move-but-not-capture "If I'll want to make Orcish Pawns have promotion only to Nightriders (unique unit, which is absent in starting army), then I would put the Nightrider to #7 (or #9 black), moving the Orcish Queen to the end of list, it will work correctly?" That might not work. IIRC Fairy-Max will always use #7 for both sides, unless the initial setup would contain a #7 for white, and a #9 but not #7 for black. So if black does not initially have #9... Of course the code can be easily changed; the rule that each side promotes to #7 if it has a #7 in the initial setup, and to #9 otherwise, irrespective if they have it or not would have the same effect in all currently supported variants. And Fairy-Max 5.0 takes the promotion piece from a board-size table ayway (to make Grant Acedrex possible, where the piece is determined by the promotion square). Before version 5.0 Fairy-Max did have problems with Nightriders, because these make mutual perpetual chack possible, Sooner or later the search would stumble on a position where this occurred, and because each check evasion extends the search by 1 ply (i.e. the check evasions are not counted in the search depth), this wouldleed to infinitely deep recursion, and a crash due to stack overflow. But Fairy-Max 5.0 doeshave in-search recognition of repetitions, and I think this should cure thisproblem. (Otherwise Griffons (in theGrant Acedrex sense) would also have been a problem, as these can do this too.