equence pair offers similar kinds of advantages as the Polish Expression

[Wong and Liu, 1986] when used in conjunction with Simulated Annealing: (i)
efficient exploration of the solution space via local search, and (ii) polynomial
time evaluation of a candidate solution. In addition, the authors showed that
the solution space defined by sequence pair is so called “P-admissible” in that
there always exists an optimal solution to the floorplanning problem that can
be encoded using sequence pair. The authors provide three types of moves that
are used to perturb the current sequence pair: M1 is swapping a random pair
of modules in the first sequence, M2 is swapping a random pair of modules in
both sequences, and M3 is rotating a randomly selected module by 90-degree.
Practice Problem
Consider the following sequence pair SP 1 = (17452638, 84725361). The
(width, height) of the modules 1 through 8 are {(2,4), (1,3), (3,3), (3,5), (3,2),
(5,3), (1,2), (2,4)}.
1. Draw the horizontal and vertical constraint graphs.
Table 3.2 shows the relative positions derived from SP 1 . The corresponding
horizontal and vertical constraint graphs are shown in Figures 3.12 and
3.13, respectively.
2. What is the minimum area of the non-slicing floorplan?
Figure 3.14 shows the constraint graphs with the longest s-t paths. The
width of the floorplan is 11 from the HCG, and the height is 15 from the
VCG. Thus, the floorplan area is 11 × 15 = 165.
3. Draw the corresponding non-slicing floorplan. Find the location of the lower
left corner of each module.
Table 3.3 shows the longest path length from the source