O(m x n), where n is the number of pieces and m is the number of systems it needs to interconnect with. O(n^2) is the asymptotic upper bound, which is never reached, because a piece needn't be connected to itself: m < n for all n, but m/n can approach 1 as n goes to infinity.

It wouldn't be Hacker News without such ponderous pedantry!