For the quite similar puzzle Atomix, it also seems like the branching factor would be much higher for backward search because upper bounds are weaker, but you can show that on average the branching factor is actually the same [1]. I wonder if the same argument would work here.
[1] http://hueffner.de/falk/hueffner-studienarbeit-atomix.pdf Section 5.5