1.34 In the following truncated chessboard, there are 8 squares. If two squares share at least one common vertex, they are considered connected. Use 8 numbers $1,2,3,4,5,6,7,8$ to label these squares with different numbers, and ensure that connected squares are not labeled with consecutive numbers. How many different labeling methods are there?
[Solution] As shown in the figure, $B$ is connected to 6 squares. By labeling the chessboard, according to the problem, the numbers of connected squares do not follow each other. Therefore, $B$ must be 1 or 8. Similarly, $C$ must be 1 or 8.
(1) $B=1, C=8$. In this case, $D=2, A=7$, meaning $A, C, D$ are determined by $B$.
The remaining numbers are $3,4,5,6$, and the squares are $E, F, G, H$. Since $E, F$ are connected to $A$, $E, F$ can only choose from 3,4, and $G, H$ choose from 5,6, so there are two ways to choose.
(2) $B=8, C=1$. Similarly, there are also two ways to choose.
Therefore, there are a total of 4 ways to choose.