Syntenic distance, an evolutionary distance model, is the minimum number of fusions, fissions, and translocations required to transform one genome into another. The problem of computing for the syntenic distance between two genomes has been proven to be NP-hard. Translocation syntenic distance is a special case of syntenic distance wherein operations are restricted to translocations. This restriction leads to the limitation of input instances to square instances only. As of writing, there remains no available computational complexity results for the problem of finding the minimum translocation syntenic distance between two genomes. In this paper, we focus on the translocation syntenic distance of square input instances with square connected components. A BFS-based polynomial-time algorithm for translocation syntenic distance is devised and proven effective. The algorithm runs on O(n 2 ) time and takes up O(n 2 ) space. A conjecture on the NP-hardness of the minimum translocation synteny problem is also presented. The idea behind the conjecture comes from the relationship between the translocation syntenic distance problem and the unsigned translocation distance problem, which was already proven to be NP-hard.