@10955
"computers can't do it"
++ Present computers cannot strongly solve Chess to a 32-men table base of 10^44 positions,
but present computers can weakly solve Chess, like Schaeffer weakly solved Checkers.
The 17 ICCF World Championship finalists with their computers are now about there:
106 draws out of 106 games, and whatever white tries, not one but several lines draw for black.
@10881
"The scenario is that player A underpromotes because it is the only way to win.
If he promoted to a queen, the route to the win that would work after the underpromotion happens to be blocked by a statemate."
++ So we have a position won for A. If A promotes to a queen, then a draw by stalemate results. So A avoids the draw by stalemate by underpromoting to a rook or even a bishop and still retains a won position. So B has a lost position.
Then there is no reason for B to underpromote to a rook or bishop.