Trouve le nombre maximum de points d'intersection

Essaie de faire mieux !

Tu peux améliorer ce score.
Tes cercles sont-ils sécants ?

Tu y es presque !
Regarde les quatre côtés du rectangle.

Super score !

F = (3.406403082330015, 0.2809165745054106)
E = (3.465506464081454, 1.9358112635457112)
e = Segment(E, F)
g = OrthogonalLine(E, e)
G = Point(g)
h = OrthogonalLine(G, g)
f = OrthogonalLine(F, e)
I = Intersect(f, h)
poly1, f_1, e_1, g_1, i = Polygon(F, E, G, I)
D = (1.6096602770862598, 2.243148848653196)
C = (0.7467509035152458, 0.4464060434094406)
d = Circle(C, D)
S, T = Intersect(d, f_1)
R, A_1 = Intersect(d, e_1)
Q, V = Intersect(d, g_1)
O, P = Intersect(d, i)
B = (3.6191752566351965, 1.0492605372741215)
A = (3.749202696488363, 0.2809165745054112)
c = Circle(A, B)
N, U = Intersect(c, i)
B_1, C_1 = Intersect(c, d)
M, W = Intersect(c, g_1)
L, Z = Intersect(c, e_1)
J, K = Intersect(c, f_1)
a = Segment(A, B)
b = Segment(C, D)
H = Intersect(f, h)
liste1 = Length(KeepIf[Defined[Z_1], Z_1, {J, K, L, M, N, O, P, Q, R, S, T, U, V, W, Z, A_1, B_1, C_1}])
j = Defined(J)
texte2: "Ton score : " + liste1 + ""