Programming Challenge: a classic trigonometry problem

[Bunuel66]

Going that way it is possible to build a more 'brute force' approach:

Rewriting equations from my previous post like:

1) BC-15(B+C)=d(B,C)
2) B²+L²-40²=e(B,L)
3) C²+L²-30²=f(B,L)

Let's build a cost function J=d²(B,C)+e²(B,L)+f²(B,L)
Then using a standard gradient descent it is possible to solve J iteratively for B,C,L in one shot.

Nevertheless I like a little bit of calculations before taking the hammer ;-)

BTW, scipy has some non linear multidimensional solvers. I haven't experimented with them.

Regards