Juan, the endings you mentioned would have to be some of the most treacherous possible! I could always write a program to solve the endings and report the results back so I would know how long the win would take from any position. I could then make this database avaialbe for everyone.

The problem is: the construction time is long and I would need to use about 4 computers to solve these endings.

My partner and I already generated large databases for the game of checkers. We have every solution for any endgame involving 8 pieces. That is roughly 111 billion positions!

We also have "distance to win" information for the 19 billion seven piece endings. This takes up 7 gigabytes on your hard drive in its compressed form!

So, just to let you know, I know how to solve endgames via retrograde analysis. Before we do something like A+P vs. R, we need to solve all of the endings such as:

A vs. R
AQ vs. R
AC vs. R
AA vs. R
AB vs. R
AN vs. R

Why? Because a pawn could promote to ANY one of those pieces, and we need to know the result of ALL of the conversion information before we can solve the pawn ending!

For this reason, it becomes a big task, but I am up for the challenge.