@MARattigan, do you accept my point that we can ignore all positions where both sides have extra rooks or bishops?
ironically tygxc's whole thing about underpromotion isnt even something that couldnt be argued. hes just going for the whole wrong type of argument.
what needs to be done is to estimate (tbh make it an open assumption) that the number of positions with non queen promotions that would actually be relevant to be less than the number of the other total positions, using a confidence assumption drawn from master games.
because tygxc doesnt recognize the difference between a confident assumption and a rigorous logical maneuver, he doesnt have the ability to utilize the differences in what is to be at the end a CONFIDENT ESTIMATE of computing power.
unfortunately, what ive presented is an incomplete argument, due to a lack of transition to code execution, and theres a couple more confidence assumptions that need to be made (especially to deal with the fact that you MUST take underpromotions into account by at least one side in a weak solution). And im not going to waste effort and time on tygxc, but if yall want to i can right it out with more detail.
@MARattigan, do you accept my point that we can ignore all positions where both sides have extra rooks or bishops?
With the way positions for black and white have dual use in a solution (i.e. a legal move that reaches a position that has already occurred in the analysis tree for the other side need not be analysed further) we need only deal with positions where "side B" has <=2 bishops and <=2 rooks.
That should save a useful amount on the Tromp number. Or at least what would be a useful number if a solution was close to feasible.
I wonder how much it saves?
Possibly. We can have an interesting discussion on exactly how unfeasible a forward searching solution is if we can manage to clear the thread of @tygxc's cut and pastes and @Optimissed's ramblings. I'll think about it, but a bit overloaded at the mo.