Originally posted by PBE6You might be able to use a reflection principle to work out A(m). The number of paths from A to B that hit zero is equal to the number of paths from A to -B.
This is a little bit complicated, because not all arrangements are valid (you can't have more than B-1 losses in a row before getting a few wins)