royaldynasty, breton advers AND a) maximummer: wrong solution b) blackmaximummer: right solution

[popeye37]

In a) of the problem below, there is one additional solution with a short bK move. Funny ...

BeginProblem
Stipulation ser-h=6
Option NoBoard
Condition maximummer breton advers royaldynasty
Pieces
white Pb6 Kc8
black Pa7 Ka8
Twin condition blackmaximummer breton advers royaldynasty

result:
Popeye Linux-5.10.0-26-amd64-unknown-64Bit v4.89 (8192 MB)
a)
1.a7-a5 2.a5-a4 3.a4-a3 4.a3-a2 5.a2-a1=K 6.Ka8-b7 + Kc8b7[-bKa1] =
1.a7-a5 2.a5-a4 3.a4-a3 4.a3-a2 5.a2-a1=K 6.Ka8-a7 b6a7[-bKa1] =

b) BlackMaximummer
RoyalDynasty
Breton Adverse

1.a7-a5 2.a5-a4 3.a4-a3 4.a3-a2 5.a2-a1=K 6.Ka8-b7 + Kc8*b7[-bKa1] =

solution finished. Time = 0.064 s

[dcolazin]

Hello, I think that to replicate this issue the only relevant condition is Maximummer. Maximummer applies to the defending side, while BlackMaximummer and WhiteMaximummer applies to the respective color; in series-help-problems, the defending is white. For example 5R2/2k1p1p1/7N/4P1P1/3P4/5P2/5RPP/4K3 is a ser-h#29 Maximummer, but black is unconstrained using Maximummer. BlackMaximummer finds the solution. For usual help-problems, black is the defending side.

[popeye37]

Hi, you are right, it seems to be a maximummer issue only.
Can you please tell me, where I can read about the changed official rules for maximummer ?
In the beginning, maximummer applied to black only. As problem composer began to create problems where white had to do the longest possible moves, I implemented in Popeye WhiteMaximummer to solve their needs and BlackMaximummer to have the possibility to check DoubleMaximummer problems. BlackMaximummer was only a new name to be consistent with the naming for white. It behaved identical to Maximummer. There was never a rule "applies to the defending side".
By the way, what is the definition of "defending side" ?
In my opinion, the defending side is the one that does not want to reach the goal.
In any type of usual stipulations with "help" at the end, both want to reach the goal, so there is no defender ...
So your example is a correct ser-h#29 Maximummer. Popeye doesn't solve it, because it does not obey the maximummer rules I know. Looks like a bug to me, because this behaviour has been changed some time in the past...
Wow, it has been changed LONG ago ... py447 does solve your example "right", py448 solves "wrong" ...
Has there been any comment of this change in the documentation and of the new maximummer rules in the public ?