Connection link measuring system - determines shortest path between two points in X-Y matrix using clock pulse sequence interrogation

摘要

This conputer-controlled system works out the shortest connecting link required to join two points in an X-Y matrix. Each point in the matrix is connected to an individual circuit which can interrogate its adjacent points to find the finish point of the link, and a memory to record the direction from which the interrogation signal came. At the start of the operation (n=O), the start point interrogates the four adjacent points, to ascertain if one of them is the finish point, and blocks them to further interrogation. At the next clock pulse (n=1) each of the four points interrogates its unblocked neighbours. This process continues, spreading across the matrix on a diamond-shaped front until the finish point is located. At this point the computer uses the elapsed time and the direction memories to calculate the length of link required.