Permuting network and its use in automatic patching for hybrid and analogue computers

A mathematical proof for the absolute minimum number of double-pole double-throw reversing switches required for permuting n×n terminals has been derived. Several permuting networks of different capabilities can be accommodated in parallel to perform all possibilities of the analogue circuits for automatic patching.