What would happen if:
Eng: F(Mao) S F(Spa)(sc)-Wes, F(Nap) S F(Ion)-Tyh
Ita F(Tsc) SH Tyh, A(Rom)-Tun, F tyh C Rom-Tun
Fra F(Wes) & F(GoL) C A(NAf)-Tsc, F(Tun) SH F(Wes)
My problem is that The Italian attack on Tunis cuts the support for F(Wes), so the English attack on Wes succeeds, by which F(Wes) is dislodged, therefore A(NAf) can't get to Tus, so the support for F(Tyh) is not cut, therefore the English attack on Tyh fails; but, if you resolve the orders in the opposite order the French attack on Tsc cuts the support for F(Tyh), which is dislodged, therefore A(Rom) never arrives at Tunis, therefore the support for F(Wes) is not cut, therefore A(NAf) does arrive at Tuscany, therefore the support for F(Tyh) is cut, etc.’
So, how would this be resolved (by you guys or by the computer judge)?